Towards large-scale functional verification of universal quantum circuits
From MaRDI portal
Classical hypergeometric functions, ({}_2F_1) (33C05) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Quantum computation (81P68) Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30)
Recommendations
- Fast equivalence-checking for quantum circuits
- An automated deductive verification framework for circuit-building quantum programs
- Automated equivalence checking of concurrent quantum systems
- Towards quantum programs verification: from Quipper circuits to QPMC
- Model Checking for Verification of Quantum Circuits
Cites work
- Analysis of Boolean Functions
- Applying Grover's algorithm to AES: quantum resource estimates
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Fast equivalence-checking for quantum circuits
- Formal certification of a compiler back-end or: programming a compiler with a proof assistant
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 7447789 (Why is no real title available?)
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- scientific article; zbMATH DE number 5320307 (Why is no real title available?)
- scientific article; zbMATH DE number 5934473 (Why is no real title available?)
- scientific article; zbMATH DE number 6297720 (Why is no real title available?)
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- QWIRE: a core language for quantum circuits
- Rewriting modulo symmetric monoidal structure
- T-Count Optimization and Reed–Muller Codes
- Towards quantum programs verification: from Quipper circuits to QPMC
- Verified compilation of space-efficient reversible circuits
- Verifying the Steane code with Quantomatic
Cited in
(21)- Classical simulation of quantum circuits by half Gauss sums
- The structure of sum-over-paths, its consequences, and completeness for Clifford
- An automated deductive verification framework for circuit-building quantum programs
- A modeling and verification framework for optical quantum circuits
- Formal verification of optical quantum flip gate
- Fast equivalence-checking for quantum circuits
- Self-testing of universal and fault-tolerant sets of quantum gates
- Techniques to reduce /4-parity-phase circuits, motivated by the ZX calculus
- \textsf{symQV}: automated symbolic verification of quantum programs
- Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
- Model Checking for Verification of Quantum Circuits
- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
- Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing
- Hypergraph simplification: linking the path-sum approach to the ZH-calculus
- And-gates in ZX-calculus: spider nest identities and QBC-completeness
- Quantum Hoare type theory: extended abstract
- Relating measurement patterns to circuits via Pauli flow
- Generators and relations for the group \(\mathrm{O}_n(\mathbb{Z}[\frac{1}{2}])\)
- Multi-controlled phase gate synthesis with ZX-calculus applied to neutral atom hardware
- Symbolic synthesis of Clifford circuits and beyond
- Building qutrit diagonal gates from phase gadgets
This page was built for publication: Towards large-scale functional verification of universal quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385623)
