Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 240

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 access
Vartiainen, Juha J., Möttönen, Mikko, Salomaa, Martti M.·2004·Physical Review Letters

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.92.177902

Cites

8 of 8 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 8 references

Cited by

See all 240

Metadata

Authors
Vartiainen, J. J., Möttönen, M., & Salomaa, M. M.
Venue
Physical Review Letters
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.