Symbolic Reasoning about Quantum Circuits in Coq

May 22, 2020 Β· Declared Dead Β· πŸ› Journal of Computational Science and Technology

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wenjun Shi, Qinxiang Cao, Yuxin Deng, Hanru Jiang, Yuan Feng arXiv ID 2005.11023 Category cs.PL: Programming Languages Cross-listed cs.LO, quant-ph Citations 11 Venue Journal of Computational Science and Technology Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted