Anderson localization makes adiabatic quantum optimization fail
From MaRDI portal
Publication:3073990
DOI10.1073/pnas.1002116107zbMath1205.81056OpenAlexW2076227063WikidataQ34004908 ScholiaQ34004908MaRDI QIDQ3073990
Hari Krovi, Boris L. Altshuler, Jérémie Roland
Publication date: 12 February 2011
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.1002116107
Related Items (21)
The improved evolution paths to speedup quantum evolution ⋮ Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing ⋮ The large connectivity limit of the Anderson model on tree graphs ⋮ Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution? ⋮ The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization ⋮ Anderson Localization in Dissipative Lattices ⋮ Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks ⋮ Spectral form factor of a quantum spin glass ⋮ Unnamed Item ⋮ Elimination of perturbative crossings in adiabatic quantum optimization ⋮ Physical consequences of P≠NP and the density matrix renormalization group annealing conjecture ⋮ On the quantum spin glass transition on the Bethe lattice ⋮ Entanglement critical length at the many-body localization transition ⋮ Quantum Monte Carlo annealing with multi-spin dynamics ⋮ Ergodic and localized regions in quantum spin glasses on the Bethe lattice ⋮ Entangling problem Hamiltonian for adiabatic quantum computation ⋮ On the efficiency of Hamiltonian-based quantum computation for low-rank matrices ⋮ Hard combinatorial problems and minor embeddings on lattice graphs ⋮ On the quantum adiabatic evolution with the most general system Hamiltonian ⋮ From ergodic to non-ergodic chaos in Rosenzweig–Porter model ⋮ Generalized relation between fidelity and quantum adiabatic evolution
Cites Work
- Unnamed Item
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- The quantum adiabatic optimization algorithm and local minima
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Computational Complexity
This page was built for publication: Anderson localization makes adiabatic quantum optimization fail
