Measurement-based quantum computation on cluster states

  title={Measurement-based quantum computation on cluster states},
  author={R. Raussendorf and D. Browne and H. Briegel},
  journal={Physical Review A},
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. We prove its universality, describe why its underlying computational model is different from the network model of quantum computation, and relate quantum algorithms to mathematical graphs. Further we investigate the scaling of required resources and give a number of examples for circuits of… Expand
Cluster-state quantum computation
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubitExpand
Quantum Computation by Local Measurement
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. Expand
One-way quantum computing in superconducting circuits
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which anExpand
Scheme for Implementing Quantum Search Algorithm in a Cluster State Quantum Computer
It is found that O(23n/2n2) number of single qubit measurements is required for the realization of the modified Grover search algorithm in a cluster-state quantum computer. Expand
Quantum Computing with Cluster States
In cluster state quantum computing, we start with a given fixed entangled state of many qubits called a cluster state and perform a quantum computation by applying a time-ordered sequence ofExpand
Using Graph States for Quantum Computation and Communication
In this work, we describe a method to achieve fault tolerant measurement based quantum computation in two and three dimensions. The proposed scheme has an threshold of 7.8*10^-3 and poly-logarithmicExpand
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. Expand
Experimental one-way quantum computing
The implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks. Expand
Quantum channels over graph states using generalized measurement-based quantum computation framework
This work gives a closed form expression for the unitary evolution that a state goes through in terms of the network parameters and measurement outcomes on various qubits of theNetwork to describe quantum channels. Expand
Cluster state computation with quantum-dot charge qubits.
Quantum computers are expected to far surpass the capabilities of today's most powerful supercomputers, particularly in areas such as the theoretical simulation of quantum systems, cryptography, andExpand


Computational Model for the One‐Way Quantum Computer: Concepts and Summary
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. TheExpand
Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. ThisExpand
A one-way quantum computer.
A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program. Expand
Two-qubit Projective Measurements are Universal for Quantum Computation
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improvedExpand
Computational model underlying the one-way quantum computer
This paper presents the computational model underlying the one-way quantum computer and shows that the logical depth is, for certain algorithms, lower than has so far been known for networks. Expand
Universal quantum computation with two- and three-qubit projective measurements
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of NielsenExpand
Entanglement purification for quantum computation.
It is shown that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with 8 or = d < or = 32, which are still tolerable to realize deterministic high-quality two-qubit gates on the logical qubits. Expand
Parallel Quantum Computation and Quantum Codes
While it is noted the exact quantum Fourier transform can be parallelized to linear depth, it is conjecture that neither it nor a simpler "staircase" circuit can be Parallelized to less than this. Expand
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. Expand
Quantum computational networks
  • D. Deutsch
  • Mathematics
  • Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
  • 1989
The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classicalExpand