DeepAI AI Chat
Log In Sign Up

Encoding High-level Quantum Programs as SZX-diagrams

by   Agustín Borgna, et al.
University of Buenos Aires

The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we present a method to encode quantum programs implemented in a fragment of the linear dependently typed Proto-Quipper-D language as families of SZX-diagrams. We define a subset of translatable Proto-Quipper-D programs and show that our procedure is able to encode non-trivial algorithms as diagrams that grow linearly on the size of the program.


page 1

page 2

page 3

page 4


Quantum Multiple-Valued Decision Diagrams in Graphical Calculi

Graphical calculi such as the ZH-calculus are powerful tools in the stud...

State diagrams of functional programs

In the paper we introduce graphical objects (called state diagrams) rela...

Diagrammatic security proof for 8-state encoding

Dirac notation is the most common way to describe quantum states and ope...

Classifying Complexity with the ZX-Calculus: Jones Polynomials and Potts Partition Functions

The ZX-calculus is a graphical language which allows for reasoning about...

Open Diagrams via Coend Calculus

Morphisms in a monoidal category are usually interpreted as processes, a...

Graphologue: Exploring Large Language Model Responses with Interactive Diagrams

Large language models (LLMs) have recently soared in popularity due to t...

Quantum Linear Optics via String Diagrams

We establish a formal bridge between qubit-based and photonic quantum co...