Both Toffoli and controlled-NOT need little help to do universal quantum computing

Yaoyun Shi

Published 2002 in Quantum information & computation

ABSTRACT

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.

PUBLICATION RECORD

  • Publication year

    2002

  • Venue

    Quantum information & computation

  • Publication date

    2002-05-18

  • Fields of study

    Mathematics, Physics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-7 of 7 references · Page 1 of 1

CITED BY

Showing 1-100 of 304 citing papers · Page 1 of 4