Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve, David Peter Divincenzo, Norman Margolus, Peter W. Shor, Tycho Sleator, John A. Smolin, Harald Weinfurter
Physical Review A · 1995 · 4,550 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Barenco, A., Bennett, C. H., Cleve, R., Divincenzo, D. P., Margolus, N., Shor, P. W., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995). Elementary gates for quantum computation. Physical Review A, 52(5), 3457–3467. https://doi.org/10.1103/physreva.52.3457
In text: (Barenco et al., 1995)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
We show that a set of gates that consists of all one-bit quantum gates [U(2)] and the two-bit exclusive-OR gate [that maps Boolean values (x,y) to (x,x\ensuremath{\bigoplus}y)] is universal in the sense that all unitary operations on arbitrarily many bits n [U(${2}^{\mathit{n}}$)] can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical and of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.
Related papers
- Low-density parity-check codes1962
- Quantum Computing in the NISQ era and beyond2018
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer1997
- Quantum supremacy using a programmable superconducting processor2019
- A variational eigenvalue solver on a photonic quantum processor2014
Metadata from OpenAlex (CC0). Citations are generated from the published record.