The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Experimental superposition of orders of quantum gates
Open accessAbstract
Quantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to ‘superimpose different operations’. Furthermore, it has been shown that using a qubit to coherently control the gate order allows one to accomplish a task—determining if two gates commute or anti-commute—with fewer gate uses than any known quantum algorithm. Here we experimentally demonstrate this advantage, in a photonic context, using a second qubit to control the order in which two gates are applied to a first qubit. We create the required superposition of gate orders by using additional degrees of freedom of the photons encoding our qubits. The new resource we exploit can be interpreted as a superposition of causal orders, and could allow quantum algorithms to be implemented with an efficiency unlikely to be achieved on a fixed-gate-order quantum computer.
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273 · cited 1×
“One example is measurement-based quantum computing [8], a different paradigm than the circuit model which paved the way for many experimental implementations of quantum algorithms [9, 10].”
MethodSelf-citationQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Demonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L., Chow, J. M., Gambetta, J. M., Bishop, L. S., Johnson, B. R., Schuster, D. I., Majer, J., Blais, A., Frunzio, L., Girvin, S. M., et al. (2009) · Nature · doi:10.1038/nature08121 · Cited by 1,172
Beating the channel capacity limit for linear photonic superdense coding
Barreiro, J. T., Wei, T.-C., & Kwiat, P. G. (2008) · Nature Physics · doi:10.1038/nphys919 · Cited by 870
Simplifying quantum logic using higher-dimensional Hilbert spaces
Lanyon, B. P., Barbieri, M., Almeida, M. P., Jennewein, T., Ralph, T. C., Resch, K. J., Pryde, G. J., O’Brien, J. L., Gilchrist, A., & White, A. G. (2009) · Nature Physics · doi:10.1038/nphys1150 · Cited by 754
Generation of Hyperentangled Photon Pairs
Barreiro, J. T., Langford, N. K., Peters, N. A., & Kwiat, P. G. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.260501 · Cited by 750
Quantum correlations with no causal order
Oreshkov, O., Costa, F., & Brukner, Č. (2012) · Nature Communications · doi:10.1038/ncomms2076 · Cited by 682
Self-citation
Cited by
Molecular spin qudits for quantum algorithms
Moreno-Pineda, E., Godfrin, C., Balestro, F., Wernsdorfer, W., & Ruben, M. (2018) · Chemical Society Reviews · doi:10.1039/c5cs00933b · Cited by 370
Experimental verification of an indefinite causal order
Rubino, G., Rozema, L. A., Feix, A., Araújo, M., Zeuner, J. M., Procopio, L. M., Brukner, Č., & Walther, P. (2017) · Science Advances · doi:10.1126/sciadv.1602589 · Cited by 265
Self-citationEnhanced Communication with the Assistance of Indefinite Causal Order
Ebler, D., Salek, S., & Chiribella, G. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.120502 · Cited by 255
Yen, T.-C., Verteletskyi, V., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00008 · Cited by 178
Izmaylov, A. F., Yen, T.-C., Lang, R. A., & Verteletskyi, V. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00791 · Cited by 171
Metadata
- Authors
- Procopio, L. M., Moqanaki, A., Araújo, M., Costa, F., Alonso Calafell, I., Dowd, E. G., Hamel, D. R., Rozema, L. A., Brukner, Č., & Walther, P.
- Venue
- Nature Communications
- Published
- 2015-08-07
- Volume
- 6
- Issue
- 1
- Pages
- 7913-7913
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W1615134144
- Cited by
- 309
- References
- 40
- FWCI
- 16.89
- Type
- journal article
- Language
- en
- Open access
- gold
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: Experimental superposition of orders of quantum gates. https://app.cochat.ai/papers/10.1038/ncomms8913
- The paper
- Procopio, L. M., Moqanaki, A., Araújo, M., Costa, F., Alonso Calafell, I., Dowd, E. G., Hamel, D. R., Rozema, L. A., Brukner, Č., & Walther, P. (2015). Experimental superposition of orders of quantum gates. Nature Communications. https://doi.org/10.1038/ncomms8913
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.