Towards Quantum Programs Verification: From Quipper Circuits to QPMC

Anticoli, Linda; Piazza, Carla; Taglialegne, Leonardo; Zuliani, Paolo

doi:10.1007/978-3-319-40578-0_16

Cited by 14 publications

(14 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As an example, we show the reduction of the term shown in Eq. (1). For convenience, we define T as if b then init(tt), free(v c ) else v c , * .…”

Section: F S T T C S 2 0 2 1 13:8mentioning

confidence: 99%

“…An interesting implication of this model is that the quantum circuit construction in the classical host can be dependent on the result of a measurement: there is a transfer of information from the quantum co-processor to the classical host. This feature is implemented for example in Quipper [7,1] and QWire [11,12]. Following Quipper's convention, we call this transfer dynamic lifting: classical information is lifted from the quantum co-processor to the classical host.…”

Section: Introductionmentioning

confidence: 99%

“…To illustrate this problem, let us look at the program in Eq. (1). The syntax we use is presented in Section 2, so we explain what the program does here: The program measures the qubit v c and obtains the updated state of the qubit together with the resulting boolean b.…”

Section: Introductionmentioning

confidence: 99%

“…The syntax we use is presented in Section 2, so we explain what the program does here: The program measures the qubit v c and obtains the updated state of the qubit together with the resulting boolean b. Based on b, it then either allocates a new qubit initialized by true, then free the qubit v c , or simply returns v c 1 . Despite this simple structure, the program does not correspond to a circuit because of the classical control.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

Lee,

Perrelle,

Valiron

et al. 2021

Preprint

View full text Add to dashboard Cite

In this paper, we introduce dynamic lifting to a quantum circuit-description language, following the Proto-Quipper language approach. Dynamic lifting allows programs to transfer the result of measuring quantum data -qubits-into classical data -booleans-. We propose a type system and an operational semantics for the language and we state safety properties. Next, we introduce a concrete categorical semantics for the proposed language, basing our approach on a recent model from Rios&Selinger for Proto-Quipper-M. Our approach is to construct on top of a concrete category of circuits with measurements a Kleisli category, capturing as a side effect the action of retrieving classical content out of a quantum memory. We then show a soundness result for this semantics.

show abstract

“…As an example, we show the reduction of the term shown in Eq. (1). For convenience, we define T as if b then init(tt), free(v c ) else v c , * .…”

Section: F S T T C S 2 0 2 1 13:8mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

Lee,

Perrelle,

Valiron

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Moreover, a program that is easy to formally verify may be translated into a circuit with hundreds of bits, and is thus very difficult to verify. Recent work has shown progress towards verification of more general properties of reversible and quantum circuits via model checking [4], but to the authors' knowledge, no verification of a reversible circuit compiler has yet been carried out. By contrast, many compilers for general purpose programming languages have been formally verified in recent yearsmost famously, the CompCert optimizing C compiler [13], written and verified in Coq.…”

Section: Contributionsmentioning

confidence: 99%

Verified Compilation of Space-Efficient Reversible Circuits

Amy

Roetteler

Svore

2017

Computer Aided Verification

View full text Add to dashboard Cite

The generation of reversible circuits from high-level code is an important problem in several application domains, including lowpower electronics and quantum computing. Existing tools compile and optimize reversible circuits for various metrics, such as the overall circuit size or the total amount of space required to implement a given function reversibly. However, little effort has been spent on verifying the correctness of the results, an issue of particular importance in quantum computing. There, compilation allows not only mapping to hardware, but also the estimation of resources required to implement a given quantum algorithm, a process that is crucial for identifying which algorithms will outperform their classical counterparts. We present a reversible circuit compiler called ReVerC, which has been formally verified in F and compiles circuits that operate correctly with respect to the input program. Our compiler compiles the Revs language [21] to combinational reversible circuits with as few ancillary bits as possible, and provably cleans temporary values.

show abstract

Mirrors and Memory in Quantum Automata

Piazza

Romanello

2022

Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Towards Quantum Programs Verification: From Quipper Circuits to QPMC

Cited by 14 publications

References 5 publications

Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

Verified Compilation of Space-Efficient Reversible Circuits

Mirrors and Memory in Quantum Automata

Contact Info

Product

Resources

About