Optimizes and reasons about quantum circuits using graphical string diagrams and spider-based rewrite rules.
The ZX-calculus skill empowers Claude to perform advanced quantum circuit simplification and verification using the diagrammatic language developed by Coecke and Duncan. By representing qubits as wires and quantum operations as spiders (Z and X nodes), it enables automated circuit optimization—such as T-count reduction—equivalence checking, and cross-platform compilation. This skill bridges the gap between high-level topological reasoning and practical implementation, integrating with industry-standard libraries like DisCoPy and PyZX for researchers and developers working on the next generation of quantum software.
Key Features
01Graphical quantum circuit rewriting and simplification
022 GitHub stars
03T-count reduction for optimized quantum hardware execution
04Support for Z-spiders, X-spiders, and Hadamard edges
05Integration with DisCoPy and PyZX Python frameworks
06Automated equivalence checking between quantum circuit representations
Use Cases
01Reducing gate count and complexity of quantum circuits before hardware deployment
02Translating high-level diagrammatic notation into executable Python code for quantum simulations
03Verifying logical equivalence between complex quantum programs
