Hamiltonian gadgets with reduced resource requirements
arXiv:1311.2555 · doi:10.1103/PhysRevA.91.012315
Abstract
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental systems are typically limited to restricted forms of 2-body interactions. Therefore, universal adiabatic quantum computation requires a method for approximating quantum many-body Hamiltonians up to arbitrary spectral error using at most 2-body interactions. Hamiltonian gadgets, introduced around a decade ago, offer the only current means to address this requirement. Although the applications of Hamiltonian gadgets have steadily grown since their introduction, little progress has been made in overcoming the limitations of the gadgets themselves. In this experimentally motivated theoretical study, we introduce several gadgets which require significantly more realistic control parameters than similar gadgets in the literature. We employ analytical techniques which result in a reduction of the resource scaling as a function of spectral error for the commonly used subdivision, 3- to 2-body and -body gadgets. Accordingly, our improvements reduce the resource requirements of all proofs and experimental proposals making use of these common gadgets. Next, we numerically optimize these new gadgets to illustrate the tightness of our analytical bounds. Finally, we introduce a new gadget that simulates a interaction term using Hamiltonians containing only terms. Apart from possible implications in a theoretical context, this work could also be useful for a first experimental implementation of these key building blocks by requiring less control precision without introducing extra ancillary qubits.
33 pages, 9 figures
References in corpus (10)
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Error corrected quantum annealing with hundreds of qubits
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins
- Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
- Adiabatic state preparation study of methylene
- Ground State Spin Logic
- Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
- Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
- The Complexity of Stoquastic Local Hamiltonian Problems
Cited by in corpus (22)
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Quantum information processing with superconducting circuits: a review
- Digitized adiabatic quantum computing with a superconducting circuit
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions
- Native three-body interaction in superconducting circuits
- Continuous quantum error correction for evolution under time-dependent Hamiltonians
- Using Quantum Annealers to Calculate Ground State Properties of Molecules
- Simulation of adiabatic quantum computing for molecular ground states
- Quadratization in discrete optimization and quantum mechanics
- Adiabatic quantum simulations with driven superconducting qubits
- Hamiltonian sparsification and gap-simulations
- Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
- Solving systems of Boolean multivariate equations with quantum annealing
- A Quantum Annealing Protocol to Solve the Nuclear Shell Model
- Perturbative gadgets without strong interactions
- Efficient optimization of perturbative gadgets
- Going Beyond Gadgets: The Importance of Scalability for Analogue Quantum Simulators
- Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
- Efficient estimation of perturbative error with cellular automata
- Electronic Structure Calculatins and the Ising Machine