Graph states as ground states of many-body spin-1/2 Hamiltonians
arXiv:quant-ph/0612186 · doi:10.1103/PhysRevA.77.012301
Abstract
We consider the problem whether graph states can be ground states of local interaction Hamiltonians. For Hamiltonians acting on n qubits that involve at most two-body interactions, we show that no n-qubit graph state can be the exact, non-degenerate ground state. We determine for any graph state the minimal d such that it is the non-degenerate ground state of a d-body interaction Hamiltonian, while we show for d'-body Hamiltonians H with d'<d that the resulting ground state can only be close to the graph state at the cost of H having a small energy gap relative to the total energy. When allowing for ancilla particles, we show how to utilize a gadget construction introduced in the context of the k-local Hamiltonian problem, to obtain n-qubit graph states as non-degenerate (quasi-)ground states of a two-body Hamiltonian acting on n'>n spins.
arXiv comment10 pages, 1 figure
References in corpus (11)
- Quantum secret sharing
- Good Quantum Error-Correcting Codes Exist
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Graphical description of the action of local Clifford transformations on graph states
- Novel schemes for measurement-based quantum computation
- Universal resources for measurement-based quantum computation
- Fundamentals of universality in one-way quantum computation
- A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
- Multipartite secure state distribution
- Entanglement, correlations, and the energy gap in many-body quantum systems
Cited by in corpus (36)
- Macroscopic quantum states: measures, fragility and implementations
- Multipartite entanglement detection from correlation tensors
- Quantum computational capability of a 2D valence bond solid phase
- Gapped Two-body Hamiltonian whose Unique Ground State is Universal for One-way Quantum Computation
- Universal quantum computer from a quantum magnet
- Single-copy entanglement detection
- Measurement-based quantum computation in a 2D phase of matter
- Quantum computation in correlation space and extremal entanglement
- Gapped Two-Body Hamiltonian for continuous-variable quantum computation
- No-go Theorem for One-way Quantum Computing on Naturally Occurring Two-level Systems
- Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body Hamiltonian with spin-3/2 particles
- Quantum spin systems for measurement-based quantum computation
- Topological Color Codes and Two-Body Quantum Lattice Hamiltonians
- A monomial matrix formalism to describe quantum many-body states
- Greenberger-Horne-Zeilinger states and few-body Hamiltonians
- Spin lattices with two-body Hamiltonians for which the ground state encodes a cluster state
- Measurement-Based Quantum Computing with Valence-Bond-Solids
- Imaginary time evolution with quantum nondemolition measurements: multi-qubit interactions via measurement nonlinearities
- Characterizing ground and thermal states of few-body Hamiltonians
- Graph states as ground states of two-body frustration-free Hamiltonians
- The Stability of Quantum Concatenated Code Hamiltonians
- Certificates of quantum many-body properties assisted by machine learning
- Computational Power and Correlation in Quantum Computational Tensor Network
- Quantum LOSR networks cannot generate graph states with high fidelity
- Preserving universal resources for one-way quantum computing
- Stabilizing Quantum States and Automatic Error Correction by Dissipation Control
- Parallelizable adiabatic gate teleportation
- Maximally entangled gapped ground state of lattice fermions
- Perturbative 2-body Parent Hamiltonians for Projected Entangled Pair States
- Strategies for measurement-based quantum computation with cluster states transformed by stochastic local operations and classical communication
- Quadratic fermionic interactions yield effective Hamiltonians for adiabatic quantum computing
- Bounds on Effective Hamiltonians for Stabilizer Codes
- Analysing multiparticle quantum states
- Testing equivalence of pure quantum states and graph states under SLOCC
- Reply to "Comment on "Quantum Time Crystals from Hamiltonians with Long-Range Interactions""
- Multipartite entanglement and few-body Hamiltonians