Resource efficient gadgets for compiling adiabatic quantum optimization problems

DOI10.1002/andp.201300120zbMath1279.81041arXiv1307.8041OpenAlexW3101836835MaRDI QIDQ2870496

Bryan O'Gorman, Alán Aspuru-Guzik, Ryan Babbush

Publication date: 21 January 2014

Published in: Annalen der Physik (Search for Journal in Brave)

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

zbMATH Keywords

optimizationquantum informationquantum simulationadiabatic quantum computing

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coding (general) (81P70)

Related Items (3)

A comparison of approaches for finding minimum identifying codes on graphs ⋮ Ising Machines for Diophantine Problems in Physics ⋮ A case study in programming a quantum annealer for hard operational planning problems

Cites Work

• Pseudo-Boolean optimization
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Proof verification and the hardness of approximation problems
• A study of a curious arithmetic function

This page was built for publication: Resource efficient gadgets for compiling adiabatic quantum optimization problems