Realizable Hamiltonians for universal adiabatic quantum computers

DOI10.1103/PHYSREVA.78.012352zbMath1255.81101arXiv0704.1287OpenAlexW1968390152WikidataQ21708890 ScholiaQ21708890MaRDI QIDQ4903123

Jacob D. Biamonte, Peter J. Love

Publication date: 19 January 2013

Published in: Physical Review A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.1287

zbMATH Keywords

local lattice spin Hamiltonians

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (18)

Quantum adiabatic machine learning ⋮ Constant-round blind classical verification of quantum sampling ⋮ Resonant transition-based quantum computation ⋮ Classical Verification of Quantum Computations ⋮ Realizing number recognition with simulated quantum semi-restricted Boltzmann machine ⋮ Universal computation with quantum fields ⋮ Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions ⋮ Generalized quantum partial adiabatic evolution ⋮ Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ An adiabatic quantum algorithm and its application to DNA motif model discovery ⋮ Complexity Classification of Local Hamiltonian Problems ⋮ Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation ⋮ Quantum fibrations: quantum computation on an arbitrary topological space ⋮ Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians ⋮ Theory versus practice in annealing-based quantum computing ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Fast universal quantum computation with railroad-switch local Hamiltonians

Cites Work

• Optimization by Simulated Annealing
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Quantum Complexity Theory
• The Complexity of the Local Hamiltonian Problem
• Unnamed Item

This page was built for publication: Realizable Hamiltonians for universal adiabatic quantum computers