An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F23%3APU149404" target="_blank" >RIV/00216305:26230/23:PU149404 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/3591270" target="_blank" >http://dx.doi.org/10.1145/3591270</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3591270" target="_blank" >10.1145/3591270</a>
Alternative languages
Result language
angličtina
Original language name
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits
Original language description
We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple {P} C {Q} and the question is whether, given a set of quantum states P on the input of a circuit C, the set of quantum states on the output is equal to (or included in) a set Q. While this is not suitable to specify, e.g., functional correctness of a quantum circuit, it is sufficient to detect many bugs in quantum circuits. We propose a technique based on tree automata to compactly represent sets of quantum states and develop transformers to implement the semantics of quantum gates over this representation. Our technique computes with an algebraic representation of quantum states, avoiding the inaccuracy of working with floating-point numbers. We implemented the proposed approach in a prototype tool and evaluated its performance against various benchmarks from the literature. The evaluation shows that our approach is quite scalable, e.g., we managed to verify a large circuit with 40 qubits and 141,527 gates, or catch bugs injected into a circuit with 320 qubits and 1,758 gates, where all tools we compared with failed. In addition, our work establishes a connection between quantum program verification and automata, opening new possibilities to exploit the richness of automata theory and automata-based verification in the world of quantum computing.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Proceedings of the ACM on Programming Languages
ISSN
2475-1421
e-ISSN
—
Volume of the periodical
7
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
26
Pages from-to
1218-1243
UT code for WoS article
001005701900052
EID of the result in the Scopus database
2-s2.0-85161987319