A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
From MaRDI portal
Publication:3101369
DOI10.1126/science.1057726zbMath1226.81046arXivquant-ph/0104129OpenAlexW2105614108WikidataQ52065299 ScholiaQ52065299MaRDI QIDQ3101369
Jeffrey Goldstone, Edward Farhi, Joshua Lapan, Sam Gutmann, Andrew Lundgren, Daniel Preda
Publication date: 28 November 2011
Published in: Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0104129
Related Items
Convergence condition of simulated quantum annealing with a non-stoquastic catalyst, 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, Topological Quantum Computation, A Modified Adiabatic Quantum Algorithm for Evaluation of Boolean Functions, Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation, Non-Hermitian Quantum Annealing and Superradiance, Quantum machine learning: a classical perspective, Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator, Template-Based Minor Embedding for Adiabatic Quantum Optimization, Analytic approach to the Landau–Zener problem in bounded parameter space, Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers, FORECASTING STOCK MARKET CRASHES VIA REAL-TIME RECESSION PROBABILITIES: A QUANTUM COMPUTING APPROACH, Why adiabatic quantum annealing is unlikely to yield speed-up, Graph minors from simulated annealing for annealing machines with sparse connectivity, QUANTUM AUCTIONS, Reliability of Digitized Quantum Annealing and the Decay of Entanglement, Statistical Analysis of Quantum Annealing, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, Dissipation in adiabatic quantum computers: lessons from an exactly solvable model, Collective dynamics of phase-repulsive oscillators solves graph coloring problem, The set partitioning problem in a quantum context, On renormalization and the local gap method for proving frustration-free local spin chains are gapped, Unnamed Item, LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS, QUANTUM AUCTIONS USING ADIABATIC EVOLUTION: THE CORRUPT AUCTIONEER AND CIRCUIT IMPLEMENTATIONS, Elimination of perturbative crossings in adiabatic quantum optimization, Fidelity-optimized quantum state estimation, Universal quantum computation by scattering in the Fermi–Hubbard model, Quantum adiabatic Markovian master equations, Bounds for the adiabatic approximation with applications to quantum computation, Operational geometric phase for mixed quantum states, Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics, Efficient quantum circuits for diagonal unitaries without ancillas, Transitionless quantum driving in open quantum systems, Why the quantitative condition fails to reveal quantum adiabaticity, Exploring adiabatic quantum trajectories via optimal control, Physical consequences of P≠NP and the density matrix renormalization group annealing conjecture, On the quantum spin glass transition on the Bethe lattice, Floquet resonances close to the adiabatic limit and the effect of dissipation, Deterministic quantum annealing expectation-maximization algorithm, Quantum Monte Carlo annealing with multi-spin dynamics, Realizable Hamiltonians for universal adiabatic quantum computers, ON THE ADIABATIC EVOLUTION OF ONE-DIMENSIONAL PROJECTOR HAMILTONIANS, Ergodic and localized regions in quantum spin glasses on the Bethe lattice, Decoherence rates in large-scale quantum computers and macroscopic quantum systems, A class of time-energy uncertainty relations for time-dependent Hamiltonians, Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes, ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS, The fundamental gap for a class of Schrödinger operators on path and hypercube graphs, Adiabatic approximation with exponential accuracy for many-body systems and quantum computation, Why should anyone care about computing with anyons?, ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS, Quantum Random Walks – New Method for Designing Quantum Algorithms, How does adiabatic quantum computation fit into quantum automata theory?, Adiabatic graph-state quantum computation, Hierarchical theory of quantum adiabatic evolution, LANDAU-ZENER TRANSITIONS IN THE PRESENCE OF SPIN ENVIRONMENT, NON-HERMITIAN ADIABATIC QUANTUM OPTIMIZATION, ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS, Unnamed Item, Generation of elementary gates and Bell’s states using controlled adiabatic evolutions, Fast universal quantum computation with railroad-switch local Hamiltonians, The theory of variational hybrid quantum-classical algorithms, Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems, SIMULATION OF QUANTUM ADIABATIC SEARCH IN THE PRESENCE OF NOISE, Iterative classical superadiabatic algorithm for combinatorial optimization, Performance of two different quantum annealing correction codes, Estimations of the errors between the evolving states generated by two Hamiltonians with the same initial state, The improved evolution paths to speedup quantum evolution, On the role of prior probability in adiabatic quantum algorithms, Hyper CNOT and hyper Bell-state analysis assisted by quantum dots in double-side optical microcavities, Role of coherence in adiabatic search algorithms, The power of quantum systems on a line, Symmetry constraints on temporal order in measurement-based quantum computation, Classical simulated annealing using quantum analogues, A characterization of global entanglement, NMR quantum information processing, Phase transitions and gaps in quantum random energy models, Quantum adiabatic machine learning, D-Wave and predecessors: From simulated to quantum annealing, Modeling the Costas array problem in QUBO for quantum annealing, Adiabatic quantum optimization with qudits, Parallel computational structure of noisy quantum circuits simulation, Tunneling time from spin fluctuations in Larmor clock, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device, Enhancing quantum annealing performance for the molecular similarity problem, Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets, Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution?, Demkov-Kunike models with decay, Quantum algorithms for typical hard problems: a perspective of cryptanalysis, Microwave photonics with superconducting quantum circuits, Minimizing minor embedding energy: an application in quantum annealing, Quantum walks for the determination of commutativity of finite dimensional algebras, Adiabatic evolution under quantum control, Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions, A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor, A subgradient approach for constrained binary optimization via quantum adiabatic evolution, Probabilistic nonunitary gate in imaginary time evolution, A study of heuristic guesses for adiabatic quantum computation, Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity, \texttt{tqix.pis}: a toolbox for quantum dynamics simulation of spin ensembles in Dicke basis, A quantum-implementable neural network model, Partial adiabatic quantum search algorithm and its extensions, Histogram-based segmentation of quantum images, Efficient diabatic quantum algorithm in number factorization, Quantum science and quantum technology, Quantum computing vs. coherent computing, Circuit-based digital adiabatic quantum simulation and pseudoquantum simulation as new approaches to lattice gauge theory, Non-Hermitian quantum annealing in the antiferromagnetic Ising chain, Adiabatic quantum programming: minor embedding with hard faults, An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem, Generalized quantum partial adiabatic evolution, Quantum algorithm design: techniques and applications, Analysis of adiabatic approximation using stable Hamiltonian method, A multi-qubit system for a scalable adiabatic quantum evolution, Optimality of partial adiabatic search and its circuit model, Quantum reservoir computing: a reservoir approach toward quantum machine learning on near-term quantum devices, Counterdiabatic driving of the quantum Ising model, An automated deductive verification framework for circuit-building quantum programs, Coherent and dissipative dynamics at quantum phase transitions, Practical integer-to-binary mapping for quantum annealers, An introduction to quantum annealing, Quantum interference computation, On complexity of the quantum Ising model, Quantum pattern recognition with multi-neuron interactions, Image processing via simulated quantum dynamics, An adiabatic theorem for resonances, Shortcuts to adiabaticity in cutting a spin chain, Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design, The complexity of the quantum adiabatic algorithm, Phase space representation of quantum dynamics, An improved noise quantum annealing method for TSP, Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers, Operator growth bounds from graph theory, Anderson localization makes adiabatic quantum optimization fail, Experiments with probabilistic quantum auctions, Minor-embedding in adiabatic quantum computation. I: The parameter setting problem, Colloquium: Quantum annealing and analog quantum computation, On the circuit model of global adiabatic search algorithm, Theory versus practice in annealing-based quantum computing, A study of the performance of classical minimizers in the quantum approximate optimization algorithm, Programmable Hamiltonian for One-way Patterns, Emergent quantumness in neural networks, Towards quantum computing based community detection, Random matrix model of adiabatic quantum computing, Noise resistance of adiabatic quantum computation using random matrix theory, Quantum information in the Posner model of quantum cognition, Quantum Approach to Classical Statistical Mechanics, Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States, The potential of quantum annealing for rapid solution structure identification, Geometric phases for classical and quantum dynamics: Hannay angle and Berry phase for loops on a torus, Entangling problem Hamiltonian for adiabatic quantum computation, On the efficiency of Hamiltonian-based quantum computation for low-rank matrices, How quantum is the speedup in adiabatic unstructured search?, A new post-quantum voting protocol based on physical laws, Stability of local quantum dissipative systems, Hard combinatorial problems and minor embeddings on lattice graphs, On the quantum adiabatic evolution with the most general system Hamiltonian, Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem, Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems, Resource efficient gadgets for compiling adiabatic quantum optimization problems, A note on the switching adiabatic theorem, Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing, Generalized relation between fidelity and quantum adiabatic evolution, Quantum walks can find a marked element on any graph
