Papers › IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX
IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX
Erik Armengol, Joseph Bowles
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
IQPopt is a software package designed to optimize large-scale instantaneous quantum polynomial circuits on classical hardware. By exploiting an efficient classical simulation algorithm for expectation value estimation, circuits with thousands of qubits and millions of gates can be optimized, provided the relevant objective function has an efficient description in terms of Pauli-Z type observables. Since sampling from instantaneous quantum polynomial circuits is widely believed to be hard for classical computers, this provides a method to identify powerful circuit instances before deployment and sampling on quantum hardware, where computational advantages may exist. The package leverages automatic differentiation in JAX, can be accelerated with access to hardware accelerators such as graphics processing units, and contains a dedicated module that can be used to train and evaluate quantum generative models via the maximum mean discrepancy.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections