Realizable Hamiltonians for universal adiabatic quantum computers
From MaRDI portal
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.
Recommendations
- Realizations of standard quantum computational circuits by adiabatic evolution
- Entangling problem Hamiltonian for adiabatic quantum computation
- Universal qudit Hamiltonians
- On the gap of Hamiltonians for the adiabatic simulation of quantum circuits
- A universal adiabatic quantum query algorithm
- Hypercomputation with quantum adiabatic processes
- Adiabatic quantum oracles
- Bounds for the adiabatic approximation with applications to quantum computation
- On non-adiabatic holonomic quantum computer
Cites work
Cited in
(22)- Resonant transition-based quantum computation
- Constant-round blind classical verification of quantum sampling
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- Theory versus practice in annealing-based quantum computing
- Verification of quantum computation: an overview of existing approaches
- Realizations of standard quantum computational circuits by adiabatic evolution
- Quantum adiabatic machine learning
- Generalized quantum partial adiabatic evolution
- Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
- Universal qudit Hamiltonians
- Universal computation with quantum fields
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- Complexity classification of local Hamiltonian problems
- Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
- Universal quantum Hamiltonians
- Classical verification of quantum computations
- Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing
- Fast universal quantum computation with railroad-switch local Hamiltonians
- An adiabatic quantum algorithm and its application to DNA motif model discovery
- Realizing number recognition with simulated quantum semi-restricted Boltzmann machine
- Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation
- Quantum fibrations: quantum computation on an arbitrary topological space
This page was built for publication: Realizable Hamiltonians for universal adiabatic quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903123)
