Disentangling the gap between quantum and \#SAT

DOI10.1007/978-3-031-77019-7_2MaRDI QIDQ6979833zbMATH OpenFDO

Authors Jingyi Mei, Jan Martens, Alfons W. Laarman

Publication date 23 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-77019-7_2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A structured view on weighted counting with relations to counting, quantum computation and applications
• Algebraic model counting
• ANALYSIS OF QUANTUM FUNCTIONS
• Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
• Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
• Equivalence checking of quantum circuits by model counting
• Gap-definable counting classes
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Interacting quantum observables: categorical algebra and diagrammatics
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Quantum complexity theory
• Rewriting measurement-based quantum computations with generalised flow
• The complexity of computing the permanent
• The complexity of power-index comparison
• The relative complexity of approximate counting problems
• The theory of quantum information
• The weakness of CTC qubits and the power of approximate counting
• Weighted model counting on the GPU by exploiting small treewidth

This page was built for publication: Disentangling the gap between quantum and \#SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979833)