Circuit Extraction for ZX-diagrams can be #P-hard
arXiv:2202.09194 · doi:10.4230/LIPIcs.ICALP.2022.119
Abstract
The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represent linear maps from to qubits for any . Some applications for the ZX-calculus, such as quantum circuit optimisation and synthesis, rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size. While several sufficient conditions are known for describing families of ZX-diagrams that can be efficiently transformed back into circuits, it has previously been conjectured that the general problem of circuit extraction is hard. That is, that it should not be possible to efficiently convert an arbitrary ZX-diagram describing a unitary linear map into an equivalent quantum circuit. In this paper we prove this conjecture by showing that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits. In addition to our main hardness result, which relies specifically on the circuit representation, we give a representation-agnostic hardness result. Namely, we show that any oracle that takes as input a ZX-diagram description of a unitary and produces samples of the output of the associated quantum computation enables efficient probabilistic solutions to NP-complete problems.
15 pages + 3 page appendix
Cited by in corpus (9)
- Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
- Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- With a Few Square Roots, Quantum Computing is as Easy as Π
- Symbolic Synthesis of Clifford Circuits and Beyond
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Quantum Circuits Are Just a Phase
- Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
- Pauli Flow on Open Graphs with Unknown Measurement Labels