No-go Theorem for One-way Quantum Computing on Naturally Occurring Two-level Systems
arXiv:1004.3787 · doi:10.1103/PhysRevA.83.050301
Abstract
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to implement, the preparation of the resource state becomes a crucial task. An appealing approach is simply to cool a strongly correlated quantum many-body system to its ground state. In addition to requiring the ground state of the system to be universal for one-way quantum computing, we also want the Hamiltonian to have non-degenerate ground state protected by a fixed energy gap, to involve only two-body interactions, and to be frustration-free so that measurements in the course of the computation leave the remaining particles in the ground space. Recently, significant efforts have been made to the search of resource states that appear naturally as ground states in spin lattice systems. The approach is proved to be successful in spin-5/2 and spin-3/2 systems. Yet, it remains an open question whether there could be such a natural resource state in a spin-1/2, i.e., qubit system. Here, we give a negative answer to this question by proving that it is impossible for a genuinely entangled qubit states to be a non-degenerate ground state of any two-body frustration-free Hamiltonian. What is more, we prove that every spin-1/2 frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states, a stronger result that is interesting independent of the context of one-way quantum computing.
5 pages, 1 figure
References in corpus (12)
- Measurement-based quantum computation
- Quantum magnetism and criticality
- Novel schemes for measurement-based quantum computation
- Universal resources for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
- Classical simulation versus universality in measurement based quantum computation
- Optical one-way quantum computing with a simulated valence-bond solid
- A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
- Universal quantum computer from a quantum magnet
- Graph states as ground states of many-body spin-1/2 Hamiltonians
- Quantum state reduction for universal measurement based computation
Cited by in corpus (21)
- Criticality without frustration for quantum spin-1 chains
- Universal measurement-based quantum computation with spin-2 Affleck-Kennedy-Lieb-Tasaki states
- From Ground States to Local Hamiltonians
- Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles
- Entanglement and correlation functions of the quantum Motzkin spin-chain
- The Complexity of Translationally-Invariant Spin Chains with Low Local Dimension
- Measurement-Based Quantum Computing with Valence-Bond-Solids
- Complete Characterization of the Ground Space Structure of Two-Body Frustration-Free Hamiltonians for Qubits
- Imaginary time evolution with quantum nondemolition measurements: multi-qubit interactions via measurement nonlinearities
- Ground-State Spaces of Frustration-Free Hamiltonians
- The Complexity of Translationally-Invariant Low-Dimensional Spin Lattices in 3D
- Linear-optical simulation of the cooling of a cluster-state Hamiltonian system
- Certificates of quantum many-body properties assisted by machine learning
- Sequential measurement-based quantum computing with memories
- The pair-flip model: a very entangled translationally invariant spin chain
- Computational Power and Correlation in Quantum Computational Tensor Network
- A linear time algorithm for quantum 2-SAT
- Dynamics and correlations in Motzkin and Fredkin spin chains
- Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
- On exact counting and quasi-quantum complexity
- Testing quantum satisfiability