scientific article; zbMATH DE number 1984609
From MaRDI portal
Publication:4428975
Recommendations
Cited in
(38)- Resonant transition-based quantum computation
- Entangling problem Hamiltonian for adiabatic quantum computation
- How quantum is the speedup in adiabatic unstructured search?
- Three counterexamples refuting Kieu's plan for ``quantum adiabatic hypercomputation; and some uncomputable quantum mechanical tasks
- Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
- Challenges of adiabatic quantum evaluation of NAND trees
- Anti-crossings and spectral gap during quantum adiabatic evolution
- Spectral gap amplification
- On the role of prior probability in adiabatic quantum algorithms
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Unstructured randomness, small gaps and localization
- Random matrix model of adiabatic quantum computing
- Noise resistance of adiabatic quantum computation using random matrix theory
- Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
- scientific article; zbMATH DE number 5953558 (Why is no real title available?)
- Eigenpath traversal by phase randomization
- scientific article; zbMATH DE number 5666687 (Why is no real title available?)
- Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing
- Adiabatic quantum optimization with qudits
- LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- On the Hamiltonian operators for adiabatic quantum reduction of SAT
- The quantum adiabatic optimization algorithm and local minima
- Adiabatic quantum state generation and statistical zero knowledge
- Relationship between minimum gap and success probability in adiabatic quantum computing
- A quantum differentiation of k-SAT instances
- Elimination of perturbative crossings in adiabatic quantum optimization
- Why the quantitative condition fails to reveal quantum adiabaticity
- An alternative adiabatic quantum algorithm for the Hamiltonian cycle problem
- The performance of the quantum adiabatic algorithm on spike Hamiltonians
- On the gap of Hamiltonians for the adiabatic simulation of quantum circuits
- Bounding Run-Times of Local Adiabatic Algorithms
- The complexity of the quantum adiabatic algorithm
- How does adiabatic quantum computation fit into quantum automata theory?
- Why adiabatic quantum annealing is unlikely to yield speed-up
- A study of heuristic guesses for adiabatic quantum computation
- The travelling salesman problem and adiabatic quantum computation: an algorithm
- A multi-qubit system for a scalable adiabatic quantum evolution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428975)
