Controlled NOT gate
Quantum logic gate that operates on 2 qubits, flipping the second qubit if and only if the first qubit is 1
In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states.
Nº Q917713 ★
Common · Knowledge
Controlled NOT gate
Quantum logic gate that operates on 2 qubits, flipping the second qubit if and only if the first qubit is 1
In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computer science, the controlled NOT gate (also C-NOT or CNOT), controlled-X gate, controlled-bit-flip gate, Feynman gate or controlled Pauli-X is a quantum logic gate that is an essential component in the construction of a gate-based quantum computer. It can be used to entangle and disentangle Bell states. Any quantum circuit can be simulated to an arbitrary degree of accuracy using a combination of CNOT gates and single qubit rotations. The gate is sometimes named after Richard Feynman who developed an early notation for quantum gate diagrams in 1986. The CNOT can be expressed in the Pauli basis as: CNOT = e i π 4 ( I 1 − Z 1 ) ( I 2 − X 2 ) = e − i π 4 ( I 1 − Z 1 ) ( I 2 − X 2 ) . {\displaystyle {\mbox{CNOT}}=e^{i{\frac {\pi }{4}}(I_{1}-Z_{1})(I_{2}-X_{2})}=e^{-i{\frac {\pi }{4}}(I_{1}-Z_{1})(I_{2}-X_{2})}.} Being both unitary and Hermitian, CNOT has the property e i θ U = ( cos θ ) I + ( i sin θ ) U {\displaystyle e^{i\theta U}=(\cos \theta )I+(i\sin \theta )U} and U = e i π 2 ( I − U ) = e − i π 2 ( I − U ) {\displaystyle U=e^{i{\frac {\pi }{2}}(I-U)}=e^{-i{\frac {\pi }{2}}(I-U)}} , and is involutory. The CNOT gate can be further decomposed as products of rotation operator gates and exactly one two qubit interaction gate, for example CNOT = e − i π 4 R y 1 ( − π / 2 ) R x 1 ( − π / 2 ) R x 2 ( − π / 2 ) R x x ( π / 2 ) R y 1 ( π / 2 ) . {\displaystyle {\mbox{CNOT}}=e^{-i{\frac {\pi }{4}}}R_{y_{1}}(-\pi /2)R_{x_{1}}(-\pi /2)R_{x_{2}}(-\pi /2)R_{xx}(\pi /2)R_{y_{1}}(\pi /2).} In general, any single...
Text: Wikipédia, CC BY-SA 4.0. · Image: George.ad.Stamatiou (CC BY-SA 3.0) ·
Related cards
Sheffer stroke
Logical operation that asserts that at least one of its operands is false
Nº Q3874243 ★★
Quantum programming
Computer programming approach dedicated to quantum computers
Nº Q4218497 ★
NAND logic
Logic constructed only from NAND gates
Nº Q4116068 ★★
Parametron
Logic circuit
Nº Q7135236 ★★★
Clock gating
Technique used in synchronous circuits for reducing dynamic power dissipation, by adding more logic to a circuit to prune the clock tree (disabling portions of the circuitry so that the flip-flops in them do not have to switch states)
Nº Q590170 ★★
Fowler–Noll–Vo hash function
Non-cryptographic hash function
Nº Q1389328 ★★