Quartz: superoptimization of Quantum circuits

Xu, Mingkuan; Li, Zikun; Padon, Oded; Lin, Sina; Pointing, Jessica; Hirth, Auguste; Ma, Henry; Palsberg, Jens; Aiken, Alex; Acar, Umut A.; Jia, Zhihao

doi:10.1145/3519939.3523433

Cited by 23 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of SMT solvers to automate the reasoning has also appeared in Giallar [Tao et al 2022], Quartz [Xu et al 2022] and symQV [Bauer-Marquart et al 2023], although they only work on quantum circuit compilation passes, quantum circuit optimizations or fixed-size quantum circuit verification.…”

Section: Related Workmentioning

confidence: 99%

A Case for Synthesis of Recursive Quantum Unitary Programs

Deng,

Tao,

Peng

et al. 2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be highly desirable. In this paper, we initiate the study of program synthesis for quantum unitary programs that recursively define a family of unitary circuits for different input sizes, which are widely used in existing quantum programming languages. Specifically, we present QSynth, the first quantum program synthesis framework, including a new inductive quantum programming language, its specification, a sound logic for reasoning, and an encoding of the reasoning procedure into SMT instances. By leveraging existing SMT solvers, QSynth successfully synthesizes ten quantum unitary programs including quantum adder circuits, quantum eigenvalue inversion circuits and Quantum Fourier Transformation, which can be readily transpiled to executable programs on major quantum platforms, e.g., Q#, IBM Qiskit, and AWS Braket.

show abstract

Section: Related Workmentioning

confidence: 99%

A Case for Synthesis of Recursive Quantum Unitary Programs

Deng,

Tao,

Peng

et al. 2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…The works of [43] ensures correctness of the rewrite rules with a theorem prover. Quartz [73] is a circuit optimization framework. It consists of an equivalence checker based on some precomputed equivalence sets.…”

Section: Related Workmentioning

confidence: 99%

“…Quantum circuit (non-)equivalence testing is an essential part of the quantum computing toolkit. Its prominent use is in verifying results of circuit optimization, which is a necessary part of quantum circuit compilation in order to achieve the expected fidelity of quantum algorithms running on real-world quantum computers, which are heavily affected by noise and decoherence [8,41,43,44,52,53,58,62,73]. Already in the world of classical programs, optimizer bugs are being found on a regular basis in compilers used daily by tens of thousands of programmers (see, e.g., [49]).…”

Section: Introductionmentioning

confidence: 99%

An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)

Chen¹,

Chung²,

Lengál³

et al. 2023

Preprint

View full text Add to dashboard Cite

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple { } { } and the question is whether, given a set of quantum states on the input of a circuit , the set of quantum states on the output is equal to (or included in) a set . 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.

show abstract

AutoQ: An Automata-Based Quantum Circuit Verifier

Chen

Chung

Lengál

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a specification language and a fully automated tool named AutoQ for verifying quantum circuits symbolically. The tool implements the automata-based algorithm from [14] and extends it with the capabilities for symbolic reasoning. The extension allows to specify relational properties, i.e., relationships between states before and after executing a circuit. We present a number of use cases where we used AutoQ to fully automatically verify crucial properties of several quantum circuits, which have, to the best of our knowledge, so far been proved only with human help.

show abstract

Quartz: superoptimization of Quantum circuits

Cited by 23 publications

References 20 publications

A Case for Synthesis of Recursive Quantum Unitary Programs

A Case for Synthesis of Recursive Quantum Unitary Programs

An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report)

AutoQ: An Automata-Based Quantum Circuit Verifier

Contact Info

Product

Resources

About