2000 character limit reached
A universal completion of the ZX-calculus
Published 29 Jun 2017 in quant-ph, cs.LO, and math.CT | (1706.09877v1)
Abstract: In this paper, we give a universal completion of the ZX-calculus for the whole of pure qubit quantum mechanics. This proof is based on the completeness of another graphical language: the ZW-calculus, with direct translations between these two graphical systems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.