Differentiable Logical Programming for Quantum Circuit Discovery and Optimization
Antonin Sulc

TL;DR
This paper presents a neuro-symbolic, differentiable logic programming framework for quantum circuit design, enabling autonomous discovery and hardware-aware optimization using gradient-based methods.
Contribution
It introduces a novel continuous logic formulation for quantum circuit discovery, bridging logic and quantum evolution, and demonstrates adaptive optimization on real quantum hardware.
Findings
Successfully discovered a 4-qubit Quantum Fourier Transform from a candidate gate scaffold.
Achieved hardware-aware adaptation on IBM Fez, reducing error rates by up to 46.7%.
Addressed barren plateau issues through biased initialization.
Abstract
Designing high-fidelity quantum circuits remains challenging, and current paradigms often depend on heuristic, fixed-ansatz structures or rule-based compilers that can be suboptimal or lack generality. We introduce a neuro-symbolic framework that reframes quantum circuit design as a differentiable logic programming problem. Our model represents a scaffold of potential quantum gates and parameterized operations as a set of learnable, continuous ``truth values'' or ``switches,'' . These switches are optimized via standard gradient descent to satisfy a user-defined set of differentiable, logical axioms (e.g., correctness, simplicity, robustness). We provide a theoretical formulation bridging continuous logic (via T-norms) and unitary evolution (via geodesic interpolation), while addressing the barren plateau problem through biased initialization. We illustrate the approach…
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.
