Both Toffoli and Controlled-NOT need little help to do universal quantum computation
| dc.creator | Shi, Yaoyun | |
| dc.date | 2002-05-18 | |
| dc.date | 2002-05-26 | |
| dc.date.accessioned | 2026-07-07T06:04:12Z | |
| dc.date.available | 2026-07-07T06:04:12Z | |
| dc.description | What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis. The result of Gottesman and Knill[quant-ph/9807006] implies that any quantum circuit involving only the Controlled-NOT and Hadamard gates can be efficiently simulated by a classical circuit. In contrast, we prove that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing. Previously only a ``generic'' gate, namely a rotation by an angle incommensurate with pi, is known to be sufficient in both problems, if only one single-qubit gate is added. | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0205115 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0205115 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90213 | |
| dc.subject | Quantum Physics | |
| dc.title | Both Toffoli and Controlled-NOT need little help to do universal quantum computation | |
| dc.type | text |