THE ABC OF COLOR CODES
|
|
- May Jones
- 6 years ago
- Views:
Transcription
1 THE ABC OF COLOR CODES Aleksander Kubica ariv: , work in progress w/ F. Brandao, K. Svore, N. Delfosse 1
2 WHY DO WE CARE ABOUT QUANTUM CODES? Goal: store information and perform computation. Encode to protect from noise. Perform computation without corrupting encoded information. Color code: many transversal logical gates (Clifford group in 2D). Toric code: high threshold, experimentally realizable (2 dim, 4-body terms), scalable. 2
3 GAUGE COLOR H CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC DECODERS CODE 3
4 STABILIER CODES Stabilizer code - stabilizers are product of Pauli operators and the code space is +1 eigenspace of stabilizers. Stabilizer Hamiltonian - commuting terms are products of Pauli operators; ground space corresponds to the code space. n H = i i+1 i=1 i i+1 (Exactly solvable) toy models, e.g. classification of quantum phases. Topological quantum codes - encode information in non-local degrees of freedom but have (geometrically) local stabilizer generators. 4
5 TORIC CODE IN 2D qubits on edges -vertex and -plaquette terms H = (v) (p) v 8v, p : [(v),(p)] = 0 p code space C = ground space of H degeneracy(c) = 2 2g, where g - genus logical operators - non contractible loops of s or s 5
6 TORIC CODE IN 3D (OR MORE) qubits on edges -vertex and -plaquette terms H = (v) (p) v p lattice L in d dim - d-1 ways of defining toric code for 1 k < d, TCk(L): qubits - k-cells stabilizers - (k-1)-cells stabilizers - (k+1)-cells 6
7 COLOR CODE IN 2D code space C = ground space of H 2 dim lattice: - 3-valent - 3-colorable qubits on vertices plaquette terms H = p (p) 8p, p 0 : [(p),(p 0 )] = 0 p (p) degeneracy(c) = 2 4g, where g - genus 7 ariv:
8 COLOR CODE IN 3D (OR MORE) H = d dim lattice: - (d+1)-valent - (d+1)-colorable lattice L in d dim - d-1 ways of defining color code qubits on vertices for 1< k d, CCk(L): stabilizers - k-cells stabilizers - (d+2-k)-cells qubits - 0-cells p (p) c (c) ariv:
9 GAUGE COLOR H CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC CODE DECODERS 9
10 ariv: TORIC AND COLOR CODES - HOW ARE THEY RELATED? Yoshida 10, Bombin 11: 2D stabilizer Hamiltonians w/ local interactions, translation and scale symmetries are equivalent to toric code. Equivalence of codes = ground states of stabilizer Hamiltonians in the same quantum phase. Two gapped ground states belong to the same phase if and only if they are related by a local unitary evolution (Hastings&Wen 05, Chen et al. 10). EQUIVALENCE = local unitaries and adding/removing decoupled ancillas. Classification for: 2D, stabilizers, translation symmetry, no boundaries. 10
11 ariv: EQUIVALENCE IN D DIMENSIONS Theorem: there exists a unitary U = N U, which is a tensor product of local terms with disjoint support, such that U transforms the color code into n = d k 1 decoupled copies of the toric code. no U [CC k (L)] U = TC k 1 (L i ) obtained from L by i=1 local deformations CCk(L): qubits - 0-cells stabilizers - (d+2-k)-cells stabilizers - k-cells TCk(L): qubits - k-cells stabilizers - (k-1)-cells stabilizers - (k+1)-cells 11
12 TRANSFORMATION IN 2D Every qubit belongs to exactly one green plaquette. U Unitary U = tensor product of unitaries Up supported on green faces. U p U p Desired transformation: u u /-plaquette transforms into an operator either on pink or blue qubits. 12 ariv:
13 EQUIVALENCE IN 2D Stabilizers of color code mapped to new stabilizers - either pink or blue. Two decoupled codes = 2 x toric code w/ -vertex and -plaquette stabilizers. shrink blue plaquettes shrink red plaquettes ariv:
14 CODES WITH BOUNDARIES 2 dim toric code w/ boundaries: rough and smooth 2 dim color code w/ boundaries: red, green and blue anyons (excitations) can condense on boundaries! rough smooth 14 ariv:
15 ariv: COLOR CODE UNFOLDED unfold color code toric code local unitaries on green plaquettes two copies are not decoupled along the green boundary 15
16 BOUNDARIES IN 3D (OR A D C smooth Theorem: color code with point-like excitations in d dim with d+1 boundaries is equivalent to d copies of toric code attached along (d-1)-dim boundary. rough U [CC(L)] U = TC(# d i=1l i ) smooth smooth obtained from L by local deformations rough rough smooth smooth L A identified L B identified L C identified 16 ariv:
17 ariv: ANYONS AND CONDENSATION Fact: anyons condensing into a gapped boundary have mutually trivial statistics. Toric code: e - rough, m - smooth. Folded toric = {1,e 1,m 2,e 1 m 2 = {1,e 2,m 1,e 2 m 1 = {1,e 1 e 2,m 1 m 2, 1 2 } rough/smooth smooth/rough fold Correspondence between anyonic excitations in toric code and color code: e 1 R e 2 B m 2 R m m 2 e 17
18 GAUGE COLOR H CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC CODE DECODERS 18
19 PERFORMING COMPUTATION When performing computation, we do not want to spread errors and corrupt encoded information! Transversal gates - tensor product of single-qubit unitaries. U =... U i 1 U i U i+1... Transversal gates do not propagate errors.... U U U U U U... U 19
20 NO-GO RESULTS Dream: transversal universal gate set. Can we have one? Eastin&Knill 09: for any nontrivial local-error-detecting quantum code, the set of transversal, logical unitary operators is not universal. Bravyi&König 13: for a topological stabilizer code in d dim, a constantdepth quantum circuit preserving the codespace implements an encoded gate from the d th level of the Clifford hierarchy. Clifford hierarchy defined recursively. P j = {unitary U UPU 2 P j 1 8P 2 P 1 } Clifford group Pauli group Gates in d th level of Clifford hierarchy R d xi = e 2 ix/2d xi C d 1 x 1,...,x d i =( 1) x 1...x d x 1,...,x d i P3 P2 P1 20
21 SUBSYSTEM COLOR CODES Stabilizer code - specified by a stabilizer group S (Abelian). Stabilizers w/ big weight - difficult to engineer and measure. Subsystem code - specified by a gauge group G (non-abelian). Subsystem color code CCd(x,z): - gauge generators: x-cells - gauge generators: z-cells x,z 2 and x+z d+2 Stabilizer group (center): - stabilizers: (d+2-z)-cells - stabilizers: (d+2-x)-cells 21 ariv:
22 CODE SWITCHING BETWEEN COLOR CODES d-simplex-like lattice w/ boundaries: C = CCd(x,z) and C = CCd(x,z ) are two (subsystem) color codes with 1 logical qubit. G = hx cell,z celli S = h(d +2 z) cell, (d +2 x) celli If x x and z z, then - G G 0 - S S 0 G 1 G logical qubit Switching C C - trivial. Switching C G G 0 Gb G 0 b fix these gauge qubits S 0 S 1 S 2 S a C - fix certain gauge qubits in +1 state. S 22 ariv:
23 UNIVERSAL GATE SET W/ COLOR CODES IN 3D Stabilizer and subsystem color codes in d dim defined by x,z 2 such that x+z d+2. d=4 d-simplex-like lattice - 1 logical qubit. d=3 CNOT - transversal in CSS codes. d=2 R3 - transversal in C = CC3(3,2). H - transversal in C = CC3(2,2) (self-dual). z H R x Can switch between C = CCd(x=2,z=2) and C = CCd(x =3,z =2) since x x and z z - universal gate set in 3D! Circumventing no-go result by Eastin and Knill. 23 ariv:
24 UNIVERSAL GATE SET W/ COLOR CODES, CONTINUED 3D architecture challenging! 2D possible to build (soon)? 2D color code - transversal logical Clifford group. When logical R3 needed, switch to 3D color code - dimensional jump w/ gauge fixing (Bombin 14). Code switching in 3D or dimensional jump - overhead associated with gauge fixing. Alternative approach - flatten 3D gauge color code to become 2D (Bravyi&Cross 15, Jochym-O Connor&Bartlett 15, Jones et al. 15). Issues: - non-locality, - no threshold, - macroscopic stabilizers. 24
25 GAUGE COLOR H CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC CODE DECODERS 25
26 work w/ N. Delfosse DECODING TORIC CODE Toric/color code - conceivable quantum computer architectures. We need to efficiently decode them! CSS codes - can decode and separately (might reduce threshold!). Error happens, e = locations of -errors. Input: s = violated -star stabilizers. Output: e = -errors which might have happened. Success: e and e differ only by stabilizer b (product of -plaquettes). 26
27 work w/ N. Delfosse DECODING TORIC CODE Best strategy: if syndrome s observed, pick the most probable equivalence class of errors consistent with s (errors e ~ e iff differ by stabilizer b). Min weight perfect matching - efficient and almost optimum. Qudit toric code for d 3 - min weight hypergraph matching is in general NP-hard! Other decoders, e.g. RG (Duclois-Cianci&Poulin 10, Bravyi&Haah 11, Anwar et al. 13). 27
28 DECODING COLOR CODE Can we use toric code decoders? Dual lattice L=(V, E, F) - triangulation w/ 3-colorable vertices. qubit stabilizer Goal: error syndrome 2D 0D 1D Delfosse 13: project onto 3 sublattices and use toric code decoder! 28 work w/ N. Delfosse
29 29 work w/ N. Delfosse
30 work w/ N. Delfosse qubit stabilizer 2D 0D 1D 30
31 work w/ N. Delfosse DECODING BY PROJECTION Decoding of color code not harder - can use toric code decoders! Lower bound on threshold pcc of color code decoder, pcc f(ptc). Threshold pcc matches threshold of other decoders - RG and unitary mapping (Bombin et al. 11). Still room for improvement! Idea can be generalized to 3D (or more). 31
32 DECODING IN 3D (OR MORE) Dual lattice L=(V, E, F, C) consists of tetrahedra w/ 4-colorable vertices. Qubits = tetrahedra, stabilizers = vertices/edges. Goal: error syndrome 3D 1D 0D 2D 1D Idea: project onto 6 or 4 sublattices (0D and 1D syndromes, respectively). Use toric code decoder! Beyond perfect matching - finding min area k-chain w/ given boundary, i.e. (k-1)-chain. Efficient for (n-1)-chains in n dim (Sullivan PhD thesis 94). 32 work w/ N. Delfosse
33 CHAIN COMPLE CONSTRUCTION Lattice (tiling of a manifold) L = (V, E, F). 2-vector spaces Ci and boundary operators i C 2 = M f2f 2 f, C 1 = M 2, C 0 = M 2 v 2E v2v Toric code decoding: Chain complex C 2 C 1 C 0 stabilizer b error e syndrome s Correction succeeds iff e+e = 2b, where 1e= 1e =s. Color code decoding - chain complex on L = (V, E, F ). Projection works - morphism of chain complexes! 33 work w/ N. Delfosse
34 GAUGE COLOR H CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC CODE DECODERS 34
35 THRESHOLDS Threshold pth - maximum error rate the code can tolerate. If p < pth - can decode perfectly (for increasing system sizes). effective (logical) error rate physical error rate Relevant for: guiding the experiment (surface code), benchmarking decoders (Brown et al. 15), resource analysis (magic state distillation). Often, evaluated for specific models (depends on the lattice, noise model, decoder, etc.). Stat-mech models can give insight into decoder-independent thresholds. 35
36 DECODING OF TORIC CODE REVISITED Assumption - errors happen independently with probability p, i.e. pr(e) =(1 p) N e p e Success iff e and e differ only by some stabilizer b (product of -plaquettes) - same equivalence class. pr(ē) = b2c 2 pr(e 2 b)=(1 p) N b2c 2 ( Best strategy: if syndrome s observed, pick the most probable equivalence class consistent with s. Dennis et al. 02: connection with a stat-mech model! Perfect decoding (large L): pr(success)! 1 pr(e + h) pr(e) log!1 pr(e) e p 1 p ) e+@ 2b. Then, work w/ F. Brandao, K. Svore 36
37 RANDOM BOND ISING MODEL 2D model, spins on faces, 2-body interactions, couplings: +1 w/ pr = 1-p and -1 w/ pr = p. H e = hi,ji { ij s i s j, e = {(i, j) { ij = 1} Partition function e = exp( H e ({s i })) {s i } = exp( H e+@2 b({s i =1})) = exp( (N 2 e 2 b )) b2c 2 b2c 2 Free energy difference of introducing a domain wall h in the system h = e pr(e)(f e+h F e )= 1 e pr(e) log e+h e work w/ F. Brandao, K. Svore 37
38 DECODING VS. STAT-MECH We want to relate successful decoding to phase transition. e pr(e) log pr(e + h) pr(e) Partition function e = exp( (N b2c 2 vs. 2 e 2 b )) 1 e pr(e) log e+h e Equivalence class of error pr(ē) =(1 p) N p ( 1 p ) e+@ 2b b2c 2 Expressions match if p 1 p =exp( 2 ) work w/ F. Brandao, K. Svore 38
39 THRESHOLD FROM PHASE DIAGRAM Phase diagram - ordered and disordered phases. Parameter space: temperature T and disorder p. Nishimori line p 1 p =exp( 2 ) Perfect decoding = ordered phase. Threshold pth - critical point along Nishimori line. Honecker et al. 00-2D toric code threshold pth =.1094(2) β Ferro Para N Nishimori line p 39 work w/ F. Brandao, K. Svore
40 work w/ F. Brandao, K. Svore 2D COLOR CODE VS. ISING MODEL Model: 3-body random bond Ising model in two dimensions. H = { ijk s i s j s k si { ijk -1 with pr = p sj sk +1 with pr = 1-p Previous work - extensive analysis (measurement errors, different lattices), e.g. Bombin et al. 08, Katzgraber et al. 09, Andrist PhD thesis
41 work w/ F. Brandao, K. Svore 3D COLOR CODE VS. ISING MODEL Color code in 3 dim stabilizer CC: stabilizers on 2-cells (A) and 3-cells (B), subsystem CC: gauge generators on 2-cells, stabilizers on 3-cells (C). Two models to analyze: 4-body random bond Ising model (A), H = { abcd s a s b s c s d local order parameter - easy to analyze! 6-body random bond Ising model (B & C), H = { abcdef s a s b s c s d s e s f challenging due to gauge symmetries (no local order parameter). 41
42 SUMMARY H GAUGE COLOR CODE THRESHOLD self-dual gauge fixing stat-mech CNOT CSS UNIVERSAL GATE SET COLOR CODE PERFORMANCE dim n equivalence perfect matching Rn TORIC CODE DECODERS Thank you! 42
(IN)EQUIVALENCE OF COLOR CODE AND TORIC CODE. Aleksander Kubica, B. Yoshida, F. Pastawski
(IN)EQUIVALENCE OF COLOR CODE AND TORIC CODE Aleksander Kubica, B. Yoshida, F. Pastawski MOTIVATION Topological quantum codes - non-local DOFs, local generators. Toric code: high threshold, experimentally
More informationarxiv: Statistical mechanical models for quantum codes subject to correlated noise
Statistical mechanical models for quantum codes subject to correlated noise Christopher Chubb (EQUS USyd), Steve Flammia (EQUS USyd/YQI Yale) (me@)christopherchubb.com arxiv:1809.10704 Perimeter Institute
More informationhigh thresholds in two dimensions
Fault-tolerant quantum computation - high thresholds in two dimensions Robert Raussendorf, University of British Columbia QEC11, University of Southern California December 5, 2011 Outline Motivation Topological
More informationIntroduction to Topological Error Correction and Computation. James R. Wootton Universität Basel
Introduction to Topological Error Correction and Computation James R. Wootton Universität Basel Overview Part 1: Topological Quantum Computation Abelian and non-abelian anyons Quantum gates with Abelian
More informationFault-tolerant logical gates in quantum error-correcting codes
Fault-tolerant logical gates in quantum error-correcting codes Fernando Pastawski and Beni Yoshida (Caltech) arxiv:1408.1720 Phys Rev A xxxxxxx Jan 2015 @ QIP (Sydney, Australia) Fault-tolerant logical
More informationFrom Majorana Fermions to Topological Order
From Majorana Fermions to Topological Order Arxiv: 1201.3757, to appear in PRL. B.M. Terhal, F. Hassler, D.P. DiVincenzo IQI, RWTH Aachen We are looking for PhD students or postdocs for theoretical research
More informationUniversal Topological Phase of 2D Stabilizer Codes
H. Bombin, G. Duclos-Cianci, D. Poulin arxiv:1103.4606 H. Bombin arxiv:1107.2707 Universal Topological Phase of 2D Stabilizer Codes Héctor Bombín Perimeter Institute collaborators David Poulin Guillaume
More informationUnfolding the color code
PAPER OPEN ACCESS Unfolding the color code To cite this article: Aleksander Kubica et al 0 New J. Phys. 00 Manuscript version: Accepted Manuscript Accepted Manuscript is the version of the article accepted
More informationarxiv: v1 [cond-mat.str-el] 11 Sep 2015
Gapped boundaries, group cohomology and fault-tolerant logical gates NSF-KITP-15-096 Beni Yoshida Walter Burke Institute for Theoretical Physics, California Institute of Technology, Pasadena, California
More information6. Quantum error correcting codes
6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome
More informationarxiv: Statistical mechanical models for quantum codes subject to correlated noise
Statistical mechanical models for quantum codes subject to correlated noise Christopher Chubb (EQUS USyd), Steve Flammia (EQUS USyd/YQI Yale) (me@)christopherchubb.com arxiv:1809.10704 UNM 2018-10 Quantum
More informationarxiv: v1 [quant-ph] 7 Aug 2014
Fault-tolerant logical gates in quantum error-correcting codes arxiv:1408.1720v1 [quant-ph] 7 Aug 2014 Fernando Pastawski 1 and Beni Yoshida 1 1 Institute for Quantum Information and Matter, California
More informationBounds on Quantum codes
Bounds on Quantum codes No go we cannot encode too many logical qubits in too few physical qubits and hope to correct for many errors. Some simple consequences are given by the quantum Hamming bound and
More informationTransversal logical gates
Transversal logical gates SPT phases gapped boundaries eni Yoshida (Perimeter Institute) *SPT = symmetry protected topological Transversal logical gates SPT phases gapped boundaries *SPT = symmetry protected
More informationX row 1 X row 2, X row 2 X row 3, Z col 1 Z col 2, Z col 2 Z col 3,
1 Ph 219c/CS 219c Exercises Due: Thursday 9 March 2017.1 A cleaning lemma for CSS codes In class we proved the cleaning lemma for stabilizer codes, which says the following: For an [[n, k]] stabilizer
More informationTopological quantum computation
School US-Japan seminar 2013/4/4 @Nara Topological quantum computation -from topological order to fault-tolerant quantum computation- The Hakubi Center for Advanced Research, Kyoto University Graduate
More informationADIABATIC PREPARATION OF ENCODED QUANTUM STATES
ADIABATIC PREPARATION OF ENCODED QUANTUM STATES Fernando Pastawski & Beni Yoshida USC Los Angeles, June 11, 2014 QUANTUM NOISE Storing single observable not enough. Decoherence deteriorates quantum observables.
More informationOverview of Topological Cluster-State Quantum Computation on 2D Cluster-State
Overview of Topological Cluster-State Quantum Computation on 2D Cluster-State based on High-threshold universal quantum computation on the surface code -Austin G. Fowler, Ashley M. Stephens, and Peter
More informationQuantum Computing: the Majorana Fermion Solution. By: Ryan Sinclair. Physics 642 4/28/2016
Quantum Computing: the Majorana Fermion Solution By: Ryan Sinclair Physics 642 4/28/2016 Quantum Computation: The Majorana Fermion Solution Since the introduction of the Torpedo Data Computer during World
More informationarxiv: v1 [quant-ph] 1 Nov 2013
An Introduction to Topological Quantum Codes arxiv:1311.0277v1 [quant-ph] 1 Nov 2013 Héctor Bombín Perimeter Institute for Theoretical Physics 31 Caroline St. N., Waterloo, ON, N2L 2Y5, Canada This is
More informationarxiv: v2 [quant-ph] 14 May 2017
A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation Eesa Nikahd, Morteza Saheb Zamani, and Mehdi Sedighi Quantum Design Automation Lab Amirkabir University of Technology, Tehran,
More informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More informationFault-tolerant conversion between the Steane and Reed-Muller quantum codes
Fault-tolerant conversion between the Steane and Reed-Muller quantum codes Jonas T. Anderson, Guillaume Duclos-Cianci, and David Poulin Département de Physique, Université de Sherbrooke, Sherbrooke, Québec,
More informationCriticality in topologically ordered systems: a case study
Criticality in topologically ordered systems: a case study Fiona Burnell Schulz & FJB 16 FJB 17? Phases and phase transitions ~ 194 s: Landau theory (Liquids vs crystals; magnets; etc.) Local order parameter
More informationarxiv: v2 [quant-ph] 18 Aug 2016
Quantum Information and Computation, Vol. 0, No. 0 (2003) 000 000 c Rinton Press NOISE THRESHOLDS FOR THE 4, 2, 2 -CONCATENATED TORIC CODE ariv:1604.04062v2 [quant-ph] 18 Aug 2016 Ben Criger JARA Institute
More informationarxiv: v2 [quant-ph] 5 Oct 2017
Locality-Preserving Logical Operators in Topological Stabiliser Codes Paul Webster and Stephen D. Bartlett Centre for Engineered Quantum Systems, School of Physics, The University of Sydney, Sydney, NSW
More informationQuantum computers still work with 25% of their qubits missing
Quantum computers still work with 25% of their qubits missing Sean Barrett Tom Stace (UQ) Phys. Rev. Lett. 102, 200501(2009) Phys. Rev. A 81, 022317 (2010) Phys. Rev. Lett. 105, 200502 (2010) Outline Loss/leakage
More informationThe ABCs of the color code: A study of topological quantum codes as toy models for fault-tolerant quantum computation and quantum phases of matter
The ABs of the color code: A study of topological quantum codes as toy models for fault-tolerant quantum computation and quantum phases of matter Thesis by Aleksander Marek Kubica In Partial Fulfillment
More informationUniversal phase transitions in Topological lattice models
Universal phase transitions in Topological lattice models F. J. Burnell Collaborators: J. Slingerland S. H. Simon September 2, 2010 Overview Matter: classified by orders Symmetry Breaking (Ferromagnet)
More informationEnergetics and Error Rates of Self-Correcting Quantum Memories
Energetics and Error Rates of Self-Correcting Quantum Memories John Schulman Quantum codes allow for the robust storage of quantum information despite interaction with the environment. In a quantum code,
More informationIntroduction to Quantum Information Technologies. B.M. Terhal, JARA-IQI, RWTH Aachen University & Forschungszentrum Jülich
Introduction to Quantum Information Technologies B.M. Terhal, JARA-IQI, RWTH Aachen University & Forschungszentrum Jülich How long can we store a bit Hieroglyphs carved in sandstone at the Luxor Temple
More informationsparse codes from quantum circuits
sparse codes from quantum circuits arxiv:1411.3334 Dave Bacon Steve Flammia Aram Harrow Jonathan Shi Coogee 23 Jan 2015 QECC [n,k,d] code: encode k logical qubits in n physical qubits and correct errors
More informationarxiv: v1 [quant-ph] 22 Jun 2016
Generalized surface codes and packing of logical qubits Nicolas Delfosse 1,2 Pavithran Iyer 3 and David Poulin 3 June 24, 2016 arxiv:1606.07116v1 [quant-ph] 22 Jun 2016 Abstract We consider a notion of
More informationDoubled Color Codes. arxiv: v1 [quant-ph] 10 Sep 2015
Doubled Color Codes Sergey Bravyi Andrew Cross arxiv:1509.03239v1 [quant-ph] 10 Sep 2015 Abstract We show how to perform a fault-tolerant universal quantum computation in 2D architectures using only transversal
More informationarxiv: v3 [quant-ph] 21 Feb 2013
Surface code quantum computing by lattice surgery arxiv:1111.4022v3 [quant-ph] 21 Feb 2013 Clare Horsman 1, Austin G. Fowler 2, Simon Devitt 3 and Rodney Van Meter 4 1 Keio University Shonan Fujisawa Campus,
More informationarxiv: v1 [cond-mat.str-el] 7 Aug 2011
Topological Geometric Entanglement of Blocks Román Orús 1, 2 and Tzu-Chieh Wei 3, 4 1 School of Mathematics and Physics, The University of Queensland, QLD 4072, Australia 2 Max-Planck-Institut für Quantenoptik,
More informationKitaev honeycomb lattice model: from A to B and beyond
Kitaev honeycomb lattice model: from A to B and beyond Jiri Vala Department of Mathematical Physics National University of Ireland at Maynooth Postdoc: PhD students: Collaborators: Graham Kells Ahmet Bolukbasi
More informationarxiv:quant-ph/ v4 4 Jul 2005
Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories Dave Bacon Department of Computer Science & Engineering, University of Washington, Seattle, WA 98195 (Dated: June 6, 2005)
More informationarxiv: v2 [quant-ph] 19 Sep 2016
LOCAL DECODERS FOR THE 2D AND 4D TORIC CODE Nikolas P. Breuckmann JARA Institute for Quantum Information, RWTH Aachen, Otto-Blumenthal-Straße 20 Aachen, Nordrhein-Westfalen, 52074 Germany Kasper Duivenvoorden
More informationFault-Tolerant Universality from Fault-Tolerant Stabilizer Operations and Noisy Ancillas
Fault-Tolerant Universality from Fault-Tolerant Stabilizer Operations and Noisy Ancillas Ben W. Reichardt UC Berkeley NSF, ARO [quant-ph/0411036] stabilizer operations, Q: Do form a universal set? prepare
More informationLectures on Fault-Tolerant Quantum Computation
Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface
More informationPh/CS 219b. Exercises Due: Thursday 22 February 2018
Ph/CS 219b 3.1 Bound on D-dimensional codes Exercises Due: Thursday 22 February 2018 In class we proved a bound on [[n, k, d]] for local stabilizer codes in 2 dimensions: kd 2 = O(n), where k is the number
More informationQuantum Algorithms Lecture #3. Stephen Jordan
Quantum Algorithms Lecture #3 Stephen Jordan Summary of Lecture 1 Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More informationarxiv: v2 [quant-ph] 3 Nov 2017
Fault-tolerant fermionic quantum computation based on color code arxiv:1709.0645v [quant-ph] 3 Nov 017 Ying Li 1, 1 Graduate School of China Academy of Engineering Physics, Beijing 100193, China Department
More informationFault-tolerant quantum computing with color codes Andrew J. Landahl with Jonas T. Anderson and Patrick R. Rice. arxiv:
'!" '!"!!!* % $!!!* "#$%!"#$#%&'()*+,&-.&"#/-0#.$)(&'#%-1#.&& & 2-$"&+3+.&)4#5.$&2"-$+&%')*+&!! &7+$2++.&'"#$#%&).,&"+),+/& "#$% &!&!!!%!$ % $ &+!! ) '!# )!+' ( %+!&!" (!& *+!" )+!% (+!$!* % $!!!%!$
More informationJohn Preskill, Caltech 14 January The cost of quantum fault tolerance
John Preskill, Caltech 14 January 2005 http://www.iqi.caltech.edu/ The cost of quantum fault tolerance t Quantum Error Correction Shor 95 Steane 95 Quantum information can be protected, and processed fault-tolerantly.
More informationarxiv: v1 [quant-ph] 5 Oct 2017
Dual correspondence between classical spin models and quantum CSS states Mohammad Hossein Zarei, and Afshin Montakhab, Physics Department, College of Sciences, Shiraz University, Shiraz 7454, Iran arxiv:70.090v
More informationQuantum Subsystem Codes Their Theory and Use
Quantum Subsystem Codes Their Theory and Use Nikolas P. Breuckmann - September 26, 2011 Bachelor thesis under supervision of Prof. Dr. B. M. Terhal Fakultät für Mathematik, Informatik und Naturwissenschaften
More informationQuantum Computing with Very Noisy Gates
Quantum Computing with Very Noisy Gates Produced with pdflatex and xfig Fault-tolerance thresholds in theory and practice. Available techniques for fault tolerance. A scheme based on the [[4, 2, 2]] code.
More informationSurface Code Threshold in the Presence of Correlated Errors
Surface Code Threshold in the Presence of Correlated Errors USP-São Carlos - 2013 E. Novais, P. Jouzdani, and E. Mucciolo CCNH Universidade Federal do ABC Department of Physics University of Central Florida
More informationQuantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute The Classical and Quantum Worlds Quantum Errors A general quantum error is a superoperator: ρ ΣA k ρ A k (Σ A k A k = I)
More informationM. Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/ , Folie 127
M Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/2008 2008-01-11, Folie 127 M Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/2008 2008-01-11,
More informationTopological quantum memory a
JOURNAL OF MATHEMATICAL PHYSICS VOLUME 43, NUMBER 9 SEPTEMBER 2002 Topological quantum memory a Eric Dennis b) Princeton University, Princeton, New Jersey 08544 Alexei Kitaev, c) Andrew Landahl, d) and
More informationTopological order from quantum loops and nets
Topological order from quantum loops and nets Paul Fendley It has proved to be quite tricky to T -invariant spin models whose quasiparticles are non-abelian anyons. 1 Here I ll describe the simplest (so
More informationMagic States. Presented by Nathan Babcock
Magic States Presented by Nathan Babcock Overview I will discuss the following points:. Quantum Error Correction. The Stabilizer Formalism. Clifford Group Quantum Computation 4. Magic States 5. Derivation
More informationarxiv: v3 [quant-ph] 23 Jun 2011
Feasibility of self-correcting quantum memory and thermal stability of topological order Beni Yoshida Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139,
More informationQuantum Fields, Gravity, and Complexity. Brian Swingle UMD WIP w/ Isaac Kim, IBM
Quantum Fields, Gravity, and Complexity Brian Swingle UMD WIP w/ Isaac Kim, IBM Influence of quantum information Easy Hard (at present) Easy Hard (at present)!! QI-inspired classical, e.g. tensor networks
More informationLimitations on transversal gates
Limitations on transversal gates Michael Newman 1 and Yaoyun Shi 1,2 University of Michigan 1, Alibaba Group 2 February 6, 2018 Quantum fault-tolerance Quantum fault-tolerance Quantum fault-tolerance Quantum
More informationarxiv: v1 [quant-ph] 22 Oct 2018
2D quantum computation with 3D topological codes Héctor Bombín PsiQuantum, Palo Alto I present a fault-tolerant quantum computing method for 2D architectures that is particularly appealing for photonic
More informationProtected gates for topological quantum field theories
JOURNAL OF MATHEMATICAL PHYSICS 57, 022201 (2016) Protected gates for topological quantum field theories Michael E. Beverland, 1 Oliver Buerschaper, 2 Robert Koenig, 3 Fernando Pastawski, 1 John Preskill,
More informationIntoduction to topological order and topologial quantum computation. Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009
Intoduction to topological order and topologial quantum computation Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009 Outline 1. Introduction: phase transitions and order. 2. The Landau symmetry
More informationTopological order of a two-dimensional toric code
University of Ljubljana Faculty of Mathematics and Physics Seminar I a, 1st year, 2nd cycle Topological order of a two-dimensional toric code Author: Lenart Zadnik Advisor: Doc. Dr. Marko Žnidarič June
More informationThis is a repository copy of Qudit color codes and gauge color codes in all spatial dimensions.
This is a repository copy of Qudit color codes and gauge color codes in all spatial dimensions. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/94725/ Version: Accepted Version
More informationA Study of Topological Quantum Error Correcting Codes Part I: From Classical to Quantum ECCs
A Study of Topological Quantum Error Correcting Codes Part I: From Classical to Quantum ECCs Preetum Nairan preetum@bereley.edu Mar 3, 05 Abstract This survey aims to highlight some interesting ideas in
More informationClassification of Symmetry Protected Topological Phases in Interacting Systems
Classification of Symmetry Protected Topological Phases in Interacting Systems Zhengcheng Gu (PI) Collaborators: Prof. Xiao-Gang ang Wen (PI/ PI/MIT) Prof. M. Levin (U. of Chicago) Dr. Xie Chen(UC Berkeley)
More informationRealizing non-abelian statistics in quantum loop models
Realizing non-abelian statistics in quantum loop models Paul Fendley Experimental and theoretical successes have made us take a close look at quantum physics in two spatial dimensions. We have now found
More informationAnyons and topological quantum computing
Anyons and topological quantum computing Statistical Physics PhD Course Quantum statistical physics and Field theory 05/10/2012 Plan of the seminar Why anyons? Anyons: definitions fusion rules, F and R
More informationA Superconducting Quantum Simulator for Topological Order and the Toric Code. Michael J. Hartmann Heriot-Watt University, Edinburgh qlightcrete 2016
A Superconducting Quantum Simulator for Topological Order and the Toric Code Michael J. Hartmann Heriot-Watt University, Edinburgh qlightcrete 2016 Topological Order (in 2D) A 2-dimensional physical system
More informationMeasurement-based quantum error correction
Measurement-based quantum error correction Janna Hinchliff University of Bristol, Quantum Engineering Centre for Doctoral Training Introduction Measurement-based (or one-way) quantum error correction (MBQEC)
More informationarxiv: v2 [quant-ph] 8 Aug 2017
Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage ariv:1703.00590v2 [quant-ph] 8 Aug 2017 1. Introduction Nikolas P. Breuckmann 1, Christophe Vuillot 1, Earl Campbell 2, Anirudh Krishna
More informationMatrix Product Operators: Algebras and Applications
Matrix Product Operators: Algebras and Applications Frank Verstraete Ghent University and University of Vienna Nick Bultinck, Jutho Haegeman, Michael Marien Burak Sahinoglu, Dominic Williamson Ignacio
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationThe Classification of Clifford Gates over Qubits
The Classification of Clifford Gates over Qubits Daniel Grier, Luke Schaeffer MIT Introduction Section 1 Introduction Classification Introduction Idea Study universality by finding non-universal gate sets.
More informationarxiv: v5 [quant-ph] 28 Jan 2015
Long-distance quantum communication over noisy networks without long-time quantum memory Paweł Mazurek 1, Andrzej Grudka 2, Michał Horodecki 1, Paweł Horodecki 3, Justyna Łodyga 2, Łukasz Pankowski 1 and
More informationQuantum Error-Correcting Codes by Concatenation
Second International Conference on Quantum Error Correction University of Southern California, Los Angeles, USA December 5 9, 2011 Quantum Error-Correcting Codes by Concatenation Markus Grassl joint work
More informationTopological quantum error correction and quantum algorithm simulations
Topological quantum error correction and quantum algorithm simulations David Wang Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy August 2011 School of Physics The
More informationarxiv: v2 [cond-mat.str-el] 20 Apr 2015
Gauging time reversal symmetry in tensor network states ie Chen, 2 and Ashvin Vishwanath 2 Department of Physics and Institute for Quantum Information and Matter, California Institute of echnology, Pasadena,
More information3 Symmetry Protected Topological Phase
Physics 3b Lecture 16 Caltech, 05/30/18 3 Symmetry Protected Topological Phase 3.1 Breakdown of noninteracting SPT phases with interaction Building on our previous discussion of the Majorana chain and
More informationNMR quantum information processing
NMR quantum information processing Dawei Lu 1, Aharon Brodutch 1, Jihyun Park 1, Hemant Katiyar 1, Tomas Jochym-O'Connor 1 1, 2, 3, and Raymond Laflamme 1 Institute for Quantum Computing and Department
More informationConstructions and Noise Threshold of Hyperbolic Surface Codes
1 Constructions and Noise Threshold of Hyperbolic Surface Codes Nikolas P. Breuckmann and Barbara M. Terhal arxiv:1506.04029v2 [quant-ph] 24 Aug 2016 Abstract We show how to obtain concrete constructions
More informationCSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes
CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes Dave Bacon Department of Computer Science & Engineering, University of Washington In the last lecture we learned of the quantum error
More informationarxiv: v2 [quant-ph] 25 Apr 2017
FIBRE BUNDLE FRAMEWORK FOR UNITARY QUANTUM FAULT TOLERANCE DANIEL GOTTESMAN AND LUCY LIUXUAN ZHANG arxiv:1309.7062v2 [quant-ph] 25 Apr 2017 Abstract. We introduce a differential geometric framework for
More informationTopological invariants for 1-dimensional superconductors
Topological invariants for 1-dimensional superconductors Eddy Ardonne Jan Budich 1306.4459 1308.soon SPORE 13 2013-07-31 Intro: Transverse field Ising model H TFI = L 1 i=0 hσ z i + σ x i σ x i+1 σ s:
More informationLogical error rate in the Pauli twirling approximation
Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)
More informationQuantum error correction for continuously detected errors
Quantum error correction for continuously detected errors Charlene Ahn, Toyon Research Corporation Howard Wiseman, Griffith University Gerard Milburn, University of Queensland Quantum Information and Quantum
More informationQEC in 2017: Past, present, and future
QEC in 2017: Past, present, and future topological quantum code holographic quantum code John Preskill QEC 2017 15 Sep. 2017 Ken Jake Unruh, Physical Review A, Submitted June 1994 The thermal time scale
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationarxiv: v1 [quant-ph] 22 Oct 2018
Transversal gates and error propagation in 3D topological codes Héctor Bombín PsiQuantum, Palo Alto I study the interplay of errors with transversal gates in 3D color codes, and introduce some new such
More informationTechniques for fault-tolerant quantum error correction
Techniques for fault-tolerant quantum error correction Ben Reichardt UC Berkeley Quantum fault-tolerance problem C 0/1 Fault-tolerant, larger High tolerable noise Low overhead 1 Encoding for fault tolerance
More informationDefects in topologically ordered states. Xiao-Liang Qi Stanford University Mag Lab, Tallahassee, 01/09/2014
Defects in topologically ordered states Xiao-Liang Qi Stanford University Mag Lab, Tallahassee, 01/09/2014 References Maissam Barkeshli & XLQ, PRX, 2, 031013 (2012) Maissam Barkeshli, Chaoming Jian, XLQ,
More informationNon-abelian statistics
Non-abelian statistics Paul Fendley Non-abelian statistics are just plain interesting. They probably occur in the ν = 5/2 FQHE, and people are constructing time-reversal-invariant models which realize
More informationLocal stabilizer codes in three dimensions without string logical operators
Local stabilizer codes in three dimensions without string logical operators Jeongwan Haah Institute for Quantum Information, California Institute of Technology, Pasadena, CA 91125, USA (Dated: 28 February
More informationSymmetry protected topological phases in quantum spin systems
10sor network workshop @Kashiwanoha Future Center May 14 (Thu.), 2015 Symmetry protected topological phases in quantum spin systems NIMS U. Tokyo Shintaro Takayoshi Collaboration with A. Tanaka (NIMS)
More informationCharacterizing Quantum Supremacy in Near-Term Devices
Characterizing Quantum Supremacy in Near-Term Devices S. Boixo S. Isakov, V. Smelyanskiy, R. Babbush, M. Smelyanskiy, N. Ding, Z. Jiang, M. J. Bremner, J. Martinis, H. Neven Google January 19th Beyond-classical
More informationAfter first studying an example of a topological phase and its underlying structures, we study effective field theories for 2D topological phases.
1 Boulder notes by Victor V Albert I CHETAN NAYAK After first studying an example of a topological phase and its underlying structures, we study effective field theories for D topological phases I1 Example
More informationKai Sun. University of Michigan, Ann Arbor. Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC)
Kai Sun University of Michigan, Ann Arbor Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC) Outline How to construct a discretized Chern-Simons gauge theory A necessary and sufficient condition for
More informationJiannis K. Pachos. Introduction. Berlin, September 2013
Jiannis K. Pachos Introduction Berlin, September 203 Introduction Quantum Computation is the quest for:» neat quantum evolutions» new quantum algorithms Why? 2D Topological Quantum Systems: How? ) Continuum
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationMany-body entanglement witness
Many-body entanglement witness Jeongwan Haah, MIT 21 January 2015 Coogee, Australia arxiv:1407.2926 Quiz Energy Entanglement Charge Invariant Momentum Total spin Rest Mass Complexity Class Many-body Entanglement
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More information