Baby's First Diagrammatic Calculus for Quantum Information Processing

Similar documents
Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

University of Bristol - Explore Bristol Research. Publisher's PDF, also known as Version of record

Verifying the Steane code with Quantomatic

A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond

Design and Analysis of Quantum Protocols and Algorithms

Single qubit + CNOT gates

arxiv: v1 [quant-ph] 27 Apr 2017

In the beginning God created tensor... as a picture

Quantum information and quantum computing

A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond

Lecture 4: Postulates of quantum mechanics

Selling Category Theory to the Masses

Quantum Teleportation Pt. 1

Quantum Gates, Circuits & Teleportation

QWIRE Practice: Formal Verification of Quantum Circuits in Coq

Instantaneous Nonlocal Measurements

Picturing Quantum Processes,

QPEL Quantum Program and Effect Language

Universal Blind Quantum Computing

Quantum Information & Quantum Computation

Quantum Computing: Foundations to Frontier Fall Lecture 3

IBM quantum experience: Experimental implementations, scope, and limitations

arxiv: v1 [quant-ph] 26 Sep 2017

b) (5 points) Give a simple quantum circuit that transforms the state

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Categorical Models for Quantum Computing

Rewriting measurement-based quantum computations with generalised flow

The Logic of Quantum Mechanics - take II Bob Coecke Oxford Univ. Computing Lab. Quantum Group

6.896 Quantum Complexity Theory September 9, Lecture 2

Physics, Language, Maths & Music

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Quantum information processing: a new light on the Q-formalism and Q-foundations

Entanglement and Quantum Teleportation

CS/Ph120 Homework 1 Solutions

Report on Conceptual Foundations and Foils for QIP at the Perimeter Institute, May 9 May

Lecture 3: Superdense coding, quantum circuits, and partial measurements

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

Seminar 1. Introduction to Quantum Computing

Quantum Entanglement and the Bell Matrix

Connecting the categorical and the modal logic approaches to Quantum Mech

Diagrammatic Methods for the Specification and Verification of Quantum Algorithms

Quantum Computer Architecture

Quantum Effects. Juliana K. Vizzotto 1 Thorsten Altenkirch 2. Amr Sabry January Yale CS Colloquium Page 1

Errata list, Nielsen & Chuang. rrata/errata.html

Quantum Teleportation Pt. 3

CHAPTER 0: A (VERY) BRIEF TOUR OF QUANTUM MECHANICS, COMPUTATION, AND CATEGORY THEORY.

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

A Categorical Quantum Logic

2. Introduction to quantum mechanics

Lecture 20: Bell inequalities and nonlocality

Categorical quantum channels

Lecture 3: Hilbert spaces, tensor products

Short introduction to Quantum Computing

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

Lecture 2: Introduction to Quantum Mechanics

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Orthogonality and Algebraic Lambda-Calculus

An Introduction to Quantum Information and Applications

Principles of Quantum Mechanics Pt. 2

CSE 599d - Quantum Computing The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding

Teleportation-based approaches to universal quantum computation with single-qubit measurements

6.896 Quantum Complexity Theory 30 October Lecture 17

Topological quantum information was formulated by Kitaev

Quantum Noise. Michael A. Nielsen. University of Queensland

Introduction to Quantum Computing

CS257 Discrete Quantum Computation

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Classical Verification of Quantum Computations

5. Communication resources

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution

Lecture 21: Quantum communication complexity

Zero-Knowledge Against Quantum Attacks

Quantum Information & Quantum Computation

Introduction to Quantum Computation

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

1. Basic rules of quantum mechanics

Quantum sampling of mixed states

Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

A categorical model for a quantum circuit description language

An exponential separation between quantum and classical one-way communication complexity

Lecture 11 September 30, 2015

The dagger lambda calculus

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

Is Quantum Search Practical?

Quantum Information Processing and Diagrams of States

Fourier Sampling & Simon s Algorithm

Knotted Pictures of Hadamard Gate and CNOT Gate

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

02 Propositional Logic

92 CHAPTER III. QUANTUM COMPUTATION. Figure III.11: Diagram for swap (from NC).

Some Introductory Notes on Quantum Computing

Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks

A Graph Theoretic Perspective on CPM(Rel)

Lecture 1: Introduction to Quantum Computing

Lecture: Quantum Information

Transcription:

Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38

Quantum computing ˆ Quantum computing is usually described using nite-dimensional Hilbert spaces and linear maps (or nite-dimensional C*-algebras and completely positive maps). ˆ Computing the matrix representation of quantum operations requires memory exponential in the number of input qubits. ˆ This is not a scalable approach for software applications related to quantum information processing (QIP). 2 / 38

Quantum computing ˆ Quantum computing is usually described using nite-dimensional Hilbert spaces and linear maps (or nite-dimensional C*-algebras and completely positive maps). ˆ Computing the matrix representation of quantum operations requires memory exponential in the number of input qubits. ˆ This is not a scalable approach for software applications related to quantum information processing (QIP). ˆ An alternative is provided by the ZX-calculus which is a sound, complete and universal diagrammatic calculus for equational reasoning about nite-dimensional quantum computing. 2 / 38

ZX-calculus ˆ The calculus is diagrammatic (some similarities to quantum circuits). ˆ Example: Preparation of a Bell state. 0 0 H ˆ The ZX-calculus is practical. Used to study and discover new results in: ˆ Quantum error-correcting codes [Chancellor, Kissinger, et. al 2016]. ˆ Measurement-based quantum computing [Duncan & Perdrix 2010]. ˆ (Quantum) foundations [Backens & Duman 2014]. ˆ and others... 3 / 38

ZX-calculus ˆ The ZX-calculus is formal. ˆ Developed through the study of categorical quantum mechanics. ˆ Rewrite system based on string diagrams of dagger compact closed categories. ˆ Universal: Any linear map in FdHilb is the interpretation of some ZX-diagram D. ˆ Sound: If ZX D 1 = D 2, then D 1 = D 2. ˆ Complete: If D 1 = D 2, then ZX D 1 = D 2. 4 / 38

ZX-calculus ˆ The ZX-calculus is amenable to automation and formal reasoning. ˆ Implemented in the Quantomatic proof assistant. Figure: The quantomatic proof assistant. 5 / 38

ZX-calculus ˆ The ZX-calculus provides a dierent conceptual perspective of quantum information. Example The Bell state is the standard example of an entangled state: 0 0 H = = The diagrammatic notation clearly indicates this is not a separable state. 6 / 38

Syntax A ZX-diagram is an open undirected graph constructed from the following generators: α,, α, where α [0, 2π). Example π/4 π π/2 7 / 38

Syntax The ZX-calculus is an equational theory. Equality is written as D 1 = D 2 : Example = 8 / 38

Normalisation Remark: I ignore scalars and normalisation throughout the rest of the talk for brevity. But that can be handled by the language. 9 / 38

Semantics: wires ( ) 1 0 := 0 1 1 0 0 0 := 0 0 1 0 0 1 0 0 0 0 0 1 = 00 + 11 = 00 + 11 10 / 38

Semantics: spiders and hadamard = 1 ( ) 1 1 = H 2 1 1 0 m 0 n α = 1 m e iα 1 n others 0 α + m + n = m e iα n others 0 11 / 38

Semantics: tensors If D 1 = M1 and D 2 = M2, then: D 1 D 2 = M 1 M 2 12 / 38

Semantics: composition If D 1 = M1 and D 2 = M2, then: D 2 D 1 = M2 M 1 By following these rules we can represent any linear map f : C 2m C n as a ZX-diagram (universality). 13 / 38

Example: Quantum States State ZX-diagram 0 1 π + π 00 + 11 14 / 38

Example: unitary operations Unitary map Z X H Z X ZX-diagram π π π π 15 / 38

Example: 2-qubit gates Unitary map Z X ZX-diagram π π Z CNOT 16 / 38

Proof system There are only 12 axioms. Five of them are: α = α + β ; = ; = ; β = ; α = α Remark: The color-swapped versions follow as derived rules. Remark: This rewrite system is sound and complete, i.e. no need for linear algebra: ZX D 1 = D 2 D 1 = D 2. 17 / 38

Example: Preparation of Bell state 0 0 H = = = 18 / 38

Example: CNOT is self-adjoint Lemma: = Then: = = = = = 19 / 38

From Hilbert spaces to C*-algebras ˆ So far we talked about pure state quantum mechanics (FdHilb). ˆ Next, we show how to model mixed-states (FdCStar). ˆ I omit some details for simplicity (see [Coecke & Kissinger, Picturing Quantum Processes]). ˆ The basic idea is to double up our diagrams and negate all angles in one of the copies (but there are other ways as well). Example π/4 π π/2 π/4 π π/2 π/4 π π/2 20 / 38

Example: Quantum States State (FdCStar) ZX-diagram State (FdHilb) ZX-diagram 0 1 π + π 00 + 11 0 0 1 1 π + + π π π 00 00 + 11 11 21 / 38

Example: unitary operations Unitary map (FdHilb) ZX-diagram Z X π π T π/4 H Z X π π Unitary map (FdCStar) Z X T H ZX-diagram π π π π π/4 π/4 Z X π π π π 22 / 38

Example: conditional unitary operations Conditional unitary ZX-diagram Z b X b 23 / 38

Measuremens Measurement ZX-diagram Measurement in Z basis Measurement in X basis Measurement in Bell basis 24 / 38

Example: quantum teleportation 0. A qubit owned by Alice. 25 / 38

Example: quantum teleportation 1. Prepare Bell state. 26 / 38

Example: quantum teleportation 2. Do Bell basis measurement on both of Alice's qubits. 27 / 38

Example: quantum teleportation 3. Alice sends two bits (b 1, b 2 ) to Bob to inform him of measurement outcome. b 2 b 1 28 / 38

Example: quantum teleportation 4. Bob performs unitary correction X b 1 Z b 2. 29 / 38

Example: quantum teleportation We can now prove the correctness of the teleportation protocol in the ZX-calculus: = 30 / 38

Example: quantum teleportation Input: A qubit owned by Alice. = = 31 / 38

Example: quantum teleportation Input: A qubit owned by Alice. = = 32 / 38

Example: quantum teleportation Input: A qubit owned by Alice. = = 33 / 38

Example: quantum teleportation Input: A qubit owned by Alice. = = 34 / 38

Example: quantum teleportation Input: A qubit owned by Alice. = = 35 / 38

Example: quantum teleportation = Therefore, teleportation works as expected. 36 / 38

Conclusion ˆ The ZX-calculus is a sound and complete alternative to linear algebra for nite-dimensional quantum information processing. ˆ Great potential for formal methods, verication and computer-aided reasoning. ˆ Useful tool for studying QIP. ˆ If you want to learn more, check out the book (contains outdated and incomplete version of ZX): 37 / 38

Thank you for your attention! 38 / 38