The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Efficient Decomposition of Quantum Gates
Open accessAbstract
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
Cited by
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
Quantum Circuits for General Multiqubit Gates
Möttönen, M., Vartiainen, J. J., Bergholm, V., & Salomaa, M. M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.130502 · Cited by 390
Self-citationQuantum-state preparation with universal gate decompositions
Plesch, M., & Brukner, Č. (2011) · Physical Review A · doi:10.1103/physreva.83.032302 · Cited by 335
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“[10] provide a method for doing this with a gate model quantum computer.”
MethodSimple factorization of unitary transformations
de Guise, H., Di Matteo, O., & Sánchez-Soto, L. L. (2018) · Physical Review A · doi:10.1103/physreva.97.022328 · Cited by 70
Metadata
- Authors
- Vartiainen, J. J., Möttönen, M., & Salomaa, M. M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-04-29
- Volume
- 92
- Issue
- 17
- Pages
- 177902-177902
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1983474581
- Cited by
- 240
- References
- 8
- FWCI
- 9.83
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Decomposition of Quantum Gates. https://app.cochat.ai/papers/10.1103/physrevlett.92.177902
- The paper
- Vartiainen, J. J., Möttönen, M., & Salomaa, M. M. (2004). Efficient Decomposition of Quantum Gates. Physical Review Letters. https://doi.org/10.1103/physrevlett.92.177902
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.