Generalized flow and determinism in measurement-based quantum computation
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We extend the notion of quantum information flow defined by Danos and Kashefi (2006 Phys. Rev. A 74 052310) for the one-way model (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 910) and present a necessary and sufficient condition for the stepwise uniformly deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the ( X , Y ), ( X , Z ) and ( Y , Z ) planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the stepwise uniformly deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly valuable for the study of the algorithms and complexity in the one-way model.
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 · cited 5×
“Measurement-based quantum computation, and, more specifically, the one-way quantum computation model [1] provides both a new theoretical description and a novel prescription for implementations of quantum computing.”
BackgroundMethodInfluentialGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
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 above theorem provides a sufficient condition for determinism for the one-way model considering only measurements in the (X, Y) plane, which encompasses, for example, the measurement patterns proposed [1, 3].”
BackgroundSelf-citation
Cited by
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
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
Unconditionally verifiable blind quantum computation
Fitzsimons, J. F., & Kashefi, E. (2017) · Physical Review A · doi:10.1103/physreva.96.012303 · Cited by 277
Self-citationExperimental demonstration of graph-state quantum secret sharing
Bell, B. A., Markham, D., Herrera-Martí, D. A., Marin, A., Wadsworth, W. J., Rarity, J. G., & Tame, M. S. (2014) · Nature Communications · doi:10.1038/ncomms6480 · Cited by 155
ZX-calculus for the working quantum computer scientist
van de Wetering, J. (2020) · arXiv · doi:10.48550/arxiv.2012.13966 · Cited by 68
Metadata
- Authors
- Browne, D. E., Kashefi, E., Mhalla, M., & Perdrix, S.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2007-08-02
- Volume
- 9
- Issue
- 8
- Pages
- 250-250
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W1968671063
- Cited by
- 125
- References
- 3
- FWCI
- 8.67
- 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: Generalized flow and determinism in measurement-based quantum computation. https://app.cochat.ai/papers/10.1088/1367-2630/9/8/250
- The paper
- Browne, D. E., Kashefi, E., Mhalla, M., & Perdrix, S. (2007). Generalized flow and determinism in measurement-based quantum computation. New Journal of Physics. https://doi.org/10.1088/1367-2630/9/8/250
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.