The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Quantum computations without definite causal structure
Open accessAbstract
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a predefined causal order. The simplest example of such a transformation is the classical switch of black boxes, where two input black boxes are arranged in two different orders conditionally on the value of a classical bit. The quantum version of this transformation---the quantum switch---produces an output circuit where the order of the connections is controlled by a quantum bit, which becomes entangled with the circuit structure. Simulating these transformations in a circuit with fixed causal structure requires either postselection or an extra query to the input black boxes.
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
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
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
Quantum ground state and single-phonon control of a mechanical resonator
O’Connell, A. D., Hofheinz, M., Ansmann, M., Bialczak, R. C., Lenander, M., Lucero, E., Neeley, M., Sank, D., Wang, H., Weides, M., et al. (2010) · Nature · doi:10.1038/nature08967 · Cited by 1,959
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
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
Quantum correlations with no causal order
Oreshkov, O., Costa, F., & Brukner, Č. (2012) · Nature Communications · doi:10.1038/ncomms2076 · Cited by 682
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
Theoretical framework for quantum networks
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2009) · Physical Review A · doi:10.1103/physreva.80.022339 · Cited by 517
Self-citationTowards a quantum programming language
SELINGER, P. (2004) · Mathematical Structures in Computer Science · doi:10.1017/s0960129504004256 · Cited by 480
Entangling Macroscopic Diamonds at Room Temperature
Lee, K. C., Sprague, M. R., Sussman, B. J., Nunn, J., Langford, N. K., Jin, X.-M., Champion, T., Michelberger, P., Reim, K. F., England, D., et al. (2011) · Science · doi:10.1126/science.1211914 · Cited by 392
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060401 · Cited by 381
Self-citationProgrammable Quantum Gate Arrays
Nielsen, M. A., & Chuang, I. L. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.321 · Cited by 379
Programming the universe: a quantum computer scientist takes on the cosmos
(2006) · Choice Reviews Online · doi:10.5860/choice.43-6586 · Cited by 362
Creating and Probing Multipartite Macroscopic Entanglement with Light
Paternostro, M., Vitali, D., Gigan, S., Kim, M. S., Brukner, C., Eisert, J., & Aspelmeyer, M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250401 · Cited by 321
Transforming quantum operations: Quantum supermaps
Chiribella, G., D'Ariano, G. M., & Perinotti, P. (2008) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/83/30004 · Cited by 321
Self-citationQuantum computing, postselection, and probabilistic polynomial-time
Aaronson, S. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2005.1546 · Cited by 311
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
Self-citationTowards quantum gravity: a framework for probabilistic theories with non-fixed causal structure
Hardy, L. (2007) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/40/12/s12 · Cited by 211
A Lambda Calculus for Quantum Computation
van Tonder, A. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703432165 · Cited by 197
A lambda calculus for quantum computation with classical control
SELINGER, P., & VALIRON, B. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005238 · Cited by 177
Self-citationClosed Timelike Curves via Postselection: Theory and Experimental Test of Consistency
Lloyd, S., Maccone, L., García−Patrón, R., et al. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.040403 · Cited by 154
Ultrafast Switching of Photonic Entanglement
Hall, M., Altepeter, J. B., & Kumar, P. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.053901 · Cited by 116
Optimal Cloning of Unitary Transformation
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.180504 · Cited by 80
Self-citationProperties of quantum nonsignaling boxes
Piani, M., Horodecki, M., Horodecki, P., & Horodecki, R. (2006) · Physical Review A · doi:10.1103/physreva.74.012305 · Cited by 80
Generalized channels: Channels for convex subsets of the state space
Jenčová, A. (2012) · Journal of Mathematical Physics · doi:10.1063/1.3676294 · Cited by 35
Generalized channels: channels for convex subsets of the state spacePreprint
(2016) · Cited by 24
Optimal probabilistic simulation of quantum channels from the future to the past
Genkina, D., Chiribella, G., & Hardy, L. (2012) · Physical Review A · doi:10.1103/physreva.85.022330 · Cited by 23
Self-citation
Cited by
Non-Markovian quantum processes: Complete framework and efficient characterization
Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M., & Modi, K. (2018) · Physical Review A · doi:10.1103/physreva.97.012127 · Cited by 334
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
Computational Advantage from Quantum-Controlled Ordering of Gates
Araújo, M., Costa, F., & Brukner, Č. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.250402 · Cited by 293
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
Costa, F., & Shrapnel, S. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/6/063032 · Cited by 259
Metadata
- Authors
- Chiribella, G., D’Ariano, G. M., Perinotti, P., & Valiron, B.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2013-08-14
- Volume
- 88
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2020726398
- Cited by
- 521
- References
- 29
- FWCI
- 16.93
- 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.