Quantum computing via measurements only

Abstract

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of these systems to a large number of qubits, essential for practical applications such as the Shor algorithm, represents a formidable challenge. Most of the current experiments are designed to implement sequences of highly controlled interactions between selected particles (qubits), thereby following models of a quantum computer as a (sequential) network of quantum logic gates. Here we propose a different model of a scalable quantum computer. In our model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits. Information is then written onto the cluster, processed, and read out form the cluster by one-particle measurements only. The entangled state of the cluster thus serves as a universal substrate for any quantum computation. Cluster states can be created efficiently in any system with a quantum Ising-type interaction (at very low temperatures) between two-state particles in a lattice configuration.

4 pages, 2 figures

References in corpus (6)

• Elementary gates for quantum computation
• Persistent entanglement in arrays of interacting particles
• Entanglement of atoms via cold controlled collisions
• Quantum Logic Gates in Optical Lattices
• Quantum gates with neutral atoms: Controlling collisional interactions in time dependent traps
• Quantum computing with neutral atoms

Cited by in corpus (31)

• Thermal concurrence mixing in a 1D Ising model
• Toward an architecture for quantum programming
• An introduction to measurement based quantum computation
• Quantum search by measurement
• Typical entanglement of stabilizer states
• Two-qubit Projective Measurements are Universal for Quantum Computation
• On Self-Dual Quantum Codes, Graphs, and Boolean Functions
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
• A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation
• On the Need for Large Quantum Depth
• On Local Equivalence, Surface Code States and Matroids
• Detecting Quantum Entanglement
• Quantum unital Otto heat engines: using Kirkwood-Dirac quasi-probability for the engine's coherence to stay alive
• Hybrid Exchange Measurement-Based Qubit Operations in Semiconductor Double Quantum Dot Qubits
• Permutational Quantum Computing
• Generalised Clifford groups and simulation of associated quantum circuits
• Fast algorithms for classical specifications of stabiliser states and Clifford gates
• Estimating diagonal entries of powers of sparse symmetric matrices is BQP-complete
• Performing joint measurements and transformations on several qubits by operating on a single control qubit
• Interactive proofs for BQP via self-tested graph states (extended abstract)
• Unified scheme for correlations using linear relative entropy
• Unitary-circuit semantics for measurement-based computations
• Quantum problem solving as simultaneous computation
• Quantum error correcting codes and one-way quantum computing: Towards a quantum memory
• From Graph States to Two-Graph States
• Ergodic quantum computing
• Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
• Quantum Oracles in Constant Depth with Measurement-Based Quantum Computation
• Bipartite and Tripartite Entanglement of Truncated Harmonic Oscillator Coherent States via Beam Splitters
• Bounds on the number of time steps for simulating arbitrary interaction graphs
• Quantum Factor Graphs