Realizable Hamiltonians for Universal Adiabatic Quantum Computers

Abstract

It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working towards the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known QMA-complete 2-local Hamiltonians. The 2-local Ising model with 1-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable 2-local transverse XX coupling. We also show the universality and QMA-completeness of spin models with only 1-local Z and X fields and 2-local ZX interactions.

Paper revised and extended to improve clarity; to appear in Physical Review A

References in corpus (11)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A toolbox for lattice spin models with polar molecules
• Conditional Quantum Dynamics and Logic Gates
• A Superconducting Persistent Current Qubit
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Variable electrostatic transformer: controllable coupling of two charge qubits
• Sign- and magnitude-tunable coupler for superconducting flux qubits
• A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
• Quantum annealing of the random-field Ising model by transverse ferromagnetic interactions
• From quantum circuits to adiabatic algorithms
• Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer

Cited by in corpus (101)

• Quantum Machine Learning
• Ising formulations of many NP problems
• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Perspectives of quantum annealing: Methods and implementations
• Digitized adiabatic quantum computing with a superconducting circuit
• Quantum Annealing for Industry Applications: Introduction and Review
• Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
• Adiabatic Quantum Simulation of Quantum Chemistry
• Verification of quantum computation: An overview of existing approaches
• Quantum Hamiltonian Complexity
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Zeno effect for quantum computation and control
• Quantum adiabatic machine learning
• Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
• Universal Variational Quantum Computation
• Universal Quantum Hamiltonians
• Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
• Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
• Perturbative Gadgets at Arbitrary Orders
• Post hoc verification with a single prover
• Post hoc verification of quantum computation
• Theoretical and Experimental Perspectives of Quantum Verification
• SU(2) lattice gauge theory on a quantum annealer
• Adiabatic state preparation study of methylene
• Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
• Quantum gate learning in engineered qubit networks: Toffoli gate with always-on interactions
• Computational Complexity in Electronic Structure
• Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
• Adiabatic Quantum Simulators
• Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing
• Training and Classification using a Restricted Boltzmann Machine on the D-Wave 2000Q
• Introduction to Quantum Algorithms for Physics and Chemistry
• Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
• From Classical Nonlinear Integrable Systems to Quantum Shortcuts to Adiabaticity
• Non-interactive classical verification of quantum computation
• QMA-complete problems for stoquastic Hamiltonians and Markov matrices
• Tunable inductive coupling of superconducting qubits in the strongly nonlinear regime
• Hamiltonian gadgets with reduced resource requirements
• Quantum Computation Beyond the Circuit Model
• Quantum Computing: Lecture Notes
• Schedule path optimization for quantum annealing and adiabatic quantum computing
• An Application of Quantum Annealing Computing to Seismic Inversion
• Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians
• Local convertibility and the quantum simulation of edge states in many-body systems
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Universal 2-local Hamiltonian Quantum Computing
• Encoding Universal Computation in the Ground States of Ising Lattices
• De-Signing Hamiltonians for Quantum Adiabatic Optimization
• Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
• A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
• Classical Simulation of Noncontextual Pauli Hamiltonians
• Analysis and limitations of modified circuit-to-Hamiltonian constructions
• Using Quantum Annealers to Calculate Ground State Properties of Molecules
• Practical designs for permutation symmetric problem Hamiltonians on hypercubes
• Synchronization of Multiple Coupled rf-SQUID Flux Qubits
• Quadratization in discrete optimization and quantum mechanics
• Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
• Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines
• Classical zero-knowledge arguments for quantum computations
• Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
• Making Classical Ground State Spin Computing Fault-Tolerant
• Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
• Disorder-assisted graph coloring on quantum annealers
• Adiabatic quantum algorithm for artificial graphene
• Eigenstates Transition Without Undergoing an Adiabatic Process
• Complexity classification of local Hamiltonian problems
• Phase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts
• Oscillating potential well in complex plane and the adiabatic theorem
• Separability gap and large deviation entanglement criterion
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• The computational complexity of density functional theory
• The Local Consistency Problem for Stoquastic and 1-D Quantum Systems
• Lagrangian Duality in Quantum Optimization: Overcoming QUBO Limitations for Constrained Problems
• Simple Hamiltonian dynamics is a powerful quantum processing resource
• Improving nonstoquastic quantum annealing with spin-reversal transformations
• Perturbative gadgets without strong interactions
• Performance Models for Split-execution Computing Systems
• Towards quantum simulation of spin systems using continuous variable quantum devices
• The Role of Rotational Invariance in the Properties of Hamiltonians
• Experimental realization of universal quantum gates and six-qubit entangled state using photonic quantum walk
• Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators
• Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
• Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
• Quantum annealing in the NISQ era: railway conflict management
• Validating a Two Qubit Non-Stoquastic Hamiltonian in Quantum Annealing
• Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
• Universal Computation with Quantum Fields
• Simplifying quantum double Hamiltonians using perturbative gadgets
• Pinned QMA: The power of fixing a few qubits in proofs
• Blind quantum computing can always be made verifiable
• On physical problems that are slightly more difficult than QMA
• Waveguide QED toolboxes for universal quantum matter
• Quantum Fibrations: quantum computation on an arbitrary topological space
• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions
• Existence of a robust optimal control process for efficient measurements in a two-qubit system
• A penalty-free quantum algorithm to find energy eigenstates
• Explicitly Quantum-parallel Computation by Displacements
• Quantum Algorithms in Cybernetics