Determinism in the one-way model
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all such patterns, which equalize all computation branches, and only depend on the underlying entanglement graph and its choice of inputs and outputs. The class of patterns having flow is stable under composition and tensorization, and has unitary embeddings as realizations. The restricted class of patterns having both flow and reverse flow supports an operation of adjunction, and has all and only unitaries as realizations.
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
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
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 · cited 2×
“The recent one-way quantum computing model [1, 2, 3] has already drawn considerable attention, because it sugge ts different physical realizations of quantum computing [4, 5 , 6, 7, 8, 9, 10, 11, 12].”
BackgroundExperimental 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×
“computing. 1 Introduction The recent one-way quantum computing model [1, 2, 3] has already drawn considerable attention, mainly because it suggests different physical realisations of quantum computing [4, 5, 6, 7, 8, 9]. Computation consists of a first phase of preparation and entanglement, followed by 1-qubit measureme…”
BackgroundResource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · cited 1×
“The recent one-way quantum computing model [1, 2, 3] has already drawn considerable attention, because it sugge ts different physical realizations of quantum computing [4, 5 , 6, 7, 8, 9, 10, 11, 12].”
BackgroundOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Danos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
Self-citationFault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161 · cited 1×
“computing. 1 Introduction The recent one-way quantum computing model [1, 2, 3] has already drawn considerable attention, mainly because it suggests different physical realisations of quantum computing [4, 5, 6, 7, 8, 9]. Computation consists of a first phase of preparation and entanglement, followed by 1-qubit measureme…”
BackgroundComputational model underlying the one-way quantum computer
Raussendorf, R., & Briegel, H. (2002) · Quantum Information and Computation · doi:10.26421/qic2.6-3 · Cited by 56
Optical generation of matter qubit graph states
Benjamin, S. C., Eisert, J., & Stace, T. M. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/194 · Cited by 50
Cited by
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
Self-citationDemonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Self-citationGraph states for quantum secret sharing
Markham, D., & Sanders, B. C. (2008) · Physical Review A · doi:10.1103/physreva.78.042309 · Cited by 451
Private quantum computation: an introduction to blind quantum computing and related protocols
Fitzsimons, J. F. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0025-3 · Cited by 295
Unconditionally verifiable blind quantum computation
Fitzsimons, J. F., & Kashefi, E. (2017) · Physical Review A · doi:10.1103/physreva.96.012303 · Cited by 277
Self-citation
Metadata
- Authors
- Danos, V., & Kashefi, E.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2006-11-08
- Volume
- 74
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2145304048
- Cited by
- 139
- References
- 9
- FWCI
- 9.57
- 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.