Alleviating the quantum Big-M problem
Abstract A major obstacle for quantum optimizers is the reformulation of constraints as a quadratic unconstrained binary optimization (QUBO). Current QUBO translators exaggerate the weight M of the penalty terms. Classically known as the “Big-M” problem, the issue becomes even more daunting for quan...
Saved in:
| Main Authors: | Edoardo Alessandroni, Sergi Ramos-Calderer, Ingo Roth, Emiliano Traversi, Leandro Aolita |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-025-01067-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Probing quantum complexity via universal saturation of stabilizer entropies
by: Tobias Haug, et al.
Published: (2025-07-01) -
Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
by: Dominik Hangleiter, et al.
Published: (2024-11-01) -
On Bigness and the Problem of Urban Form
by: Armando Rabaça, et al.
Published: (2018-04-01) -
The Quantum Measurement Problem
by: Erik B. Karlsson
Published: (2025-06-01) -
BIG DATA: PROBLEMS OF TECHNOLOGY PROCESSING AND STORAGE
by: Vladimir Feokharovich Antonov, et al.
Published: (2022-10-01)