Journal of Modern Optics

Universal-NOT gate

V. Bu[zcirc]ek, Mark S. Hillery, F. Werner

Published Feb 1, 2000• 30 citations

Abstract

The action of a NOT gate on a classical bit results in a change of its value from a 0 to a 1 and vice versa. The action of the classical NOT gate is in principle perfect because with fidelity equal to unity it complements the value of a bit. The action of the quantum NOT gate in a computational basis |0⟩ and |1⟩ is very similar to the action of the classical NOT gate. However, a more general quantum mechanical operation which corresponds to a classical NOT gate would take a qubit in an arbitrary state |Ψ⟩ and produce a qubit in the state |Ψ⊥⟩ orthogonal to |Ψ⟩. This operation is anti-unitary and therefore, cannot be realized exactly. So how well we can do? We find a unitary transformation acting on an input qubit and some auxiliary qubits, which represent degrees of freedom of the quantum NOT gate itself, which approximately realizes the NOT operation on the state of the original qubit. We call this ‘device’ a universal-NOT gate because the size of the error it produces is independent of the input state. We show that an optimal U-NOT gate which has as its input N identical qubits and produces M outputs achieves a fidelity of F = (N + 1)/ (N + 2), which is equal to the fidelity of estimation of the input qubits. We also show that when a priori information about the state of the input qubit is available, the fidelity of a quantum NOT gate can be much better than the fidelity of estimation.

DOI: 10.1080/09500340008244037

Related papers

Optimal Manipulations with Qubits: Universal NOT Gate

Vladimír Bužek, Mark S. Hillery, Reinhard F. Werner

It is not a problem to complement a classical bit, i.e. to change the value of a bit, a 0 to a 1 and vice versa. This is accomplished by a NOT gate. Complementing a qubit in an unknown state, however, is another matter. We show that this operation cannot be done perfectly. We define the Universal-NOT (U-NOT) gate which out of N identically prepared pure input qubits generates M output qubits in a state which is as close as possible to the perfect complement. This gate can be realized by classical estimation and subsequent re-preparation of complements of the estimated state. Its fidelity is therefore equal to the fidelity F= (N+1)/(N+2) of optimal estimation, and does not depend on the required number of outputs. We also show that when some additional a priori information about the state of input qubit is available, than the fidelity of the quantum NOT gate can be much better than the fidelity of estimation.

arXiv:quant-ph/9901053Jan 17, 19993 citations

Optimal manipulations with qubits: Universal-NOT gate

Vladimír Bužek, Mark S. Hillery, Reinhard F. Werner

Quantum information processing is usually associated with a specific computational basis. Nevertheless, for a deeper understanding of the fundamental principles of quantum computing, it is essential to investigate what is the fidelity of universal operations that are basis independent; i.e., the task is to perform optimally a specific operation on a qubit or a quantum register that is in an unknown state. In this paper we introduce the universal-NOT gate that takes as an input a qubit in an arbitrary state $|\ensuremath{\Psi}〉$ and generates an output that is as close as possible to the orthogonal state $|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉.$

Physical Review AOct 1, 1999235 citations

Realization of the universal‐NOT gate and of the universal quantum cloning

Carlo Sias, Fabio Sciarrino, F. De Martini

Abstract An arbitrary quantum state cannot be “cloned” perfectly, i.e. reproduced with “fidelity” F = 1 into M > 1 states identical to the original by any conceivable physical device. The main root of this impossibility resides in the linearity of quantum mechanics. A second “quantum impossibility” process, based on the complete positivity character of any quantum operation and conceivably subtly related to the first one, forbids the realization of a universal NOT gate i.e. one that flips exactly any input qubit into an orthogonal one. A detailed investigation of these results, representing the most fundamental difference between classical and quantum information, indeed can reveal the detailed structure of the latter one. We report an experimental demonstration of the process of cloning of N = 1 input qubit into M = 2 output qubits by a quantum‐injected optical parametric amplifier OPA. By the same apparatus the realization of a universal NOT gate is also demonstrated. The two processes will be found to be “universal” and optimal, i.e. the measured fidelity of both processes F < 1 will be found close to the theoretical values.

Fortschritte der PhysikApr 24, 20032 citations

Unitary and Anti-Unitary Quantum Descriptions of the Classical Not Gate

Gianpiero Cattaneo, G. Conte, Roberto Leporini

Two possible quantum descriptions of the classical Not gate are investigated in the framework of the Hilbert space C2: the unitary and the anti-unitary operator realizations. The two cases are distinguished interpreting the unitary Not as a quantum realization of the classical gate which on a xed orthogonal pair of unit vectors, realizing once for all the classical bits 0 and 1, produces the required transformations 0 => 1 and 1 => 0 (i.e., logical quantum Not). The anti-unitary Not is a quantum realization of a gate which acts as a classical Not on any pair of mutually orthogonal vectors, each of which is a potential realization of the classical bits (i.e., universal quantum Not). Although the latter is not completely positive, one can give an approximated unitary realization of the gate by appending an ancilla. Finally, we consider the unitary and the anti-unitary operator realizations of two important genuine quantum gates that transform elements of the computational basis of C2 into its superpositions: the square root of the identity and the square root of the Not.

Jan 1, 20100 citations

Optimal manipulations with qubits: universal quantum cloning and universal logical NOT operation

Vladimír Bužek, Mark S. Hillery

We analyze how information encoded in quantum systems can be optimally processed. In particular, we investigate copying (cloning) of quantum information (represented as states of 2-level quantum systems--qubits). We present unitary transformations which describe the optimal universal cloning of a qubit. Universality of the transformation guarantees that the fidelity of the cloning does not depend on the input state of the qubit, i.e. all states are cloned equally well. We present network for the optimal universal quantum cloning `machine' (transformation) which produces N + 1 copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copes, N. We also present the `machine' which universally and optimally clones states of quantum objects in arbitrary- dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers. In addition to cloning of qubits we analyzed another universal operation-- the Universal NOT. We present the optimal transformation and the corresponding logical network which optimally complements an arbitrary input state of a qubit. We show that the fidelity of the performance of the Universal NOT operation increases as a function of the number of input qubits prepared in the same state.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEJul 14, 19990 citations

A Quantum Model of Computation

Phillip Kaye, Raymond Laflamme, Michele Mosca

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50

Oxford University Press eBooksNov 16, 20060 citations