Pith. sign in

REVIEW

Symbolic Reasoning about Quantum Circuits in Coq

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.11023 v4 pith:3DQBPHHY submitted 2020-05-22 cs.PL cs.LOquant-ph

classification cs.PLcs.LOquant-ph
keywords quantumreasoningsymboliccircuitsmatrixsomeapproachautomated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A quantum circuit is a computational unit that transforms an input quantum state to an output one. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits increases, the matrix dimension grows exponentially and the computation becomes intractable. In this paper, we propose a symbolic approach to reasoning about quantum circuits. It is based on a small set of laws involving some basic manipulations on vectors and matrices. This symbolic reasoning scales better than the explicit one and is well suited to be automated in Coq, as demonstrated with some typical examples.

Discussion (0). Sign in to comment.

Pith tools