EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains

Lukas Schmidbauer, Elisabeth Lobe, Ina Schaefer, Wolfgang Mauerer

ACM Transactions on Quantum Computing · 30.09.2026 · 7 (3) · 1-46

DOI: 10.1145/3800943 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 11.07.2026. Verfasst von Lukas Schmidbauer und 3 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 69 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: German Research Foundation, German Federal Ministry of Education and Research, European Union.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads degrading the computation may arise, possibly negating any possible quantum advantage. Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be “executed” on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy intermediate-scale quantum (NISQ) hardware, these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this article, we consider a specific class of higher-level representations, that is, PUBOs, and devise novel automatic transformation mechanisms into widely used QUBOs that substantially improve efficiency and versatility over the state of the art. In addition, we conduct a comprehensive investigation of industry-relevant problem formulations and their conversion into a quantum-specific representation, identifying significant obstacles in scaling behaviour and demonstrating how these can be circumvented.

Förderung

  • German Research Foundation
  • German Federal Ministry of Education and Research
  • European Union
  • European Funds for Regional Development
  • Quantum Computing Initiative
  • German Federal Ministry for Economic Affairs and Climate Action
  • High-Tech Agenda of the Free State of Bavaria

Zitieren

APA

Schmidbauer, L., Lobe, E., Schaefer, I., & Mauerer, W. (2026). It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains. ACM Transactions on Quantum Computing, 7(3), 1-46. https://doi.org/10.1145/3800943

Vancouver

Schmidbauer L, Lobe E, Schaefer I, Mauerer W. It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains. ACM Transactions on Quantum Computing. 2026;7(3):1-46. doi:10.1145/3800943

BibTeX
@article{Schmidbauer2026,
  author = {Schmidbauer, Lukas and Lobe, Elisabeth and Schaefer, Ina and Mauerer, Wolfgang},
  title = {It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains},
  journal = {ACM Transactions on Quantum Computing},
  year = {2026},
  volume = {7},
  number = {3},
  pages = {1--46},
  doi = {10.1145/3800943}
}
Kostenlos starten →