The Power of ZX Calculus: Compiling Quantum Codes
APA
Khesin, A. (2023). The Power of ZX Calculus: Compiling Quantum Codes. Perimeter Institute. https://pirsa.org/23120029
MLA
Khesin, Andrey. The Power of ZX Calculus: Compiling Quantum Codes. Perimeter Institute, Dec. 04, 2023, https://pirsa.org/23120029
BibTex
@misc{ pirsa_PIRSA:23120029, doi = {10.48660/23120029}, url = {https://pirsa.org/23120029}, author = {Khesin, Andrey}, keywords = {Quantum Information}, language = {en}, title = {The Power of ZX Calculus: Compiling Quantum Codes}, publisher = {Perimeter Institute}, year = {2023}, month = {dec}, note = {PIRSA:23120029 see, \url{https://pirsa.org}} }
Quantum error-correcting codes are a key pillar of quantum computing. They allow for the recovery of quantum information in the presence of noise. There are three main ways to depict a quantum code: by the list of codewords, by an encoding circuit, or by a stabilizer tableau. Although the latter is used most often, all three of these have pros and cons. In this talk, I will showcase ZX calculus, a graphical language that can be used to talk about quantum states, circuits, measurements, and importantly, codes. I will demonstrate its power and versatility and showcase a canonical form for states, circuits, and codes. The power of this theorem allows us to compile these quantum objects to a unique, elegant, and simple form which serves as a much better depiction than any of the three methods above.
---
Zoom link https://pitp.zoom.us/j/91431057660?pwd=cW9xKzNXejdIekp3amFacFZ5OHN5dz09