The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Quantum Circuits for General Multiqubit Gates
Open accessAbstract
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits-a unitary transformation with 4(n) degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4(n), and scales more favorably than the previously reported decompositions requiring 4(n)-2(n+1) controlled NOT gates.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
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 Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
A Survey of Combinatorial Gray Codes
Savage, C. (1997) · SIAM Review · doi:10.1137/s0036144595295272 · Cited by 482
Optimal quantum circuits for general two-qubit gates
Vatan, F., & Williams, C. (2004) · Physical Review A · doi:10.1103/physreva.69.032315 · Cited by 443
Minimal universal two-qubit controlled-NOT-based circuits
Shende, V. V., Markov, I. L., & Bullock, S. S. (2004) · Physical Review A · doi:10.1103/physreva.69.062321 · Cited by 288
Universal quantum circuit for two-qubit transformations with three controlled-NOT gates
Vidal, G., & Dawson, C. M. (2004) · Physical Review A · doi:10.1103/physreva.69.010301 · Cited by 277
Efficient Decomposition of Quantum Gates
Vartiainen, J. J., Möttönen, M., & Salomaa, M. M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.177902 · Cited by 240
Self-citation
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-state preparation with universal gate decompositions
Plesch, M., & Brukner, Č. (2011) · Physical Review A · doi:10.1103/physreva.83.032302 · Cited by 335
Gard, B. T., Zhu, L., Barron, G. S., Mayhall, N. J., Economou, S. E., & Barnes, E. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0240-1 · Cited by 266
Circuit-Based Quantum Random Access Memory for Classical Data
Park, D. K., Petruccione, F., & Rhee, J.-K. K. (2019) · Scientific Reports · doi:10.1038/s41598-019-40439-3 · Cited by 151
Simple 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
- Möttönen, M., Vartiainen, J. J., Bergholm, V., & Salomaa, M. M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-09-20
- Volume
- 93
- Issue
- 13
- Pages
- 130502-130502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2084040475
- Cited by
- 390
- References
- 16
- FWCI
- 7.79
- 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: Quantum Circuits for General Multiqubit Gates. https://app.cochat.ai/papers/10.1103/physrevlett.93.130502
- The paper
- Möttönen, M., Vartiainen, J. J., Bergholm, V., & Salomaa, M. M. (2004). Quantum Circuits for General Multiqubit Gates. Physical Review Letters. https://doi.org/10.1103/physrevlett.93.130502
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.