scientific article; zbMATH DE number 5953558

MaRDI QIDQ3171707zbMATH OpenFDO

Authors Edward Farhi, David Gosset, Sam Gutmann, H. Meyer, Peter W. Shor, Jeffrey Goldstone

Publication date 5 October 2011

zbMATH Keywords

adiabatic quantum computationestimation of eigenvalue crossingsquantum Monte-Carlo

Mathematics Subject Classification ID

Eigenvalue problems for linear operators (47A75) Monte Carlo methods (65C05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• The complexity of the quantum adiabatic algorithm
• On the gap of Hamiltonians for the adiabatic simulation of quantum circuits
• On models of nonlinear evolution paths in adiabatic quantum algorithms
• Adiabatic quantum optimization with qudits
• Entanglement properties of adiabatic quantum algorithms
• scientific article; zbMATH DE number 1984609
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• An alternative adiabatic quantum algorithm for the Hamiltonian cycle problem
• The quantum adiabatic optimization algorithm and local minima
• Schedule path optimization for adiabatic quantum computing and optimization

Cited in

(15)

• Entangling problem Hamiltonian for adiabatic quantum computation
• A new post-quantum voting protocol based on physical laws
• Challenges of adiabatic quantum evaluation of NAND trees
• Unstructured randomness, small gaps and localization
• Schedule path optimization for adiabatic quantum computing and optimization
• The quantum adiabatic optimization algorithm and local minima
• scientific article; zbMATH DE number 1984609 (Why is no real title available?)
• A quantum differentiation of k-SAT instances
• Exploring adiabatic quantum trajectories via optimal control
• The performance of the quantum adiabatic algorithm on spike Hamiltonians
• The complexity of the quantum adiabatic algorithm
• Iterative classical superadiabatic algorithm for combinatorial optimization
• Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems
• A study of heuristic guesses for adiabatic quantum computation
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end

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 Q3171707)