It's Quick to be Square: Fast Quadratisation for Quantum Toolchains
Lukas Schmidbauer, Elisabeth Lobe, Ina Schaefer, Wolfgang Mauerer

TL;DR
This paper introduces a fast, efficient method for transforming problem representations into quantum-ready formats, specifically PUBOs to QUBOs, to enhance quantum algorithm performance on NISQ hardware.
Contribution
It presents novel automatic transformation mechanisms from PUBOs to QUBOs that outperform existing methods in efficiency and versatility.
Findings
Improved transformation speed and efficiency for PUBO to QUBO conversion.
Identification of scaling obstacles in industry-relevant problem formulations.
Demonstration of how to overcome scaling challenges in quantum problem representations.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
