Preprint
Oct 2026
Circuit Design Problems in Binary Polynomial Quantum Optimization
This paper studies the problem of designing the shallowest quantum circuit for a given polynomial form as a classical binary linear problem and proves the NP-completeness of a variant of it, Tempura, and offers a scalable and performant heuristic method to tackle it, Tempura.
Dylan Laplace Mermoud, Dimitri Watel, S. Elloumi et al.
· 0 citations