arXiv (All)
open access
Minimality of the Pure Qubit ZX Calculus
The ZX calculus is a graphical language for reasoning about quantum processes. In this paper, we develop a minimal pure-qubit ZX calculus based on the work of Vilmart [arXiv:1812.09114], Backens, Perdrix, and Wang [arXiv:1709.08903], and Stoltz [arXiv:2606.12383]. This resolves a problem that has re
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Breakdown of Classical Minicrypt Equivalences in the Quantum-Computation Classical-Communication Model#1117810
- Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks#241561
- Failure-Guided Fuzzing for Hybrid Quantum-Classical Programs#187382
- Achieving Practical Post-Quantum Threshold Signatures from Lattices#357477
- KQFuzz: Knowledge-Guided Fuzzing for Quantum Libraries via Large Language Models#411134
Record · ID 974540
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive