Equivalence checking of quantum circuits by model counting
From MaRDI portal
Cites work
- "NON-IDENTITY-CHECK" IS QMA-COMPLETE
- \textsf{symQV}: automated symbolic verification of quantum programs
- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
- Circuit extraction for ZX-diagrams can be \(\#\mathbf{P}\)-hard
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Consistency of Local Density Matrices Is QMA-Complete
- Early verification of legal compliance via bounded satisfiability checking
- Equivalence checking of quantum circuits by model counting
- Error Correcting Codes in Quantum Theory
- Exact non-identity check is NQP-complete
- Good quantum error-correcting codes exist
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Improving synthesis of reversible circuits: exploiting redundancies in paths and nodes of QMDDs
- Interacting quantum observables: categorical algebra and diagrammatics
- On probabilistic inference by weighted model counting
- Optimizing quantum space using spooky pebble games
- Quantum computations: algorithms and error correction
- SAT-based {CNOT, \(T\)} quantum circuit synthesis
- The Problem of Simplifying Truth Functions
- The Solovay--Kitaev algorithm
- Towards a SAT encoding for quantum circuits: a journey from classical circuits to Clifford circuits and beyond
Cited in
(2)
This page was built for publication: Equivalence checking of quantum circuits by model counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034578)
