Anderson localization makes adiabatic quantum optimization fail
From MaRDI portal
Recommendations
- Probing Anderson localization using the dynamics of a qubit
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- The quantum adiabatic optimization algorithm and local minima
- Adiabatic quantum optimization with qudits
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Non-Hermitian adiabatic quantum optimization
- Quantitative Anderson localization of Schrödinger eigenstates under disorder potentials
- Anderson localization and momentum-space entanglement
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
Cites work
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Computational Complexity
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Statistical mechanics.
- The quantum adiabatic optimization algorithm and local minima
Cited in
(27)- Entangling problem Hamiltonian for adiabatic quantum computation
- Hard combinatorial problems and minor embeddings on lattice graphs
- On the quantum adiabatic evolution with the most general system Hamiltonian
- Generalized relation between fidelity and quantum adiabatic evolution
- 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
- Spectral form factor of a quantum spin glass
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- The large connectivity limit of the Anderson model on tree graphs
- The improved evolution paths to speedup quantum evolution
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
- 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
- Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing
- Ergodic and localized regions in quantum spin glasses on the Bethe lattice
- Elimination of perturbative crossings in adiabatic quantum optimization
- From ergodic to non-ergodic chaos in Rosenzweig–Porter model
- Efficient population transfer via non-ergodic extended states in quantum spin glass
- Anderson Localization in Dissipative Lattices
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
- On the circuit model of two quantum adiabatic search algorithms
- Local density of states correlations in the Lévy-Rosenzweig-Porter random matrix ensemble
- Phase transitions in quantum annealing of an NP-hard problem detected by fidelity susceptibility
This page was built for publication: Anderson localization makes adiabatic quantum optimization fail
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073990)
