Improved Simulation of Stabilizer Circuits Scott Aaronson (UC Berkeley) Joint work with Daniel Gottesman (Perimeter) 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Closed Timelike Curves Make Quantum and Classical Computing Equivalent
Quantum Lower Bounds The Polynomial and Adversary Methods Scott Aaronson September 14, 2001 Prelim Exam Talk.
How Much Information Is In Entangled Quantum States? Scott Aaronson MIT |
The Learnability of Quantum States Scott Aaronson University of Waterloo.
Quantum Copy-Protection and Quantum Money Scott Aaronson (MIT) | | | Any humor in this talk is completely unintentional.
Lower Bounds for Local Search by Quantum Arguments Scott Aaronson.
Multilinear Formulas and Skepticism of Quantum Computing Scott Aaronson UC Berkeley IAS.
Limitations of Quantum Advice and One-Way Communication Scott Aaronson UC Berkeley IAS Useful?
Quantum Search of Spatial Regions Scott Aaronson (UC Berkeley) Joint work with Andris Ambainis (U. Latvia)
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Generating Random Stabilizer States in Matrix Multiplication Time: A Theorem in Search of an Application Scott Aaronson David Chen.
Quantum Computation and Quantum Information – Lecture 2
Quantum Computation and Quantum Information – Lecture 3
Computing with adversarial noise Aram Harrow (UW -> MIT) Matt Hastings (Duke/MSR) Anup Rao (UW)
Short seed extractors against quantum storage Amnon Ta-Shma Tel-Aviv University 1.
University of Queensland
Sergey Bravyi, IBM Watson Center Robert Raussendorf, Perimeter Institute Perugia July 16, 2007 Exactly solvable models of statistical physics: applications.
Puzzle Twin primes are two prime numbers whose difference is two.
( ( ) quantum bits conventional bit
University of Queensland
GENERALIZED STABILIZERS Ted Yoder. Quantum/Classical Boundary How do we study the power of quantum computers compared to classical ones? Compelling problems.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
On Quantum Walks and Iterated Quantum Games G. Abal, R. Donangelo, H. Fort Universidad de la República, Montevideo, Uruguay UFRJ, RJ, Brazil.
1 Multiphoton Entanglement Eli Megidish Quantum Optics Seminar,2010.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute.
Department of Computer Science & Engineering University of Washington
1 EPR Pairs and Quantum Teleportation 2005/08/11.
Use of Simulated Annealing in Quantum Circuit Synthesis Manoj Rajagopalan 17 Jun 2002.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
University of Queensland
Review from last lecture: A Simple Quantum (3,1) Repetition Code
CSEP 590tv: Quantum Computing
Quantum Error Correction: Andrew Landahl David Gottesman Dr. Wu And others.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Classical Versus Quantum. Goal: Fast, low-cost implementation of useful algorithms using standard components (gates) and design techniques Classical Logic.
Alice and Bob’s Excellent Adventure
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
Quantum Error Correction Daniel Gottesman Perimeter Institute.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
Quantum Computing Preethika Kumar
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum Computing MAS 725 Hartmut Klauck NTU
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 20 (2009)
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Quantum Computing Reversibility & Quantum Computing.
CSEP 590tv: Quantum Computing Dave Bacon July 20, 2005 Today’s Menu n Qubit registers Begin Quantum Algorithms Administrivia Superdense Coding Finish Teleportation.
Communicating Quantum Processes Simon Gay Department of Computing Science University of Glasgow Rajagopal Nagarajan Department of Computer Science University.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture (2011)
Simulation and Design of Stabilizer Quantum Circuits Scott Aaronson and Boriska Toth CS252 Project December 10, X X +Z Z +ZI +IX
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
OSU Quantum Information Seminar
Linear Optical Quantum Computing
Presentation transcript:

Improved Simulation of Stabilizer Circuits Scott Aaronson (UC Berkeley) Joint work with Daniel Gottesman (Perimeter) ZI +IX +XI +IZ

Quantum Computing: New Challenges for Computer Architecture Cant speculate on a measurement and then roll back Cache coherence protocols violate no- cloning theorem How do you design and debug circuits that you cant even simulate efficiently with existing tools?

Our Approach: Start With A Subset of Quantum Computations Stabilizers (Gottesman 1996): Beautiful formalism that captures much (but not all) of quantum weirdness – Linear error-correcting codes – Teleportation – Dense quantum coding – GHZ (Greenberger-Horne-Zeilinger) paradox

Gates Allowed In Stabilizer Circuits 1. Controlled-NOT |00 |00, |01 |01, |10 |11, |11 |10 2. Hadamard |0 (|0 +|1 )/ 2 |1 (|0 -|1 )/ 2 H 3. Phase = |0 |0, |1 i|1 P 100i100i 4. Measurement of a single qubit AMAZING FACT These gates are NOT universalGottesman & Knill showed how to simulate them quickly on a classical computer To see why we need some group theory…

X 2 =Y 2 =Z 2 =IXY=iZYZ=iXZX=iY XZ=-iYZY=-iXYX=-iZ Unitary matrix U stabilizes a quantum state | if U| = |. Stabilizers of | form a group X stabilizes |0 +|1 -X stabilizes |0 +|1 Y stabilizes |0 +i|1 -Y stabilizes |0 -i|1 Z stabilizes |0 -Z stabilizes | I =Z = X = 0-i i0 Y = Pauli Matrices: Collect Em All

If | can be produced from the all-0 state by just CNOT, Hadamard, and phase gates, then | is stabilized by 2 n tensor products of Pauli matrices or their opposites (where n = number of qubits) So the stabilizer group is generated by log(2 n )=n such tensor products Indeed, | is then uniquely determined by these generators, so we call | a stabilizer state Gottesman-Knill Theorem

Goal: Using a classical computer, simulate an n- qubit CNOT/Hadamard/Phase computer. Gottesman & Knills solution: Keep track of n generators of the stabilizer group Each generator uses 2n+1 bits: 2 for each Pauli matrix and 1 for the sign. So n(2n+1) bits total Example: But measurement takes O(n 3 ) steps by Gaussian elimination +X X -ZZ |01 +|11 |01 +|10 CNOT(1 2) +XI -IZ Updating stabilizers takes only O(n) steps OUCH!

Our Faster, Easier-To-Implement Tableau Algorithm Idea: Instead of n(2n+1) bits, store 2n(2n+1) bits n stabilizers S 1,…,S n, 2n+1 bits each n destabilizers D 1,…,D n Together generate full Pauli group Maintain the following invariants: D i s commute with each other S i anticommutes with D i S i commutes with D j for i j

Destabilizers Stabilizers State: |00 +XI +IX +ZI +IZ x ij bitsz ij bitsr i bits I: x ij =0, z ij =0+ phase: r i =0 X: x ij =1, z ij =0- phase: r i =1 Y: x ij =1, z ij =1 Z: x ij =0, z ij =1 S1S2S1S2 D1D2D1D2

Destabilizers Stabilizers State: |00 +XI +IX +ZI +IZ Hadamard on qubit a: For all i {1,…,2n}, swap x ia with z ia, and set r i := r i x ia z ia

Destabilizers Stabilizers State: |00 +|10 +ZI +IX +XI +IZ

Destabilizers Stabilizers State: |00 +|10 +ZI +IX +XI +IZ CNOT from qubit a to qubit b: For all i {1,…,2n}, set x ib := x ib x ia and z ia := z ia z ib

Destabilizers Stabilizers State: |00 +|11 +ZI +IX +X X +Z Z

Destabilizers Stabilizers State: |00 +|11 +ZI +IX +X X +Z Z Phase on qubit a: For all i {1,…,2n}, set r i := r i x ia z ia, then set z ia := z ia x ia

Destabilizers Stabilizers State: |00 +i|11 +ZI +IY +X Y +Z Z

Destabilizers Stabilizers State: |00 +i|11 +ZI +IY +X Y +Z Z Measurement of qubit a: If x ia =0 for all i {n+1,…,2n}, then outcome will be deterministic. Otherwise 0 with ½ probability and 1 with ½ probability.

Destabilizers Stabilizers State: |11 +X Y +IY -ZI +Z Z Random outcome: Pick a stabilizer S i such that x ia =1 and set D i :=S i. Then set S i :=Z a and output 0 with ½ probability, and set S i :=-Z a and output with ½ probability, where Z a is Z on a th qubit and I elsewhere. Finally, left-multiply whatever rows dont commute with S i by D i

Novel part: How to obtain deterministic measurement outcomes in only O(n 2 ) steps, without using Gaussian elimination? Z a must commute with stabilizer, so for a unique choice of c 1,…,c n {0,1}. If we can determine c i s, then by summing corresponding S h s we learn sign of Z a. Now So just have to check if D i commutes with Z a, or equivalently if x ia =1

CHP: An interpreter for quantum assembly language programs that implements our scoreboard algorithm Example: Quantum Teleportation H H HH | |0 | Alices Qubits Bobs Qubits Prepare EPR pair Alices partBobs part h 1 c 1 2 c 0 1 h 0 m 0 m 1 c 0 3 c 1 4 c 4 2 h 2 c 3 2 h 2 CHP Code

Performance of CHP Average time needed to simulate a measurement after applying βnlogn random unitary gates to n qubits, on a 650MHz Pentium III with 256MB RAM

Simulating Stabilizer Circuits is L-Complete L = class of problems reducible in logarithmic space to evaluating a circuit of CNOT gates Natural, well-studied subclass of P Conjectured that L P. So our result means stabilizer circuits probably arent even universal for classical computation! Simulating L with stabilizer circuits: Obvious Simulating stabilizer circuits with L : Harder

How many n-qubit stabilizer states are there? Fun With Stabilizers Can we represent mixed states in the stabilizer formalism? YES Can we efficiently compute the inner product between two stabilizer states? YES

Future Directions Measurements (at least some) in O(n) steps? Apply CHP to quantum error-correction, studying conjectures about entanglement in many-qubit systems… Efficient minimization of stabilizer circuits? Superlinear lower bounds on stabilizer circuit size? Other quantum computations with efficient classical simulations: bounded entanglement (Vidal 2003), matchgates (Valiant 2001)…