Hybrid quantum-classical circuit simplification with the ZX-calculus

DOI10.1007/978-3-030-89051-3_8OpenAlexW3210562671MaRDI QIDQ2691632

Simon Perdrix, Benoît Valiron, Agustín Borgna

Publication date: 29 March 2023

Full work available at URL: https://arxiv.org/abs/2109.06071

zbMATH Keywords

optimizationhybrid circuitsgFlowPyZXZX-calculus

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Related Items (2)

PyZX ⋮ Picturing Counting Reductions with the ZH-Calculus

Uses Software

• Quipper
• ProjectQ
• openQASM
• cQASM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Which Graph States are Useful for Quantum Information Processing?
• Interacting Quantum Observables
• Rewriting Measurement-Based Quantum Computations with Generalised Flow

This page was built for publication: Hybrid quantum-classical circuit simplification with the ZX-calculus