Practical integer-to-binary mapping for quantum annealers

DOI10.1007/s11128-019-2213-xzbMath1417.81092arXiv1706.01945OpenAlexW3101339117WikidataQ128339517 ScholiaQ128339517MaRDI QIDQ670020

Pooya Ronagh, Sahar Karimi

Publication date: 15 March 2019

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

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

zbMATH Keywords

integer programmingadiabatic quantum computationbounded-coefficient encodinginteger encodingsimulated quantum annealing

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Numerical methods based on nonlinear programming (49M37) Quantum computation (81P68) Atomic physics (81V45) Variational principles of physics (49S05)

Related Items

Least-squares solutions to polynomial systems of equations with quantum annealing, Models in quantum computing: a systematic review

Uses Software

• Gurobi

Cites Work

• Performance of two different quantum annealing correction codes
• Adiabatic quantum optimization with qudits
• A subgradient approach for constrained binary optimization via quantum adiabatic evolution
• A case study in programming a quantum annealer for hard operational planning problems
• Linear and mixed integer programming for portfolio optimization
• Quantum versus classical annealing of Ising spin glasses
• Scheduling in Supply Chains Using Mixed Integer Programming
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution