Picturing Counting Reductions with the ZH-Calculus
From MaRDI portal
Publication:6200526
DOI10.4204/eptcs.384.6arXiv2304.02524OpenAlexW4386095710MaRDI QIDQ6200526
Konstantinos Meichanetzidis, John van de Wetering, Unnamed Author
Publication date: 22 March 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.02524
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- The complexity of computing the permanent
- NP is as easy as detecting unique solutions
- The computational complexity of propositional STRIPS planning
- The complexity of tensor calculus
- On the hardness of approximate reasoning
- Hybrid quantum-classical circuit simplification with the ZX-calculus
- Phase Groups and the Origin of Non-locality for Qubits
- Picturing Quantum Processes
- Quantum Computation and Quantum Information
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- Interacting Quantum Observables
- Rewriting Measurement-Based Quantum Computations with Generalised Flow
- The Complexity of Enumeration and Reliability Problems
- Planar Formulae and Their Uses
- Quantum Complexity Theory
- Interacting quantum observables: categorical algebra and diagrammatics
- Quantum picturalism for topological cluster-state computing
- Quantum computing, postselection, and probabilistic polynomial-time
- The complexity of theorem-proving procedures
- Theory and Applications of Models of Computation
This page was built for publication: Picturing Counting Reductions with the ZH-Calculus
