Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Institute of Physics eBooks

Measurement-based quantum computing

Steven Anatolievich Duplij, Raimund Vogl

Published Nov 1, 2023• 0 citations
Publisher

Abstract

In this chapter, the measurement-based quantum computation model is overviewed and comprehensive references are given. The computation process starts with several entangled qubits and measurements act on each qubit separately. The result is then exploited for next measurements. To avoid measurement indeterminacy, local unitary operations (named corrections) are implemented, which give the one-way computation.

DOI
10.1088/978-0-7503-5281-9ch5

Related papers

1-qubit versus 2-qubit measurement based quantum computing

Vincent Danos A, Elham Kashefi, Prakash Panangaden

We present a comprehensive and universal quantum computing model based on 2-qubit measurements (TQC), which embeds trivially in a model based on 1-qubit measurements known as the one-way model (1WQC). One inherits through this embedding a calculus whereby each TQC computing pattern can be put in a standard form where entanglement is done first, then measurement, then local corrections.

•Jan 1, 2005•3 citations

An introduction to measurement based quantum computation

Richard Jozsa

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 qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.

arXiv:quant-ph/0508124•Aug 17, 2005•124 citations

Extended Measurement Calculus

Vincent Danos A, Elham Kashefi, Prakash Panangaden +1 more

Measurement-based quantum computation (MBQC) has emerged as a new approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model that takes unitary operations as fundamental. Among measurement-based quantum computation methods the recently introduced one-way quantum computer stands out as basic and fundamental. The key idea is to start from an entangled state and then use measurements and one-qubit unitaries, which may be dependent on the outcomes of measurements, to guide the computation. The main point is that one never has to perform unitaries on more than one qubit at a time after the initial preparation of an entangled state. The “programs” that one writes in this model are traditionally called “patterns.” In this chapter, we develop a rigorous mathematical model underlying measurement-based quantum computation. We give syntax, operational semantics, denotational semantics, and an algebra of programs derived from the denotational semantics. We also present a rewrite theory and prove a general standardization theorem that allows all programs to be put in a semantically equivalent standard form. Standardization has far-reaching consequences: a new physical architecture based on performing all the entanglement in the beginning, parallelization by exposing the dependency structure of measurements, and expressiveness theorems. We use our general measurement calculus not just to formalize the one-way model but also several other measurement-based models, e.g., Teleportation, Phase, and Pauli models, and present compositional embeddings of them into and from the one-way model.

Cambridge University Press eBooks•Nov 30, 2009•38 citations

Quantum Computation Beyond the Unitary Circuit Model

Naïri Usher

This thesis considers various paradigms of quantum computation in an attempt to understand the nature of the underlying physics. A standard approach is to consider unitary computation on pure input states, such that the outcome of the computation is determined by single computational basis measurement on the output state. It has been shown that there exists equivalent models of computation, such as measurement based quantum computing (MBQC), which provide insight into the role of entanglement and measurement. Furthermore, constraining or relaxing available resources can directly impacts the power of the computation, allowing one to gauge their role in the process. Here, we first extend known constructions such as Matrix Product States, MBQC and the oneclean qubit model to a mixed state formalism, in an attempt to develop computational models where noise acting on the physical resources, as might be experienced in laboratory settings, may be mapped to logical noise on the computation. Next, we introduce Measurement-Based Classical Computing, an essentially classical model of computation, wherein the complexity hard wired into probability distributions generated via quantum means yields surprising non classical results. Finally, we consider postselection the ability to discard displeasing measurement outcomes and argue that it may be used in a tame way, which does not provide a dramatic increase in computational power. From here, we develop a new Hamiltonian, based on a circuit to Hamiltonian construction, presenting evidence of QMA-hardness.

•Jun 28, 2017•0 citations

Focus on Measurement-Based Quantum Information Processing

Terry Rudolph, Jian-Wei Pan

The last two decades have witnessed the rapid growth of quantum information processing as an active field of multidisciplinary science and technology. Tremendous theoretical and experimental progress has been made in quantum communication and quantum computation, and it seems clear that some of this progress will soon result in practical applications outside the laboratory. Quantum computation aims to build a quantum computer and to explore the origins and limits of quantum computing power. The original circuit model of a quantum computer, due to Deutsch, has a strong formal similarity with the circuit model of a classical computer. Both models depict a computation as processing via the wiring of a number of fiducial gates, each of which dynamically couples a small number of input (qu)bits in a controlled manner. In other words, unitary evolution is the basic mechanism of information processing in the circuit model of quantum computers. Starting with a given fixed state of many qubits, measurement based quantum computation (MBQC) processes information by applying a sequence of measurements to designated qubits in designated bases. This is remarkable, given the probabilistic nature of quantum measurement and the murky physical status of the dynamics of 'wavefunction collapse'. The final result of the computation is determined from the classical data of all the measurement outcomes. There exist two principle models: the teleportation based model and the 'one-way quantum computer' of 'cluster state computation'. The formalism of cluster states has proven to be a powerful way of describing the essential entanglement resources needed to perform quantum information processing. Unlike the circuit model, the MBQC models have no natural classical counterpart. There are a number of physical architectures for which measurements on the relevant systems are more easily performed than controlled unitary evolution. Moreover, it appears the MBQC models can offer novel computational benefits, especially regarding issues of fault-tolerance and parallelizability of algorithms. As a result, the theory of MBQC is now shaping the latest experimental proposals across the full spectrum of quantum information processing technologies. Naturally, understanding the scope of measurement based quantum computation is also yielding many insights into what is necessary (as opposed to merely sufficient) for us to harness the power of quantum computers. Quantum communication aims to offer efficient and secure ways of information exchange, directly based on quantum mechanics. Photons serve as natural information carriers, owing to their robustness against decoherence. A major problem for photonic communication systems is due to photon loss. It turns out that this difficulty can be overcome by the quantum repeater, a measurement-based technique. The basic idea is to divide the transmission channel into many segments and perform some quantum measurement on each segment. Additional measurement-based protocols and technologies have also been demonstrated to improve the quality of quantum communication, such as entanglement swapping and purification. The articles in this invited Focus Issue cover topics both in measurement-based quantum communication and computation, but the emphasis is given to quantum computation. A significant number of articles deal with the preparation of cluster states, the experimental realization of a one-way quantum computer, and the associated efficiency and benefits. We hope that you will find that some of these new results are of interest to you, and further hope that the issue will increase your interest in this interdisciplinary research field if you are a non-expert. Focus on Measurement-Based Quantum Information Processing Contents A proof-of-principle experiment of eliminating photon-loss errors in cluster states Wei-Bo Gao, Xiao-Qi Zhou, Jin Zhang, Tao Yang and Jian-Wei Pan Continuous variable multipartite entanglement and optical implementations of quantum communication networks Yimin Lian, Changde Xie and Kunchi Peng Generalized flow and determinism in measurement-based quantum computation Daniel E Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix The entanglement of the four-photon cluster state C Schmid, N Kiesel, W Wieczorek and H Weinfurter Optical zeno gate: bounds for fault tolerant operation Patrick M Leung and Timothy C Ralph Towards experimental entanglement connection with atomic ensembles in the single excitation regime Julien Laurat, Chin-wen Chou, Hui Deng, Kyung Soo Choi, Daniel Felinto, Hugues de Riedmatten and H J Kimble Towards minimal resources of measurement-based quantum computation Simon Perdrix Experimental realization of a quantum game on a one-way quantum computer Robert Prevedel, Andre Stefanov, Philip Walther and Anton Zeilinger Fundamentals of universality in one-way quantum computation M Van den Nest, W Dur, A Miyake and H J Briegel Loss tolerant linear optical quantum memory by measurement-based quantum computing Michael Varnava, Daniel E Browne and Terry Rudolph Graph state generation with noisy mirror-inverting spin chains Stephen R Clark, Alexander Klein, Martin Bruderer and Dieter Jaksch One-way quantum computing in adecoherence-free subspace M S Tame, M Paternostro and M S Kim Cluster state preparation using gates operating at arbitrary success probabilities K Kieling, D Gross and J Eisert Topological fault-tolerance in cluster state quantum computation R Raussendorf, J Harrington and K Goyal Strategies for the preparation of large cluster states using non-deterministic gates Peter P Rohde and Sean D Barrett A repeat-until-success quantum computing scheme A Beige, Y L Lim and L C Kwek Efficient growth of complex graph states via imperfect path erasure Earl T Campbell, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok Investigation of a single-photon source based on quantum interference T B Pittman, J D Franson and B C Jacobs Entanglement and local information access for graph states Damian Markham, Akimasa Miyake and Shashank Virmani The efficiencies of generating cluster states with weak nonlinearities Sebastien G R Louis, Kae Nemoto, W J Munro and T P Spiller A direct approach to fault-tolerance in measurement-based quantum computation via teleportation Marcus Silva, Vincent Danos, Elham Kashefi and Harold Ollivier Experimental ancilla-assisted qubit transmission against correlated noise T Yamamoto, R Nagase, J Shimamura, S K Ozdemir, M Koashi and N Imoto Terry Rudolph, Imperial College, London, UK Jian-Wei Pan, University of Science and Technology of China, Hefei, People's Republic of China and Universitat Heidelberg, Germany

New Journal of Physics•Jun 29, 2007•2 citations

Quantum Computation by Local Measurement

Robert Raussendorf, Tzu-Chieh Wei

Quantum computation is a novel way of information processing that allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit, and measurement-based models. They have been proven equivalent in their computational power, but operate very differently. As such, they may be suitable for realization in different physical systems, and also offer different perspectives on open questions such as the precise origin of the quantum speedup. Here, we give an introduction to the one-way quantum computer, a scheme of measurement-based quantum computation (MBQC). In this model, the computation is driven by local measurements on a carefully chosen, highly entangled state. We discuss various aspects of this computational scheme, such as the role of entanglement and quantum correlations. We also give examples for ground states of simple Hamiltonians that enable universal quantum computation by local measurements.

arXiv:1208.0041•Annual Review of Condensed Matter Physics•Mar 2, 2011•54 citations
In this chapter, the measurement-based quantum computation model is overviewed and comprehensive references are given. The computation process starts with several entangled qubits and measurements act on each qubit separately. The result is then exploited for next measurements. To avoid measurement indeterminacy, local unitary operations (named corrections) are implemented, which give the one-way 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 qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.
Measurement-based quantum computation (MBQC) has emerged as a new approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model that takes unitary operations as fundamental. Among measurement-based quantum computation methods the recently introduced one-way quantum computer stands out as basic and fundamental. The key idea is to start from an entangled state and then use measurements and one-qubit unitaries, which may be dependent on the outcomes of measurements, to guide the computation. The main point is that one never has to perform unitaries on more than one qubit at a time after the initial preparation of an entangled state. The “programs” that one writes in this model are traditionally called “patterns.” In this chapter, we develop a rigorous mathematical model underlying measurement-based quantum computation. We give syntax, operational semantics, denotational semantics, and an algebra of programs derived from the denotational semantics. We also present a rewrite theory and prove a general standardization theorem that allows all programs to be put in a semantically equivalent standard form. Standardization has far-reaching consequences: a new physical architecture based on performing all the entanglement in the beginning, parallelization by exposing the dependency structure of measurements, and expressiveness theorems. We use our general measurement calculus not just to formalize the one-way model but also several other measurement-based models, e.g., Teleportation, Phase, and Pauli models, and present compositional embeddings of them into and from the one-way model.
This thesis considers various paradigms of quantum computation in an attempt to understand the nature of the underlying physics. A standard approach is to consider unitary computation on pure input states, such that the outcome of the computation is determined by single computational basis measurement on the output state. It has been shown that there exists equivalent models of computation, such as measurement based quantum computing (MBQC), which provide insight into the role of entanglement and measurement. Furthermore, constraining or relaxing available resources can directly impacts the power of the computation, allowing one to gauge their role in the process. Here, we first extend known constructions such as Matrix Product States, MBQC and the oneclean qubit model to a mixed state formalism, in an attempt to develop computational models where noise acting on the physical resources, as might be experienced in laboratory settings, may be mapped to logical noise on the computation. Next, we introduce Measurement-Based Classical Computing, an essentially classical model of computation, wherein the complexity hard wired into probability distributions generated via quantum means yields surprising non classical results. Finally, we consider postselection the ability to discard displeasing measurement outcomes and argue that it may be used in a tame way, which does not provide a dramatic increase in computational power. From here, we develop a new Hamiltonian, based on a circuit to Hamiltonian construction, presenting evidence of QMA-hardness.
The last two decades have witnessed the rapid growth of quantum information processing as an active field of multidisciplinary science and technology. Tremendous theoretical and experimental progress has been made in quantum communication and quantum computation, and it seems clear that some of this progress will soon result in practical applications outside the laboratory. Quantum computation aims to build a quantum computer and to explore the origins and limits of quantum computing power. The original circuit model of a quantum computer, due to Deutsch, has a strong formal similarity with the circuit model of a classical computer. Both models depict a computation as processing via the wiring of a number of fiducial gates, each of which dynamically couples a small number of input (qu)bits in a controlled manner. In other words, unitary evolution is the basic mechanism of information processing in the circuit model of quantum computers. Starting with a given fixed state of many qubits, measurement based quantum computation (MBQC) processes information by applying a sequence of measurements to designated qubits in designated bases. This is remarkable, given the probabilistic nature of quantum measurement and the murky physical status of the dynamics of 'wavefunction collapse'. The final result of the computation is determined from the classical data of all the measurement outcomes. There exist two principle models: the teleportation based model and the 'one-way quantum computer' of 'cluster state computation'. The formalism of cluster states has proven to be a powerful way of describing the essential entanglement resources needed to perform quantum information processing. Unlike the circuit model, the MBQC models have no natural classical counterpart. There are a number of physical architectures for which measurements on the relevant systems are more easily performed than controlled unitary evolution. Moreover, it appears the MBQC models can offer novel computational benefits, especially regarding issues of fault-tolerance and parallelizability of algorithms. As a result, the theory of MBQC is now shaping the latest experimental proposals across the full spectrum of quantum information processing technologies. Naturally, understanding the scope of measurement based quantum computation is also yielding many insights into what is necessary (as opposed to merely sufficient) for us to harness the power of quantum computers. Quantum communication aims to offer efficient and secure ways of information exchange, directly based on quantum mechanics. Photons serve as natural information carriers, owing to their robustness against decoherence. A major problem for photonic communication systems is due to photon loss. It turns out that this difficulty can be overcome by the quantum repeater, a measurement-based technique. The basic idea is to divide the transmission channel into many segments and perform some quantum measurement on each segment. Additional measurement-based protocols and technologies have also been demonstrated to improve the quality of quantum communication, such as entanglement swapping and purification. The articles in this invited Focus Issue cover topics both in measurement-based quantum communication and computation, but the emphasis is given to quantum computation. A significant number of articles deal with the preparation of cluster states, the experimental realization of a one-way quantum computer, and the associated efficiency and benefits. We hope that you will find that some of these new results are of interest to you, and further hope that the issue will increase your interest in this interdisciplinary research field if you are a non-expert. Focus on Measurement-Based Quantum Information Processing Contents A proof-of-principle experiment of eliminating photon-loss errors in cluster states Wei-Bo Gao, Xiao-Qi Zhou, Jin Zhang, Tao Yang and Jian-Wei Pan Continuous variable multipartite entanglement and optical implementations of quantum communication networks Yimin Lian, Changde Xie and Kunchi Peng Generalized flow and determinism in measurement-based quantum computation Daniel E Browne, Elham Kashefi, Mehdi Mhalla and Simon Perdrix The entanglement of the four-photon cluster state C Schmid, N Kiesel, W Wieczorek and H Weinfurter Optical zeno gate: bounds for fault tolerant operation Patrick M Leung and Timothy C Ralph Towards experimental entanglement connection with atomic ensembles in the single excitation regime Julien Laurat, Chin-wen Chou, Hui Deng, Kyung Soo Choi, Daniel Felinto, Hugues de Riedmatten and H J Kimble Towards minimal resources of measurement-based quantum computation Simon Perdrix Experimental realization of a quantum game on a one-way quantum computer Robert Prevedel, Andre Stefanov, Philip Walther and Anton Zeilinger Fundamentals of universality in one-way quantum computation M Van den Nest, W Dur, A Miyake and H J Briegel Loss tolerant linear optical quantum memory by measurement-based quantum computing Michael Varnava, Daniel E Browne and Terry Rudolph Graph state generation with noisy mirror-inverting spin chains Stephen R Clark, Alexander Klein, Martin Bruderer and Dieter Jaksch One-way quantum computing in adecoherence-free subspace M S Tame, M Paternostro and M S Kim Cluster state preparation using gates operating at arbitrary success probabilities K Kieling, D Gross and J Eisert Topological fault-tolerance in cluster state quantum computation R Raussendorf, J Harrington and K Goyal Strategies for the preparation of large cluster states using non-deterministic gates Peter P Rohde and Sean D Barrett A repeat-until-success quantum computing scheme A Beige, Y L Lim and L C Kwek Efficient growth of complex graph states via imperfect path erasure Earl T Campbell, Joseph Fitzsimons, Simon C Benjamin and Pieter Kok Investigation of a single-photon source based on quantum interference T B Pittman, J D Franson and B C Jacobs Entanglement and local information access for graph states Damian Markham, Akimasa Miyake and Shashank Virmani The efficiencies of generating cluster states with weak nonlinearities Sebastien G R Louis, Kae Nemoto, W J Munro and T P Spiller A direct approach to fault-tolerance in measurement-based quantum computation via teleportation Marcus Silva, Vincent Danos, Elham Kashefi and Harold Ollivier Experimental ancilla-assisted qubit transmission against correlated noise T Yamamoto, R Nagase, J Shimamura, S K Ozdemir, M Koashi and N Imoto Terry Rudolph, Imperial College, London, UK Jian-Wei Pan, University of Science and Technology of China, Hefei, People's Republic of China and Universitat Heidelberg, Germany
Quantum computation is a novel way of information processing that allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit, and measurement-based models. They have been proven equivalent in their computational power, but operate very differently. As such, they may be suitable for realization in different physical systems, and also offer different perspectives on open questions such as the precise origin of the quantum speedup. Here, we give an introduction to the one-way quantum computer, a scheme of measurement-based quantum computation (MBQC). In this model, the computation is driven by local measurements on a carefully chosen, highly entangled state. We discuss various aspects of this computational scheme, such as the role of entanglement and quantum correlations. We also give examples for ground states of simple Hamiltonians that enable universal quantum computation by local measurements.