Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0HAL

pfoqcompiler: Efficient Compilation of Quantum Control in Recursive First-Order Quantum Programs

  • Mário Silva
  • Alexandre Guernut
  • Marco Lewis
Open at sourcePDFCite

Abstract

Recursive quantum control allows for simple and concise descriptions of algorithms. However, a naive circuit compilation sequentializes the different branches of the quantum if-statement and results in an exponential increase in circuit depth. Existing techniques can parallelize these branches, but do so at the cost of an exponential number of ancillary qubits. We present pfoqcompiler, a compiler targeting Qiskit for the first-order quantum programming language FOQ that exploits program structure to merge compatible recursive procedure calls across quantum branches. We introduce weaker syntactically-checkable conditions for well-foundedness, recursive halving, and uniformity, while preserving previously demonstrated complexity characterizations. For weakly well-founded bounded-width programs, the compiler produces polynomial-size circuits; weakly recursively halving programs additionally yield polylogarithmic depth, while weak uniformity removes the asymptotic overhead of branch sequentialization.

Related

  1. Why Are We Unrolling? The Importance of Structured Quantum Programs for Compilation
    Damian Rovara, Daniel Haag, Mark Koch +8
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
    Dhanvi Bharadwaj, Siddharth Dangwal, Yuewen Hou +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification
    Zhaohui Yang, Yuwei Han, Ruiyun Zhang +4
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Quantum circuit compilation with constant overhead
    Chenyi Zhang, Xinyu Tan, Robin Kothari +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
    Qifan Huang, Minbo Gao, Li Zhou +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{silva2026pfoqcompiler,
  title = {{pfoqcompiler: Efficient Compilation of Quantum Control in Recursive First-Order Quantum Programs}},
  author = {Mário Silva and Alexandre Guernut and Marco Lewis},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://inria.hal.science/hal-05738864v1},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - pfoqcompiler: Efficient Compilation of Quantum Control in Recursive First-Order Quantum Programs
AU  - Mário Silva
AU  - Alexandre Guernut
AU  - Marco Lewis
PY  - 2026
DA  - 2026/09/04
PB  - HAL
UR  - https://inria.hal.science/hal-05738864v1
AB  - Recursive quantum control allows for simple and concise descriptions of algorithms. However, a naive circuit compilation sequentializes the different branches of the quantum if-statement and results in an exponential increase in circuit depth. Existing techniques can parallelize these branches, but do so at the cost of an exponential number of ancillary qubits. We present pfoqcompiler, a compiler targeting Qiskit for the first-order quantum programming language FOQ that exploits program structure to merge compatible recursive procedure calls across quantum branches. We introduce weaker syntactically-checkable conditions for well-foundedness, recursive halving, and uniformity, while preserving previously demonstrated complexity characterizations. For weakly well-founded bounded-width programs, the compiler produces polynomial-size circuits; weakly recursively halving programs additionally yield polylogarithmic depth, while weak uniformity removes the asymptotic overhead of branch sequentialization.
ER  -