A study of heuristic guesses for adiabatic quantum computation

DOI10.1007/s11128-010-0168-zzbMath1209.81072arXiv0807.0354OpenAlexW2078536001WikidataQ62556526 ScholiaQ62556526MaRDI QIDQ632202

Alán Aspuru-Guzik, Alejandro Perdomo-Ortiz, Salvador Elías Venegas-Andraca

Publication date: 15 March 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.0354

zbMATH Keywords

quantum algorithmsheuristic algorithmsadiabatic quantum computationadiabatic preparation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

A survey of quantum image representations ⋮ Why adiabatic quantum annealing is unlikely to yield speed-up ⋮ Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems ⋮ A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing

Cites Work

• The complexity of the quantum adiabatic algorithm
• Unstructured adiabatic quantum search
• The state of SAT
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic quantum state generation and statistical zero knowledge
• Adiabatic Quantum State Generation
• The Complexity of the Local Hamiltonian Problem
• Quantum optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A study of heuristic guesses for adiabatic quantum computation