Measurement-based quantum computation

  title={Measurement-based quantum computation},
  author={Hans J. Briegel and Dan E. Browne and Wolfgang Dur and Robert Raussendorf and Maarten Van den Nest},
  journal={Nature Physics},
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation exist. These models have been shown to be formally equivalent, but their underlying elementary concepts and the requirements for their practical realization can differ significantly. A particularly exciting paradigm is that of measurement-based quantum computation, where the processing of quantum… 

Measurement-Based Quantum Computation

  • T. Wei
  • Physics, Computer Science
    Oxford Research Encyclopedia of Physics
  • 2021
The measurement-based approach offers a potential alternative to the standard circuit approach to realize a practical quantum computer and provides useful connections to the emergence of time ordering, computational complexity and classical spin models, blind quantum computation, etc.

One‐way Quantum Computation

This chapter provides an introduction to one-way quantum computation, and several of the techniques one can use to describe it, and introduces graph and cluster states and develop a notation for general single-qubit measurements.

The Role of Classical Computation in Measurement-Based Quantum Computation

The role played by the classical computer in this model of quantum computation is focused on and some of its properties are investigated.

Physical Realization of Measurement Based Quantum Computation

Harnessing quantum mechanics properties, quantum computers have the potential to out-perform classical computers in many applications and are envisioned to affect various aspects of our society.

Measuring coherence of quantum measurements

The superposition of quantum states lies at the heart of physics and has been recently found to serve as a versatile resource for quantum information protocols, defining the notion of quantum

Contextuality supplies the ‘magic’ for quantum computation

This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.

Universal fault-tolerant measurement-based quantum computation

A framework to map fault-tolerant procedures for quantum computation that have been natively designed for use with stabilizer codes onto a measurement-based protocol, allowing for a new model of universal quantum computation based on the braiding and fusion of foliated topological defects that are akin to Majorana modes.

Quantum advantage in temporally flat measurement-based quantum computation

Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of

Toolbox for Quantum Computing and Digital Quantum Simulation with Superconducting Qubits

Quantum computers make use of the coherent time evolution of a quantum system to map an input to an output. The coherent quantum dynamics allows the system to take on superpositions of states which

Fusion-based quantum computation

It is found that tailoring the fault-tolerance framework to the physical system allows the scheme to have a higher threshold than schemes reported in literature, and presents a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion.



An introduction to measurement based quantum computation

In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated

Measurement-based quantum computation beyond the one-way model

This work elaborates on the framework established in Gross and Eisert and discusses variants of Kitaev's toric code states as universal resources, and opens up a way of thinking of tailoring resource states to specific physical systems, such as cold atoms in optical lattices or linear optical systems.

Experimental one-way quantum computing

The implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

Fault-tolerant quantum computation with cluster states

Two threshold theorems are proved which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value.

Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations

It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.


The one-way quantum computer is described, a scheme of universal quantum computation that consists entirely of one-qubit measurements on a highly entangled multiparticle state, i.e. the cluster state, which proves the universality of the , and establishes the link to the network model — the common model of quantum computation.

The measurement calculus

A rigorous mathematical model underlying the one-way quantum computer is developed and a concrete syntax and operational semantics for programs, which are called patterns, are presented, and an algebra of these patterns derived from a denotational semantics are presented.

A scheme for efficient quantum computation with linear optics

It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.