Unified derivations of measurement-based schemes for quantum computation
arXiv:quant-ph/0404132 · doi:10.1103/PhysRevA.71.032318
Abstract
We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel [Phys. Rev. Lett., 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen [Phys. Lett. A, 308, 96 (2003)] and further simplified by Leung [Int. J. Quant. Inf., 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang [Phys. Rev. A, 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes.
14 pages
References in corpus (23)
- Persistent entanglement in arrays of interacting particles
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Multi-party entanglement in graph states
- Optical quantum computation using cluster states
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Quantum error-correcting codes associated with graphs
- Programmable quantum gate arrays
- Methodology for quantum logic gate constructions
- Valence Bond Solids for Quantum Computation
- Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
- Fault-tolerant quantum computation with cluster states
- The one-way quantum computer -- a non-network model of quantum computation
- On Universal and Fault-Tolerant Quantum Computing
- Computation by measurements: a unifying picture
- State Transfer instead of Teleportation in Measurement-based Quantum Computation
- Two-qubit Projective Measurements are Universal for Quantum Computation
- Efficient Linear Optics Quantum Computation
- Measurement-Based Quantum Turing Machines and their Universality
- Universal Quantum Computation using Exchange Interactions and Teleportation of Single-Qubit Operations
- Universal quantum computation with two- and three-qubit projective measurements
Cited by in corpus (83)
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- Measurement-based quantum computation
- Universal blind quantum computation
- Cluster-state quantum computation
- Unconditionally verifiable blind computation
- Universal resources for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Quantum teleportation on a photonic chip
- Quantum computing on encrypted data
- Determinism in the one-way model
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Identifying phases of quantum many-body systems that are universal for quantum computation
- An introduction to measurement based quantum computation
- Architectures for quantum simulation showing a quantum speedup
- Benchmarking a Teleportation Protocol realized in Superconducting Circuits
- Fundamentals of universality in one-way quantum computation
- A passive CPHASE gate via cross-Kerr nonlinearities
- Computation by measurements: a unifying picture
- On measurement-based quantum computation with the toric code states
- Teleportation-based realization of an optical quantum two-qubit entangling gate
- State Transfer instead of Teleportation in Measurement-based Quantum Computation
- How to Verify a Quantum Computation
- Hamiltonian Quantum Cellular Automata in 1D
- Quantum Computing in Plato's Cave
- Simple proof of fault tolerance in the graph-state model
- Quantum computation by local measurement
- Delegating Private Quantum Computations
- Symmetry-protected topological phases with uniform computational power in one dimension
- The 2D AKLT state on the honeycomb lattice is a universal resource for quantum computation
- Verifiable blind quantum computing with trapped ions and single photons
- Robust and parsimonious realisations of unitaries in the one-way model
- Level Reduction and the Quantum Threshold Theorem
- Optimised resource construction for verifiable quantum computation
- Synthesis of Arbitrary Quantum Circuits to Topological Assembly
- Valence bond solid formalism for d-level one-way quantum computation
- Measurement-Based Quantum Computation
- A linearized stabilizer formalism for systems of finite dimension
- Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
- Measurement-Based Teleportation Along Quantum Spin Chains
- Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians
- Quantum spin systems for measurement-based quantum computation
- Adiabatic Cluster State Quantum Computing
- Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits
- Universal 2-local Hamiltonian Quantum Computing
- Noiseless conditional teleportation of a single photon
- Two-photon self-Kerr nonlinearities for quantum computing and quantum optics
- The complexity of simulating constant-depth BosonSampling
- Measurement-Based Quantum Computing with Valence-Bond-Solids
- Garbled Quantum Computation
- Local Hamiltonians in Quantum Computation
- Towards Minimal Resources of Measurement-based Quantum Computation
- A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation
- A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- Computational complexity of non-equilibrium steady states of quantum spin chains
- Characterizing measurement-based quantum gates in quantum many-body systems using correlation functions
- Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
- Many Worlds, the Cluster-state Quantum Computer, and the Problem of the Preferred Basis
- Minimal physical resources for the realisation of measurement-based quantum computation
- Universal resources for quantum computing
- Robustness of controlled Hamiltonian approaches to unitary quantum gates
- A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits
- Transitions in the quantum computational power
- Entanglement and non-locality in quantum protocols with identical particles
- The Gauge Theory of Measurement-Based Quantum Computation
- Symmetry constraints on temporal order in measurement-based quantum computation
- Quantum computation by teleportation and symmetry
- Construction of optimal resources for concatenated quantum protocols
- A survey of universal quantum von Neumann architecture
- Quantum algorithm for Bose-Einstein condensate quantum fluid dynamics
- Device-independent quantum key distribution from computational assumptions
- Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
- Unitary-circuit semantics for measurement-based computations
- On the Physical Explanation for Quantum Computational Speedup
- Parallel remote state preparation for fully device-independent verifiable blind quantum computation
- On computational complexity and average-case hardness of shallow-depth boson sampling
- Sampling and the complexity of nature
- Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation
- Covert Quantum Internet
- Building a fusion-based quantum computer using teleported gates
- Reducing depth and measurement weights in Pauli-based computation
- Generation and Manipulation of Entanglement in Quantum Optical Systems
- The Computational Power of Non-interacting Particles