Cited by 29Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

One-way quantum computation

Browne, Dan, Briegel, Hans·2016·Quantum Information

Abstract

In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described include the stabilizer formalism and the logical Heisenberg picture. We highlight ways in which it is useful to understand one-way computation beyond simple equivalence with the quantum circuit model. We briefly review current proposals of implementations and experimental progress and summarize some recent related theoretical developments. Although the chapter is primarily didactic in focus, we include a number of new methods and observations. These include: a simpler and more compact formulation of one-way quantum computation in the stabilizer formalism; A new way of implementing unitaries diagonal in the computational basis; New results on the family of operations which may be implemented in a single round of measurements; A method for constructing compact one-way patterns by decomposing unitaries in terms of diagonal unitaries and Clifford group transformations. The chapter was revised in 2018 with a survey of recent developments in measurement-based quantum computation.

Integrity signals

Registry

Crossref · 10.1002/9783527805785.ch21

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Current quantum devices are able to deal with relatively sparsely connected qubits, making it difficult to map deep quantum circuits with multiple two-qubit gates that necessitate strong couplings between qubits.

    “At the moment of writing current quantum devices are able to deal with relatively sparsely connected qubits, making it difficult to map deep quantum circuits with multiple two-qubit gates that necessitate strong couplings between qubits [14].”

    From Quantum Computing: Vision and Challenges (2025) · cites this paper as [14]

The citation lists haven’t been fetched yet

References 105 · Cited by 29

Authors
Browne, D., & Briegel, H.
Affiliations
  • University College London (GB)
  • Universität Innsbruck (AT)
Venue
Quantum Information
Publisher
Wiley
Published
2016-04-18
Pages
449-473
OpenAlex
W1522848667
Cited by
29
References
105
Citations by year
2025: 3 · 2024: 2 · 2023: 1 · 2022: 6 · 2021: 2 · 2016: 5 · 2015: 1 · 2014: 2 · 2013: 1 · 2012: 2
Type
other
Language
en
Open access
closed
Locations
UCL Discovery (University College London) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
one-way quantum computation, measurement-based quantum computation, stabilizer formalism, unitary decomposition

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