Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Progress towards a small-scale quantum annealer I: Architecture

Yu Chen, Chris Quintana, Dvir Kafri, Alireza Shabani, B. Chiaro, Brooks Foxen, Zijun Chen, A. Dunsworth, C. Neill, J. Wenner, Hartmut Neven, John M. Martinis

Published Mar 13, 2017• 4 citations
OpenAlex

Related papers

Progress towards a small-scale quantum annealer III: Device theory and modeling

Dvir Kafri, Chris Quintana, Yu Chen +4 more

Bulletin of the American Physical Society•Mar 13, 2017•0 citations

Progress towards a small-scale quantum annealer II: Device characterization and ultra-strong tunable coupling

Chris Quintana, Yu Chen, Dvir Kafri +9 more

Bulletin of the American Physical Society•Mar 13, 2017•0 citations

Towards large-scale superconducting quantum annealers: 2.5D packaging technology and application specific architecture

Shiro Kawabata, Kazuhiko Endo, Go Fujii +19 more

Bulletin of the American Physical Society•Mar 8, 2018•0 citations

Progress Towards Quantum Annealer v2.0 II: Theory

Dvir Kafri, Chris Quintana, Yu Chen +2 more

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

Finding optimal quantum annealer architectures

Zoe Gonzalez Izquierdo

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

Integer Programming from Quantum Annealing and Open Quantum Systems

Chia Cheng Chang, Chih-Chieh Chen, Christopher Körber +2 more

While quantum computing proposes promising solutions to computational problems not accessible with classical approaches, due to current hardware constraints, most quantum algorithms are not yet capable of computing systems of practical relevance, and classical counterparts outperform them. To practically benefit from quantum architecture, one has to identify problems and algorithms with favorable scaling and improve on corresponding limitations depending on available hardware. For this reason, we developed an algorithm that solves integer linear programming problems, a classically NP-hard problem, on a quantum annealer, and investigated problem and hardware-specific limitations. This work presents the formalism of how to map ILP problems to the annealing architectures, how to systematically improve computations utilizing optimized anneal schedules, and models the anneal process through a simulation. It illustrates the effects of decoherence and many body localization for the minimum dominating set problem, and compares annealing results against numerical simulations of the quantum architecture. We find that the algorithm outperforms random guessing but is limited to small problems and that annealing schedules can be adjusted to reduce the effects of decoherence. Simulations qualitatively reproduce algorithmic improvements of the modified annealing schedule, suggesting the improvements have origins from quantum effects.

arXiv:2009.11970•Sep 24, 2020•12 citations
While quantum computing proposes promising solutions to computational problems not accessible with classical approaches, due to current hardware constraints, most quantum algorithms are not yet capable of computing systems of practical relevance, and classical counterparts outperform them. To practically benefit from quantum architecture, one has to identify problems and algorithms with favorable scaling and improve on corresponding limitations depending on available hardware. For this reason, we developed an algorithm that solves integer linear programming problems, a classically NP-hard problem, on a quantum annealer, and investigated problem and hardware-specific limitations. This work presents the formalism of how to map ILP problems to the annealing architectures, how to systematically improve computations utilizing optimized anneal schedules, and models the anneal process through a simulation. It illustrates the effects of decoherence and many body localization for the minimum dominating set problem, and compares annealing results against numerical simulations of the quantum architecture. We find that the algorithm outperforms random guessing but is limited to small problems and that annealing schedules can be adjusted to reduce the effects of decoherence. Simulations qualitatively reproduce algorithmic improvements of the modified annealing schedule, suggesting the improvements have origins from quantum effects.