LLMpediaThe first transparent, open encyclopedia generated by LLMs

measurement-based quantum computing

Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Quantum measurement Hop 3

No expansion data.

measurement-based quantum computing
NameMeasurement-based quantum computing
TypeModel of quantum computation
Invented2001
InventorsRobert Raussendorf and Hans J. Briegel
AssociatedOne-way quantum computer, Cluster state, Graph state

measurement-based quantum computing

Measurement-based quantum computing is a model of quantum computation in which computation proceeds by performing a sequence of adaptive quantum measurements on an entangled multi-qubit resource state rather than by applying unitary gates. It matters in Quantum Physics because it illuminates the role of entanglement, measurement, and resource states in enabling universal computation and informs experimental implementations across diverse platforms.

Overview and relation to Quantum Physics

Measurement-based approaches rest on foundational principles of Quantum mechanics such as superposition and entanglement, and highlight the operational significance of projective and generalized measurements in processing quantum information. The model contrasts with the circuit model popularized by Shor and others, offering alternative perspectives on quantum error correction and the distribution of quantum resources. It connects to theoretical work in quantum information theory by formalizing resource consumption and adaptive control, and it draws on concepts from many-body physics and condensed matter physics when considering large-scale entangled states.

Cluster states and resource theory

Central resources are cluster states and more generally graph states, highly entangled states first formalized by Hans J. Briegel and colleagues. The resource theory of measurement-based computing studies which entangled states enable universal computation and how states can be transformed via local operations and classical communication (LOCC). Relevant theoretical results include universality proofs for 2D cluster states and characterization theorems linking entanglement measures to computational power. Important contributors include Michael Nielsen and Daniel Gottesman for stabilizer formalism links, and literature such as the Raussendorf–Briegel papers and subsequent extensions by Nicolas Brunner and others. The approach interfaces with research on topological order and symmetry-protected topological order when cluster-like resources are realized in lattice systems.

Measurement protocols and models (one-way quantum computer)

The canonical protocol is the one-way quantum computer proposed by Robert Raussendorf and Hans J. Briegel, in which a prepared cluster state undergoes single-qubit measurements in adaptive bases; measurement outcomes determine feed-forward corrections implemented classically. The procedure employs Pauli measurements, Clifford group operations, and non-Clifford rotations achieved via specific measurement angles or ancilla injections. Variants include measurement-based schemes built on continuous-variable quantum information using squeezed states and homodyne detection, and hybrid architectures combining photonic and matter qubits. The model formalizes adaptive measurement sequences, classical control loops, and the role of byproduct operators described in stabilizer language by Gottesman–Knill theorem related works.

Universal quantum computation and gate implementation

Universality is achieved by appropriate measurement patterns on universal resources such as 2D cluster states; single-qubit rotations and entangling two-qubit gates (e.g., CNOT) are effected by local measurements and classical feed-forward. Ancilla-driven schemes and teleportation-based gate constructions relate to quantum teleportation protocols initiated by Charles H. Bennett and collaborators. Resource-efficient constructions use magic state distillation and injection to realize non-Clifford gates, connecting to work by Bravyi, Sergey and Kitaev, Alexei on fault-tolerant universality. Theoretical analysis often employs the stabilizer formalism and graph-theoretic descriptions linking measurement bases to logical gate sequences.

Error correction, fault tolerance, and decoherence

Error mitigation in measurement-based models leverages quantum error correction codes adapted to cluster geometries, including surface code embeddings and topological fault-tolerant constructions inspired by Kitaev. Fault tolerance analyses consider thresholds for local noise, measurement errors, and loss; schemes combine magic state distillation with encoded measurement patterns to achieve logical gate fidelity. Decoherence and photon loss present major experimental challenges; theoretical frameworks examine error propagation through adaptive measurements and design measurement schedules to minimize correlated faults. Key institutions and research programs in fault tolerance include groups at University of Oxford, University of Cambridge, MIT, and Institute for Quantum Computing.

Experimental realizations and platforms

Implementations span optical quantum computing with single photons and linear optics (notably work by Knill, Terry Rudolph), ion trap quantum computing groups (e.g., at NIST), superconducting qubits (e.g., Google Quantum AI, IBM Quantum), and neutral atoms or Rydberg atom arrays. Photonic cluster states have been generated via spontaneous parametric down-conversion and integrated photonic circuits by groups at University of Bristol and University of Vienna. Continuous-variable implementations use squeezed-light sources developed in laboratories such as Caltech and Max Planck Institute for the Science of Light. Experimental milestones include small-scale demonstrations of one-way computations, teleportation gates, and encoded error-corrected primitives.

Applications and theoretical implications for quantum information

Measurement-based computation informs architectures for scalable quantum computing that decouple entanglement generation from adaptive measurement control, offering modular approaches for distributed quantum networks and quantum communication protocols such as entanglement swapping. It yields insights into classical simulation complexity, links to measurement-based classical simulation hardness results, and shapes resource accounting in quantum algorithms. The paradigm also has implications for quantum foundations by foregrounding the role of measurement as a driving dynamical element and by connecting computation to phases of matter used as resources. Prominent venues for related results include the Physical Review Letters, Nature, and proceedings of the Quantum Information Processing conference series.

Category:Quantum computing Category:Quantum information theory Category:Quantum measurement