Metraipolis › archive › dc_44924977e2ae

Noise-aware Verification and Synthesis of Quantum Programs — arXiv:2608.05807

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05807
License (as archived)
CC0-1.0
Archived
2026-10-31T10:50:28.944Z
SHA-256 of the archived text
2dc66a8a24f576c2619331bc6ccb4fc1cb21c4fa91f71771f2f6057bb334f9fd
Stable URL of this page
https://metraipolis.com/documento/dc_44924977e2ae

How to cite

Noise-aware Verification and Synthesis of Quantum Programs — arXiv:2608.05807 — arXiv (en), https://arxiv.org/abs/2608.05807 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44924977e2ae (Metraipolis archive dc_44924977e2ae, sha256 2dc66a8a24f576c2619331bc6ccb4fc1cb21c4fa91f71771f2f6057bb334f9fd)
BibTeX
@misc{dc44924977e2ae,
  title = {Noise-aware Verification and Synthesis of Quantum Programs — arXiv:2608.05807},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05807},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44924977e2ae; sha256 2dc66a8a24f576c2619331bc6ccb4fc1cb21c4fa91f71771f2f6057bb334f9fd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05807. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This work provides a comprehensive framework for noise-aware quantum program analysis, ranging from logical foundations to model checking and automated synthesis. While most research on quantum programming considers an idealized, noise-free semantics for quantum programs, we reason about quantum programs that are executed on real, noisy hardware. We use the error models published by quantum-hardware vendors to give a hardware-dependent semantics to quantum programs. We then present a noise-aware quantum Hoare logic with a relatively complete proof system. We finally use state-space exploration techniques for the hardware-aware verification and synthesis of loop-free quantum programs. In this way, we synthesize optimal, hardware-dependent solutions for parity bit-flip, GHZ state preparation, and other problems that commonly occur as subroutines in larger quantum algorithms. We evaluate our method on all 55 hardware specifications provided by the IBM Qiskit toolkit. Finally, we also show that classical probabilistic branching is needed for optimality in quantum programming.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-07 in cs.LO).
Categorie arXiv: Programming Languages (cs.PL) ; Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.05807 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T10:38:07.106Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).