scientific article; zbMATH DE number 5953558
From MaRDI portal
Publication:3171707
zbMATH Open1247.81085MaRDI QIDQ3171707FDOQ3171707
Jeffrey Goldstone, Edward Farhi, Peter W. Shor, Sam Gutmann, David Gosset, H. Meyer
Publication date: 5 October 2011
Title of this publication is not available (Why is that?)
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
Monte Carlo methods (65C05) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Eigenvalue problems for linear operators (47A75)
Cited In (10)
- Challenges of adiabatic quantum evaluation of NAND trees
- Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems
- A study of heuristic guesses for adiabatic quantum computation
- Iterative classical superadiabatic algorithm for combinatorial optimization
- Title not available (Why is that?)
- Schedule path optimization for adiabatic quantum computing and optimization
- Exploring adiabatic quantum trajectories via optimal control
- A new post-quantum voting protocol based on physical laws
- Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
- Entangling problem Hamiltonian for adiabatic quantum computation
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)
