Skip to main content
Search

Andi Gu

1 related articles

Subscribe to updates
  1. arXiv

    A large language model rewrites quantum arithmetic circuits, cutting both Toffoli count and qubits on seven of eight compilation tasks

    Running quantum algorithms requires compiling classical functions into reversible, coherently executable circuits, and that compilation has long relied on predefined equivalence-preserving rewrites that keep search close to a fixed design. An evolutionary framework in which a large language model proposes candidates and an independent evaluator verifies and scores them produced circuits across eight compilation tasks spanning numerical computation, chemistry, optimization, quantum simulation and number theory. On seven of the eight, the discovered circuits reduce both Toffoli and qubit counts relative to the state of the art; on the eighth, the search found a new reversible architecture for prime-field modular inversion that makes divsteps viable for reversible integer arithmetic.

You’re all caught up