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 ★
Commune · Savoirs
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.
Dernier prix
—
Prix plancher
—
Médiane 7 j
—
Ventes 30 j
0
Fourchette 30 j
—
En circulation
0
Cours
médiane
min – max
ventes
Aucune vente sur la période
Voir le tableau
| Date | médiane | Min | Max | ventes |
|---|
Historique des ventes
- Dernière vente
- —
- Moyenne 30 j
- —
- Plus bas 30 j
- —
- Plus haut 30 j
- —
- Ventes 7 j
- 0
- Ventes 30 j
- 0
Aucune vente pour l'instant.
Ventes anonymes : ni acheteur ni vendeur. Les chiffres ne comptent que les ventes entre joueurs.
Sur Wikipédia
Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.
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...
Texte : Wikipédia en anglais, CC BY-SA 4.0. · Image : George.ad.Stamatiou (CC BY-SA 3.0) ·
Cartes voisines
-
F
Functional completeness
Property of a set of logical connectives which can express all possible truth tables by combining members of the set
Nº Q2348801 ★
Pas en vente
-
Barre de Sheffer
Opérateur logique
Nº Q3874243 ★★
Pas en vente
-
p
programmation quantique
Computer programming approach dedicated to quantum computers
Nº Q4218497 ★
Pas en vente
-
NAND logic
Logic constructed only from NAND gates
Nº Q4116068 ★★
Pas en vente
-
Parametron
Logic circuit
Nº Q7135236 ★★★
Pas en vente
-
Clock gating
Nº Q590170 ★★
Pas en vente