Modular Synthesis of Efficient Quantum Uncomputation
Hristo Venev, Timon Gehr, Dimitar Dimitrov, Martin Vechev

TL;DR
This paper presents a novel modular approach for automatically synthesizing correct and efficient uncomputation in expressive quantum programs, overcoming limitations of existing circuit-based methods.
Contribution
It introduces an IR supporting expressive quantum programs with uncomputation and modular algorithms for synthesis, enabling handling of complex quantum code beyond primitive circuits.
Findings
Handles programs beyond existing uncomputation methods
Competitive performance on benchmarks
Supports expressive quantum programming languages
Abstract
A key challenge of quantum programming is uncomputation: the reversible deallocation of qubits. And while there has been much recent progress on automating uncomputation, state-of-the-art methods are insufficient for handling today's expressive quantum programming languages. A core reason is that they operate on primitive quantum circuits, while quantum programs express computations beyond circuits, for instance, they can capture families of circuits defined recursively in terms of uncomputation and adjoints. In this paper, we introduce the first modular automatic approach to synthesize correct and efficient uncomputation for expressive quantum programs. Our method is based on two core technical contributions: (i) an intermediate representation (IR) that can capture expressive quantum programs and comes with support for uncomputation, and (ii) modular algorithms over that IR for…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
