Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
From MaRDI portal
Publication:3548553
DOI10.1137/080734479zbMath1152.81008arXivquant-ph/0405098OpenAlexW2041432245WikidataQ59541270 ScholiaQ59541270MaRDI QIDQ3548553
Zeph A. Landau, Wim van Dam, Dorit Aharonov, Seth Lloyd, Oded Regev, Julia Kempe
Publication date: 16 December 2008
Published in: SIAM Journal on Computing, SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0405098
Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Adiabatic invariants for problems in Hamiltonian and Lagrangian mechanics (70H11) Theory of computing (68Q99)
Related Items (87)
Challenges of adiabatic quantum evaluation of NAND trees ⋮ The improved evolution paths to speedup quantum evolution ⋮ On the role of prior probability in adiabatic quantum algorithms ⋮ Realizations of standard quantum computational circuits by adiabatic evolution ⋮ The power of quantum systems on a line ⋮ FEqa: Finite element computations on quantum annealers ⋮ On the General Class of Models of Adiabatic Evolution ⋮ Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing ⋮ A Modified Adiabatic Quantum Algorithm for Evaluation of Boolean Functions ⋮ Progress in quantum algorithms ⋮ Quantum machine learning: a classical perspective ⋮ Quantum adiabatic machine learning ⋮ D-Wave and predecessors: From simulated to quantum annealing ⋮ Adiabatic quantum optimization with qudits ⋮ Constant-round blind classical verification of quantum sampling ⋮ Computational complexity of the landscape. I. ⋮ Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution? ⋮ Quantum Computing Meets the Real World ⋮ Least-squares solutions to polynomial systems of equations with quantum annealing ⋮ A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Symmetry‐Protected Quantum Adiabatic Evolution in Spontaneous Symmetry‐Breaking Transitions ⋮ Statistical Analysis of Quantum Annealing ⋮ Application of quantum approximate optimization algorithm to job shop scheduling problem ⋮ Evaluating the convergence of tabu enhanced hybrid quantum optimization ⋮ Unnamed Item ⋮ Quantum speed-up for unsupervised learning ⋮ \texttt{tqix.pis}: a toolbox for quantum dynamics simulation of spin ensembles in Dicke basis ⋮ Adiabatic times for Markov chains and applications ⋮ On quantum lambda calculi: a foundational perspective ⋮ A QUBO formulation for the tree containment problem ⋮ Efficient diabatic quantum algorithm in number factorization ⋮ Unnamed Item ⋮ QUBO formulation for the contact map overlap problem ⋮ Quantum science and quantum technology ⋮ An Introduction to Quantum Computing, without the Physics ⋮ An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem ⋮ Generalized quantum partial adiabatic evolution ⋮ Quantum algorithm design: techniques and applications ⋮ SQR: a simple quantum representation of infrared images ⋮ Symmetry-protected adiabatic quantum transistors ⋮ How to make assisted driving Hamiltonian useful in quantum adiabatic computation? ⋮ Optimality of partial adiabatic search and its circuit model ⋮ An introduction to quantum annealing ⋮ Quantum interference computation ⋮ Realizable Hamiltonians for universal adiabatic quantum computers ⋮ ON THE ADIABATIC EVOLUTION OF ONE-DIMENSIONAL PROJECTOR HAMILTONIANS ⋮ Quantum pattern recognition with multi-neuron interactions ⋮ Solovay-Kitaev approximations of special orthogonal matrices ⋮ Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes ⋮ Quantum walks: a comprehensive review ⋮ ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS ⋮ Analytic methods in quantum computing ⋮ Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design ⋮ Adiabatic approximation with exponential accuracy for many-body systems and quantum computation ⋮ The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) ⋮ Unnamed Item ⋮ Adiabatic quantum counting by geometric phase estimation ⋮ Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers ⋮ Quantum computing with octonions ⋮ Lie algebras for some specific dissipative Landau-Zener problems ⋮ Anderson localization makes adiabatic quantum optimization fail ⋮ Adiabatic Landau-Zener transitions at avoided level crossings with fast noise ⋮ Minor-embedding in adiabatic quantum computation. I: The parameter setting problem ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Quantum algorithms for algebraic problems ⋮ Colloquium: Quantum annealing and analog quantum computation ⋮ On a measurement-free quantum lambda calculus with classical control ⋮ On the circuit model of global adiabatic search algorithm ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer ⋮ The Kitaev–Feynman clock for open quantum systems ⋮ On the power of coherently controlled quantum adiabatic evolutions ⋮ Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians ⋮ Theory versus practice in annealing-based quantum computing ⋮ Programmable Hamiltonian for One-way Patterns ⋮ Translationally invariant universal quantum Hamiltonians in 1D ⋮ ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS ⋮ Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation ⋮ Error-run-time trade-off in the adiabatic approximation beyond scaling relations ⋮ Generation of elementary gates and Bell’s states using controlled adiabatic evolutions ⋮ Quantum random access stored-program machines ⋮ Fast universal quantum computation with railroad-switch local Hamiltonians ⋮ Ergodic quantum computing ⋮ The theory of variational hybrid quantum-classical algorithms ⋮ Entangling problem Hamiltonian for adiabatic quantum computation ⋮ Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles ⋮ On the quantum adiabatic evolution with the most general system Hamiltonian ⋮ Generalized relation between fidelity and quantum adiabatic evolution
This page was built for publication: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
