The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Computational Advantage from Quantum-Controlled Ordering of Gates
Open accessAbstract
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more general kind of quantum computing that allows transformations on blackbox quantum gates that are impossible in a circuit with fixed order. Here we show that this model of quantum computing is physically realizable, by proposing an interferometric setup that can implement such a quantum control of the order between the gates. We show that this new resource provides a reduction in computational complexity: we propose a problem that can be solved by using O(n) blackbox queries, whereas the best known quantum algorithm with fixed order between the gates requires O(n^{2}) queries. Furthermore, we conjecture that solving this problem in a classical computer takes exponential time, which may be of independent interest.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 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 · cited 1×
“Typically, black-box computation is studied within the quantum circuit formalism [ 1 ].”
MethodWave–particle duality of C60 molecules
Arndt, M., Nairz, O., Vos-Andreae, J., Keller, C., van der Zouw, G., & Zeilinger, A. (1999) · Nature · doi:10.1038/44348 · Cited by 1,238
Efficient Sorting of Orbital Angular Momentum States of Light
Berkhout, G. C. G., Lavery, M. P. J., Courtial, J., Beijersbergen, M. W., & Padgett, M. J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.153601 · Cited by 1,110
Quantum correlations with no causal order
Oreshkov, O., Costa, F., & Brukner, Č. (2012) · Nature Communications · doi:10.1038/ncomms2076 · Cited by 682
Self-citationQuantum computations without definite causal structure
Chiribella, G., D’Ariano, G. M., Perinotti, P., & Valiron, B. (2013) · Physical Review A · doi:10.1103/physreva.88.022318 · Cited by 521
Efficient separation of the orbital angular momentum eigenstates of light
Mirhosseini, M., Malik, M., Shi, Z., & Boyd, R. W. (2013) · Nature Communications · doi:10.1038/ncomms3781 · Cited by 498
Eibenberger, S., Gerlich, S., Arndt, M., Mayor, M., & Tüxen, J. (2013) · Physical Chemistry Chemical Physics · doi:10.1039/c3cp51500a · Cited by 309
Perfect discrimination of no-signalling channels via quantum superposition of causal structures
Chiribella, G. (2012) · Physical Review A · doi:10.1103/physreva.86.040301 · Cited by 253
Adding control to arbitrary unknown quantum operations
Zhou, X.-Q., Ralph, T. C., Kalasuwan, P., Zhang, M., Peruzzo, A., Lanyon, B. P., & O'Brien, J. L. (2011) · Nature Communications · doi:10.1038/ncomms1392 · Cited by 173 · cited 2×
“This algorithm is not usually applied to blackbox unitaries, but this can be done us-ing the techniques in [ 8 – 10 ].”
BackgroundMethodQuantum circuits cannot control unknown operations
Araújo, M., Feix, A., Costa, F., & Brukner, Č. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/9/093026 · Cited by 140
Self-citationCalculating unknown eigenvalues with a quantum algorithm
Zhou, X., Kalasuwan, P., Ralph, T. C., & O’Brien, J. L. (2013) · Nature Photonics · doi:10.1038/nphoton.2012.360 · Cited by 77
Comparison of unitary transforms using Franson interferometry
Andersson, E., Bergou, J. A., & Jex, I. (2005) · Journal of Modern Optics · doi:10.1080/09500340500052911 · Cited by 11
Cited by
Experimental superposition of orders of quantum gates
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) · Nature Communications · doi:10.1038/ncomms8913 · Cited by 309
Self-citationExperimental 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-citationCosta, F., & Shrapnel, S. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/6/063032 · Cited by 259
Self-citation
Metadata
- Authors
- Araújo, M., Costa, F., & Brukner, Č.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2014-12-18
- Volume
- 113
- Issue
- 25
- Pages
- 250402-250402
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2068708279
- Cited by
- 293
- References
- 12
- FWCI
- 15.84
- 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
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.