Non-perturbative k-body to two-body commuting conversion Hamiltonians and embedding problem instances into Ising spins

Abstract

An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k-body interactions to be captured exactly using 2-body Hamiltonians. Our method works when all terms in the Hamiltonian share the same basis and has no dependence on perturbation theory or the associated large spectral gap. Our methods allow problem instance solutions to be embedded into the ground energy state of Ising spin systems. Adiabatic evolution might then be used to place a computational system into it's ground state.

Published version

References in corpus (10)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Coherent Quantum Dynamics of a Superconducting Flux Qubit
• Demonstration of conditional gate operation using superconducting charge qubits
• Quantum Computation by Adiabatic Evolution
• The power of quantum systems on a line
• N-representability is QMA-complete
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Sign- and magnitude-tunable coupler for superconducting flux qubits
• Quantum Adiabatic Evolution Algorithms with Different Paths
• A new construction for a QMA complete 3-local Hamiltonian

Cited by in corpus (53)

• Ising formulations of many NP problems
• Quantum optimization using variational algorithms on near-term quantum devices
• Stochastic p-bits for Invertible Logic
• Intrinsic optimization using stochastic nanomagnets
• Massively Parallel Probabilistic Computing with Sparse Ising Machines
• Adiabatic Quantum Simulation of Quantum Chemistry
• Challenges and Opportunities in Quantum Optimization
• Reachability Deficits in Quantum Approximate Optimization
• A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms
• On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
• Hardware emulation of stochastic p-bits for invertible logic
• Perturbative Gadgets at Arbitrary Orders
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Low Barrier Nanomagnets as p-bits for Spin Logic
• Circuit design for multi-body interactions in superconducting quantum annealing system with applications to a scalable architecture
• Weighted p-bits for FPGA implementation of probabilistic circuits
• Efficient CMOS Invertible Logic Using Stochastic Computing
• A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
• Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
• Ground State Spin Logic
• Adiabatic Quantum Simulators
• Large-scale Ising Emulation with Four-Body Interaction and All-to-All Connection
• Scalable Emulation of Sign-Problem$-$Free Hamiltonians with Room Temperature p-bits
• Tensor Network Contractions for #SAT
• Towards large-scale quantum optimization solvers with few qubits
• Hamiltonian gadgets with reduced resource requirements
• Categorical Tensor Network States
• Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
• Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
• Quantum annealing for systems of polynomial equations
• Lectures on Quantum Tensor Networks
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Encoding Universal Computation in the Ground States of Ising Lattices
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Native three-body interaction in superconducting circuits
• Transforming Generalized Ising Model into Boltzmann Machine
• Energy landscapes of combinatorial optimization in Ising machines
• Experimental and Theoretical Study of Thermodynamic Effects in a Quantum Annealer
• Quadratization in discrete optimization and quantum mechanics
• Simulating highly nonlocal Hamiltonians with less nonlocal Hamiltonians
• Emulating Quantum Interference with Generalized Ising Machines
• Quantum Vertex Model for Reversible Classical Computing
• Complexity classification of local Hamiltonian problems
• Solving systems of Boolean multivariate equations with quantum annealing
• High Convergence Rates of CMOS Invertible Logic Circuits Based on Many-Body Hamiltonians
• The superconducting circuit companion -- an introduction with worked examples
• Perturbative gadgets without strong interactions
• Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
• Design of General Purpose Minimal-Auxiliary Ising Machines
• Simplifying quantum double Hamiltonians using perturbative gadgets
• Surrogate Modeling via Factorization Machine and Ising Model with Enhanced Higher-Order Interaction Learning
• Finding Hadamard matrices by a quantum annealing machine
• Solving Helmholtz problems with finite elements on a quantum annealer