ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces

The ZX-calculus is a graphical language for reasoning about quantum computing and quantum information theory.As a complete graphical language, it incorporates a set of axioms rich enough to derive any equation of the underlying formalism.While completeness of the ZX-calculus has been established for qubits and the Clifford fragment of prime-dimensional qudits, universal completeness beyond two-level systems has remained unproven until now.In this paper, we present a proof establishing the completeness of finite-dimensional ZX-calculus, incorporating only the mixeddimensional Z-spider and the qudit X-spider as generators.Our approach builds on the completeness of another graphical language, the finite-dimensional ZW-calculus, with direct translations between these two calculi.By proving its completeness, we lay a solid foundation for the ZX-calculus as a versatile tool not only for quantum computation but also for various fields within finite-dimensional quantum theory.

Authors

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2025-08-19
DOI
https://doi.org/10.4204/eptcs.426.5
Citations
2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
3.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces

Boldizsár Poór, Razin A. Shaikh, Quanlong Wang
2 citations
Electronic Proceedings in Theoretical Computer Science
Matrix Theory and Algorithms
3.01
article

ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces

Boldizsár Poór, Razin A. Shaikh, Quanlong Wang
article en
2 citations

Abstract

The ZX-calculus is a graphical language for reasoning about quantum computing and quantum information theory.As a complete graphical language, it incorporates a set of axioms rich enough to derive any equation of the underlying formalism.While completeness of the ZX-calculus has been established for qubits and the Clifford fragment of prime-dimensional qudits, universal completeness beyond two-level systems has remained unproven until now.In this paper, we present a proof establishing the completeness of finite-dimensional ZX-calculus, incorporating only the mixeddimensional Z-spider and the qudit X-spider as generators.Our approach builds on the completeness of another graphical language, the finite-dimensional ZW-calculus, with direct translations between these two calculi.By proving its completeness, we lay a solid foundation for the ZX-calculus as a versatile tool not only for quantum computation but also for various fields within finite-dimensional quantum theory.

Electronic Proceedings in Theoretical Computer ScienceVol. 426
Engineering and Physical Sciences Research Council, Clarendon Fund
Openalex Percentile: Top 8%
Matrix Theory and Algorithms
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.