Entangling problem Hamiltonian for adiabatic quantum computation
From MaRDI portal
Recommendations
- Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
- The travelling salesman problem and adiabatic quantum computation: an algorithm
- scientific article; zbMATH DE number 1984609
- A study of heuristic guesses for adiabatic quantum computation
Cites work
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Anderson localization makes adiabatic quantum optimization fail
- Bounds for the adiabatic approximation with applications to quantum computation
- Complexity of stoquastic frustration-free Hamiltonians
- Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
- Elimination of perturbative crossings in adiabatic quantum optimization
- scientific article; zbMATH DE number 5953558 (Why is no real title available?)
- scientific article; zbMATH DE number 3737613 (Why is no real title available?)
- Quantum stochastic optimization
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- The nature of computation
Cited in
(2)
This page was built for publication: Entangling problem Hamiltonian for adiabatic quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095868)