Topological Qubit Design and Leakage
|
|
- Milo Leonard
- 5 years ago
- Views:
Transcription
1 Topological Qubit Design and National University of Ireland, Maynooth September 8, 2011 Topological Qubit Design and
2 T.Q.C. Braid Group Overview Designing topological qubits, the braid group, leakage errors. Designing the optimal qubit/qudit. Possible leakage-free two-qubit gates. Summary, future work. Topological Qubit Design and : New Journal of Physics New J. Phys ArXiv - arxiv: v1 Topological Qubit Design and
3 T.Q.C. Braid Group Topological Quantum Computation 1 Collection of anyons. a a a a a a 1 N.E. Bonesteel, L. Hormozi, G. Zikos, and S.H. Simon. Braid topologies for quantum computation. Phys. Rev. Letters., 95(140503), Topological Qubit Design and
4 T.Q.C. Braid Group Topological Quantum Computation 1 Collection of anyons. Hilbert space is fusion space of anyons no tensor product structure. a a a a a a b a a a a a a c b c d d e e 1 f N.E. Bonesteel, L. Hormozi, G. Zikos, and S.H. Simon. Braid topologies for f quantum computation. Phys. Rev. Letters., 95(140503), Topological Qubit Design and
5 T.Q.C. Braid Group Topological Quantum Computation 1 Collection of anyons. Hilbert space is fusion space of anyons no tensor product structure. Associate qubits with small groups of anyons. Computational space is the tensor product of qubit spaces. a a a a a a a a a a a a b 1 b 2 c 1 c 2 b1 c c 1 2 d b2 1 N.E. Bonesteel, L. Hormozi, G. Zikos, and S.H. Simon. Braid topologies for quantum computation. Phys. Rev. Letters., 95(140503), Topological Qubit Design and
6 T.Q.C. Braid Group Example: 3-anyon qubit composed of Fibonacci anyons, γ i. Fibonacci anyon fusion rules: = 1 2 γ 1 = γ 3 γ γ = 1 γ Set overall charge to be γ: (( ) ) γ. γ 1 and γ 2 can fuse to 1 or γ: 0 L = (( ) 1 ) γ 1 L = (( ) γ ) γ But could have: N.C. = (( ) γ ) 1. Topological Qubit Design and
7 T.Q.C. Braid Group Braiding only changes the topological charge at the point where the braiding takes place. a a a a b c d a a a a b z d Topological Qubit Design and
8 T.Q.C. Braid Group Braiding only changes the topological charge at the point where the braiding takes place. a a a a b c d a a a a b z d Two qubit gate: Only braiding between the qubits can change overall charge of qubits. γ 1/γ 1/ γ γ γ 1/ γ γ 1/γ Topological Qubit Design and
9 T.Q.C. Braid Group The Braid Group, B n Describes all possible braids on n particles. Generators: τ i - swaps particle i with particle i + 1 Relations: τ i τ j = τ j τ i [if i j 2] (1) τ i τ i+1 τ i = τ i+1 τ i τ i+1 (2) Generators of the braid group are conjugate to each other. (1) (2) T i m e T i m e Topological Qubit Design and
10 T.Q.C. Braid Group Conjugacy of Braid Generators Start with τ 1 τ 1 Topological Qubit Design and
11 T.Q.C. Braid Group Conjugacy of Braid Generators τ 2 Start with τ 1 Conjugate by T = (τ 2 τ 3 τ 1 τ 2 ) τ 3 τ 1 τ 2 τ 1-1 τ 2-1 τ 1-1 τ 3-1 τ 2 Topological Qubit Design and
12 T.Q.C. Braid Group Conjugacy of Braid Generators τ 2 τ 3 τ 1 τ 2 Start with τ 1 Conjugate by τ 1 T = (τ 2 τ 3 τ 1 τ 2 ) T τ 1 T 1-1 = τ 3 τ 2-1 τ 1 τ 3-1 τ 3-1 τ 2 Topological Qubit Design and
13 Max Number of Anyons Qudits Optimal Qubit If it is experimentally hard to manipulate many anyons: The less anyons we need the better. 2 Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang. The two-eigenvalue problem and density of Jones representation of braid groups. Commun. Math. Phys., 228:177199, Topological Qubit Design and
14 Max Number of Anyons Qudits Optimal Qubit If it is experimentally hard to manipulate many anyons: The less anyons we need the better. Two-anyon qubit not universal 2 Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang. The two-eigenvalue problem and density of Jones representation of braid groups. Commun. Math. Phys., 228:177199, Topological Qubit Design and
15 Max Number of Anyons Qudits Optimal Qubit If it is experimentally hard to manipulate many anyons: The less anyons we need the better. Two-anyon qubit not universal Three-anyon qubit can be universal 2 2 Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang. The two-eigenvalue problem and density of Jones representation of braid groups. Commun. Math. Phys., 228:177199, Topological Qubit Design and
16 Max Number of Anyons Qudits Optimal Qubit If it is experimentally hard to manipulate many anyons: The less anyons we need the better. Two-anyon qubit not universal Three-anyon qubit can be universal 2 Four-anyon qubit can be universal, trivial topological charge 2 Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang. The two-eigenvalue problem and density of Jones representation of braid groups. Commun. Math. Phys., 228:177199, Topological Qubit Design and
17 Max Number of Anyons Qudits Optimal Qubit If it is experimentally easy to manipulate many anyons: More anyons per qubit means less reliance on two-qubit gates. Possible to avoid leakage. Q: What is the highest number of anyons a qubit can contain. Topological Qubit Design and
18 Max Number of Anyons Qudits Qubits as Braid Group Representations Obtain a representation of B n, n = number of anyons in qubit. Hilbert space of a qubit is two dimensional. Logic operations on qubits are unitary. Represent the braid generators as matrices in U(2). Divide representation by determinant SU(2). Topological Qubit Design and
19 Max Number of Anyons Qudits Representation of Qubit Abelian vs. non-abelian: Abelian Group Representation is the sum of 1 dimensional representations non-universal. Non-Abelian Group Representation is not reducible into 1 dimensional representations can be universal. Find largest n for which 2-d representations of B n can be non-abelian. Topological Qubit Design and
20 Max Number of Anyons Qudits Maximum Number of Anyons By relation (1), all τ odd can be simultaneously diagonalised. By relation (2), if two neighbouring generators commute they are equal. Topological Qubit Design and
21 Max Number of Anyons Qudits Maximum Number of Anyons By relation (1), all τ odd can be simultaneously diagonalised. By relation (2), if two neighbouring generators commute they are equal. Consider n = 5: 4 generators: τ 1, τ 3 are diagonal. τ 4 commutes with τ 1 τ 4 is diagonal (unless τ 1 is a multiple of I). τ 4 now commutes with τ 3 neighbours commute Abelian. Not true for n < 5. Topological Qubit Design and
22 Max Number of Anyons Qudits Maximum Number of Anyons For Qubits We must have n < 5. If n 5: Uninteresting 1-qubit braiding. OR Universality but with leakage. OR Higher dimensional computational space. Topological Qubit Design and
23 Max Number of Anyons Qudits Maximal Number of Anyons for Qudits, d > 2 For d = 2, have shown n < 5. Would like to find similar result for d > 2. Won t explicitly use the braid group, only arguments which apply to any exchange group. Topological Qubit Design and
24 Max Number of Anyons Qudits Maximal Number of Anyons for Qudits, d > 2 For d = 2, have shown n < 5. Would like to find similar result for d > 2. Won t explicitly use the braid group, only arguments which apply to any exchange group. Topological Qubit Design and
25 Max Number of Anyons Qudits Maximal Number of Anyons for Qudits, d > 2 Assumed Properties: 1 Generators which don t involve the same object commute. 2 The group is represented unitarily. 3 Generators are conjugate to each other, also any adjacent pair is conjugate to any other adjacent pair. Topological Qubit Design and
26 Max Number of Anyons Qudits Upper Limit on n Consider: d-dimensional representation, χ, of some exchange group on n excitations. Choose basis: σ odd are simultaneously diagonalisable. For n 5 no two σ odd can be equal: Take n = 5 and let σ 1 = σ 3. σ 4 and σ 1 commute (physically separated). σ 3 = σ 1 σ 4 and σ 3 commute Abelian. Topological Qubit Design and
27 Max Number of Anyons Qudits Upper Limit on n Consider: d-dimensional representation, χ, of some exchange group on n excitations. Choose basis: σ odd are simultaneously diagonalisable. For n 5 no two σ odd can be equal: Take n = 5 and let σ 1 = σ 3. σ 4 and σ 1 commute (physically separated). σ 3 = σ 1 σ 4 and σ 3 commute Abelian. Each σ odd must have a different arrangement of the eigenvalues. Upper limit on n is 2d! + 1 Topological Qubit Design and
28 Max Number of Anyons Qudits Actually... Upper limit on n is actually much lower: 1 All σ even must commute with each other. Topological Qubit Design and
29 Max Number of Anyons Qudits Actually... Upper limit on n is actually much lower: 1 All σ even must commute with each other. 2 Each σ i must commute with all σ j where j i ± 1. Topological Qubit Design and
30 Max Number of Anyons Qudits Actually... Upper limit on n is actually much lower: 1 All σ even must commute with each other. 2 Each σ i must commute with all σ j where j i ± 1. 3 If n 5 and 2 σ odd have same form Abelian, e.g.: σ 3 has eigenvalue arrangement (α, α, β, γ, β). σ 5 has eigenvalue arrangement (β, β, α, γ, α). σ 2 is of some form that commutes with σ 5. Therefore σ 2 commutes with σ 3 Abelian. Topological Qubit Design and
31 Max Number of Anyons Qudits Results N(d): Largest n for which the representation of the exchange group(dimension d) is non-abelian. Formanek 5 Result For the braid group B n : N(d) = d + 2 We have replicated this result for general exchange group for d = 2, 3. No complete proof yet for arbitrary d. 5 E. Formanek. Braid group representations of low degree. London Math. Soc., 2(s3-73):279322, Topological Qubit Design and
32 Max Number of Anyons Qudits Results But... Have shown upper limit of n exists for any exchange group. This upper limit depends strongly on the number and multiplicity of eigenvalues of the generators. The maximum number of anyons per qudit is related to the number of topological charges of the chosen anyon model. Topological Qubit Design and
33 Two-Qudit Gates Two-Qubit Gates Outro in Two-Qudit Gates Possible to avoid leakage in single qubit gates. Two-qudit gates topological charge of qudits can be changed. Is it possible to completely avoid leakage? Topological Qubit Design and
34 Two-Qudit Gates Two-Qubit Gates Outro in Two-Qudit Gates Possible to avoid leakage in single qubit gates. Two-qudit gates topological charge of qudits can be changed. Is it possible to completely avoid leakage? 1 Have system of n anyons, n 1 in qubit 1 and n 2 in qubits 2; n = n 1 + n 2. 2 We know ρ 1/2 ; representations of B n1/2 of dimension d 1/2. We want to find ρ, a representation of B n of dimension d. 3 -free braiding H = H 1 H 2 and d = d 1 d 2. Topological Qubit Design and
35 Two-Qudit Gates Two-Qubit Gates Outro in Two-Qudit Gates Find a representation ρ such that: Braids that braid within first qubit: ρ(τ i ) = ρ 1 (τ i ) I d2. Braids that braid within second qubit: ρ(τ i ) = I d1 ρ 2 (τ i ). Use braid relations to obtain form of braid which swaps anyons between qubits, τ q1,q 2. If a matrix exists to represent τ q1,q 2 -free braiding. Topological Qubit Design and
36 Two-Qudit Gates Two-Qubit Gates Outro Three-Anyon Qubits ρ 1 and ρ 2 are 2-dimensional representations of B 3. ρ(τ 1/2 ) = ρ 1 (τ 1/2 ) I 2 ρ(τ 4/5 ) = I 2 ρ 2 (τ 1/2 ) ρ(τ 3 ) exchanges anyons between qubits. Topological Qubit Design and
37 Two-Qudit Gates Two-Qubit Gates Outro Three-Anyon Qubits τ 3 can be represented by matrix provided eigenvalues are 8 th roots of unity. -free two-qubit braiding! All braids are leakage free. Topological Qubit Design and
38 Two-Qudit Gates Two-Qubit Gates Outro Three-Anyon Qubits τ 3 can be represented by matrix provided eigenvalues are 8 th roots of unity. -free two-qubit braiding! All braids are leakage free. Problem: These eigenvalues correspond to representations of Ising-like anyon models non-universal. -free but non-universal two-qubit braiding. Topological Qubit Design and
39 Two-Qudit Gates Two-Qubit Gates Outro Other Types of Qubits 2 4-anyon qubits: 4-dimensional representation of B 8. 3-anyon qubit & 4-anyons qubit: 4-dimensional representation of B 7. Topological Qubit Design and
40 Two-Qudit Gates Two-Qubit Gates Outro Other Types of Qubits 2 4-anyon qubits: 4-dimensional representation of B 8. 3-anyon qubit & 4-anyons qubit: 4-dimensional representation of B 7. But: d n = 6, = 5. Non-Abelian representations of these gates will not exist. Also no leakage-free, non-abelian two-qutrit/qutrit-qubit gates. Topological Qubit Design and
41 Two-Qudit Gates Two-Qubit Gates Outro Summary Optimal qubit: Should be composed of 3 or 4 anyons. Optimal qudit: For braiding: Should be composed of d + 2 anyons. In general: Number of anyons relates to number of topological charges in model -free 2-qudit gates: Not possible without sacrificing universality. Topological Qubit Design and
42 Two-Qudit Gates Two-Qubit Gates Outro Future Work Find a solution to the problem of how many anyons a qudit can contain in general. Examine possibilities of leakage-free subgroups. Need only one two-qubit entangling braid to be leakage-free full universal quantum computation. Topological Qubit Design and
Quantum Computing with Non-Abelian Quasiparticles
International Journal of Modern Physics B c World Scientific Publishing Company Quantum Computing with Non-Abelian Quasiparticles N. E. Bonesteel, L. Hormozi, and G. Zikos Department of Physics and NHMFL,
More informationTopological Quantum Computation
Texas A&M University October 2010 Outline 1 Gates, Circuits and Universality Examples and Efficiency 2 A Universal 3 The State Space Gates, Circuits and Universality Examples and Efficiency Fix d Z Definition
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 informationTopological Quantum Computation. Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015
Topological Quantum Computation Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015 Classical Physics Turing Model Quantum Mechanics Quantum Computing Quantum Field Theory??? String
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 informationTopological quantum computation and quantum logic
Topological quantum computation and quantum logic Zhenghan Wang Microsoft Station Q UC Santa Barbara Microsoft Project Q: Search for non-abelian anyons in topological phases of matter, and build a topological
More informationBraid Groups, Hecke Algebras, Representations, and Anyons
Braid Groups, Hecke Algebras, Representations, and Anyons Andreas Blass University of Michigan Ann Arbor, MI 4809 ablass@umich.edu Joint work with Yuri Gurevich 9 November, 206 Anyons Anyons are particle-like
More informationDefects between Gapped Boundaries in (2 + 1)D Topological Phases of Matter
Defects between Gapped Boundaries in (2 + 1)D Topological Phases of Matter Iris Cong, Meng Cheng, Zhenghan Wang cong@g.harvard.edu Department of Physics Harvard University, Cambridge, MA January 13th,
More informationAnyonic Quantum Computing
Anyonic Quantum Computing 1. TQFTs as effective theories of anyons 2. Anyonic models of quantum computing (anyon=particle=quasi-particle) Topological quantum computation: 1984 Jones discovered his knot
More informationTopological Quantum Computation, Yang-Baxter Operators and. Operators and Modular Categories
Topological Quantum Computation, Yang-Baxter Operators and Modular Categories March 2013, Cordoba, Argentina Supported by USA NSF grant DMS1108725 Joint work with C. Galindo, P. Bruillard, R. Ng, S.-M.
More informationarxiv:quant-ph/ v1 13 Oct 2006
Topological Quantum Compiling L. Hormozi, G. Zikos, N. E. Bonesteel Department of Physics and National High Magnetic Field Laboratory, Florida State University, Tallahassee, Florida 32310 S. H. Simon Bell
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 informationQuantum Gates and Quantum Circuits of Stock Portfolio
Quantum Gates and Quantum Circuits of Stock Portfolio Ovidiu Racorean Financial Research department, Ministry of Public Finance, State Treasury, Bucharest, Romania Abstract In quantum computation, series
More informationTopological quantum computation with anyons
p. 1/6 Topological quantum computation with anyons Éric Oliver Paquette (Oxford) p. 2/6 Outline: 0. Quantum computation 1. Anyons 2. Modular tensor categories in a nutshell 3. Topological quantum computation
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 informationTopological quantum compiling
Topological quantum compiling L. Hormozi, G. Zikos, and N. E. Bonesteel Department of Physics and National High Magnetic Field Laboratory, Florida State University, Tallahassee, Florida 32310, USA S. H.
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 computation in topological Hilbertspaces. A presentation on topological quantum computing by Deniz Bozyigit and Martin Claassen
Quantum computation in topological Hilbertspaces A presentation on topological quantum computing by Deniz Bozyigit and Martin Claassen Introduction In two words what is it about? Pushing around fractionally
More informationTopological Quantum Computation from non-abelian anyons
Topological Quantum Computation from non-abelian anyons 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 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 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 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 informationZhenghan Wang Microsoft Station Q Santa Barbara, CA
Zhenghan Wang Microsoft Station Q Santa Barbara, CA Quantum Information Science: 4. A Counterexample to Additivity of Minimum Output Entropy (Hastings, 2009) ---Storage, processing and communicating information
More informationTopological Quantum Computation
. Introduction to Topological Quantum Computation Jiannis K. Pachos School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT, UK E-mail: j.k.pachos@leeds.ac.uk Copyright (C) 2010: Permission
More informationTopological quantum computation
NUI MAYNOOTH Topological quantum computation Jiri Vala Department of Mathematical Physics National University of Ireland at Maynooth Tutorial Presentation, Symposium on Quantum Technologies, University
More informationarxiv: v2 [quant-ph] 1 Nov 2017
Universal Quantum Computation with Gapped Boundaries Iris Cong, 1, 2, 3 Meng Cheng, 4, 3 and Zhenghan Wang 3, 5 1 Department of Computer Science, University of California, Los Angeles, CA 90095, U.S.A.
More informationIntroduction to Topological Quantum Computation
Introduction to Topological Quantum Computation Combining physics, mathematics and computer science, topological quantum computation is a rapidly expanding research area focused on the exploration of quantum
More informationComputation in a Topological Quantum Field Theory
Computation in a Topological Quantum Field Theory Daniel Epelbaum and Raeez Lorgat December 2015 Abstract This report investigates the computational power of the particle excitations of topological phases
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 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 informationUniversality of single quantum gates
Universality of single quantum gates Bela Bauer 1, Claire Levaillant 2, Michael Freedman 1 arxiv:1404.7822v3 [math.gr] 20 May 2014 1 Station Q, Microsoft Research, Santa Barbara, CA 93106-6105, USA 2 Department
More informationProblem Set # 6 Solutions
Id: hw.tex,v 1.4 009/0/09 04:31:40 ike Exp 1 MIT.111/8.411/6.898/18.435 Quantum Information Science I Fall, 010 Sam Ocko October 6, 010 1. Building controlled-u from U (a) Problem Set # 6 Solutions FIG.
More informationAnyon computers with smaller groups
PHYSICAL REVIEW A 69, 032306 2004 Anyon computers with smaller groups Carlos Mochon* Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA Received 10 July
More informationQuantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk Outline Introduction to quantum error correction codes (QECC) Qudits and Qudit Gates Generalizing QECC to Qudit computing Need
More informationMulti-particle qubits
Master Thesis Summer Semester 007 Multi-particle qubits Oded Zilberberg Department of Physics and Astronomy Supervision by Prof. Dr. Daniel Loss CONTENTS Contents 1 Introduction 5 Introduction to quantum
More informationarxiv:quant-ph/ v1 29 Mar 2003
Finite-Dimensional PT -Symmetric Hamiltonians arxiv:quant-ph/0303174v1 29 Mar 2003 Carl M. Bender, Peter N. Meisinger, and Qinghai Wang Department of Physics, Washington University, St. Louis, MO 63130,
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 informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationHow hard is it to approximate the Jones polynomial?
How hard is it to approximate the Jones polynomial? Greg Kuperberg UC Davis June 17, 2009 The Jones polynomial and quantum computation Recall the Jones polynomial ( = Kauffman bracket): = q 1/2 q 1/2 =
More informationTensor network simulations of strongly correlated quantum systems
CENTRE FOR QUANTUM TECHNOLOGIES NATIONAL UNIVERSITY OF SINGAPORE AND CLARENDON LABORATORY UNIVERSITY OF OXFORD Tensor network simulations of strongly correlated quantum systems Stephen Clark LXXT[[[GSQPEFS\EGYOEGXMZMXMIWUYERXYQGSYVWI
More informationModular Categories and Applications I
I Modular Categories and Applications I Texas A&M University U. South Alabama, November 2009 Outline I 1 Topological Quantum Computation 2 Fusion Categories Ribbon and Modular Categories Fusion Rules and
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationManipulating Causal Order of Unitary Operations using Adiabatic Quantum Computation
Manipulating Causal Order of Unitary Operations using Adiabatic Quantum Computation Kosuke Nakago, Quantum Information group, The University of Tokyo, Tokyo,Japan. Joint work with, Mio murao, Michal Hajdusek,
More informationarxiv:quant-ph/ v1 28 May 1998
Is There a Universal Quantum Computer? Yu Shi Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK (submitted on 25 May 1998) arxiv:quant-ph/9805083v1 28 May 1998 Abstract There is a fatal mistake
More informationPh 219b/CS 219b. Exercises Due: Wednesday 21 November 2018 H = 1 ( ) 1 1. in quantum circuit notation, we denote the Hadamard gate as
h 29b/CS 29b Exercises Due: Wednesday 2 November 208 3. Universal quantum gates I In this exercise and the two that follow, we will establish that several simple sets of gates are universal for quantum
More informationRealization of Two-Qutrit Quantum Gates with Control Pulses
Commun. Theor. Phys. Beijing, China 51 pp. 65 65 c Chinese Physical Society and IOP Publishing Ltd Vol. 51, No., April 15, Realization of Two-Qutrit Quantum Gates with Control Pulses ZHANG Jie, DI Yao-Min,
More informationTopological Quantum Computation
QUANTUM COMPUTING (CS682) PROJECT REPORT 1 Topological Quantum Computation Vatshal Srivastav, 14790 Mentor: Prof Dr. Rajat Mittal, Department of Computer Science and Engineering, Indian Institute of Technology,
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 informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationTopological Quantum Computation A very basic introduction
Topological Quantum Computation A very basic introduction Alessandra Di Pierro alessandra.dipierro@univr.it Dipartimento di Informatica Università di Verona PhD Course on Quantum Computing Part I 1 Introduction
More informationAnyon Physics. Andrea Cappelli (INFN and Physics Dept., Florence)
Anyon Physics Andrea Cappelli (INFN and Physics Dept., Florence) Outline Anyons & topology in 2+ dimensions Chern-Simons gauge theory: Aharonov-Bohm phases Quantum Hall effect: bulk & edge excitations
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 informationAncilla-driven universal quantum computing
Ancilla-driven universal quantum computing Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. September 30, 2010 Vlad Gheorghiu (CMU) Ancilla-driven universal
More informationField Theory Description of Topological States of Matter
Field Theory Description of Topological States of Matter Andrea Cappelli, INFN Florence (w. E. Randellini, J. Sisti) Outline Topological states of matter Quantum Hall effect: bulk and edge Effective field
More informationAn Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
More informationCategory theory and topological quantum computing
Categor theor and topological quantum computing Gregor Schaumann Group seminar QOS Freiburg 7..3 Introduction Conformal field theor Invariants of manifolds and knots Topological field theor Tensor categories
More informationand extending this definition to all vectors in H AB by the complex bilinearity of the inner product.
Multiple systems, the tensor-product space, and the partial trace Carlton M Caves 2005 September 15 Consider two quantum systems, A and B System A is described by a d A -dimensional Hilbert space H A,
More informationMultilinear Singular Value Decomposition for Two Qubits
Malaysian Journal of Mathematical Sciences 10(S) August: 69 83 (2016) Special Issue: The 7 th International Conference on Research and Education in Mathematics (ICREM7) MALAYSIAN JOURNAL OF MATHEMATICAL
More informationQuantum Entanglement and the Bell Matrix
Quantum Entanglement and the Bell Matrix Marco Pedicini (Roma Tre University) in collaboration with Anna Chiara Lai and Silvia Rognone (La Sapienza University of Rome) SIMAI2018 - MS27: Discrete Mathematics,
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More information18.702: Quiz 1 Solutions
MIT MATHEMATICS 18.702: Quiz 1 Solutions February 28 2018 There are four problems on this quiz worth equal value. You may quote without proof any result stated in class or in the assigned reading, unless
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationTopological quantum information was formulated by Kitaev
Quon 3D language for quantum information Zhengwei Liu a, Alex Wozniakowski a, and Arthur M. Jaffe a,1 a Harvard University, Cambridge, MA 02138 Contributed by Arthur M. Jaffe, December 28, 2016 (sent for
More informationarxiv: v1 [quant-ph] 4 Jul 2013
GEOMETRY FOR SEPARABLE STATES AND CONSTRUCTION OF ENTANGLED STATES WITH POSITIVE PARTIAL TRANSPOSES KIL-CHAN HA AND SEUNG-HYEOK KYE arxiv:1307.1362v1 [quant-ph] 4 Jul 2013 Abstract. We construct faces
More informationFractional Quantum Hall States with Conformal Field Theories
Fractional Quantum Hall States with Conformal Field Theories Lei Su Department of Physics, University of Chicago Abstract: Fractional quantum Hall (FQH states are topological phases with anyonic excitations
More informationFourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
More informationSylow subgroups of GL(3,q)
Jack Schmidt We describe the Sylow p-subgroups of GL(n, q) for n 4. These were described in (Carter & Fong, 1964) and (Weir, 1955). 1 Overview The groups GL(n, q) have three types of Sylow p-subgroups:
More informationCharacter tables for some small groups
Character tables for some small groups P R Hewitt U of Toledo 12 Feb 07 References: 1. P Neumann, On a lemma which is not Burnside s, Mathematical Scientist 4 (1979), 133-141. 2. JH Conway et al., Atlas
More informationOperator-Schmidt Decompositions And the Fourier Transform:
Operator-Schmidt Decompositions And the Fourier Transform: Jon E. Tyson Research Assistant Physics Department, Harvard University jonetyson@post.harvard.edu Simons Foundation Conference on Quantum and
More informationQuantum Annealing for Ising Anyonic Systems
Quantum Annealing for Ising Anyonic Systems Masamichi Sato * ABSTRACT We consider the quantum annealing for Ising anyonic systems. After giving a description of quantum annealing for Ising anyonic systems,
More informationQuantum Phase Estimation using Multivalued Logic
Quantum Phase Estimation using Multivalued Logic Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion Introduction
More informationarxiv: v2 [cond-mat.str-el] 28 Jul 2010
Topological Order with a Twist: Ising Anyons from an Abelian Model H. Bombin Perimeter Institute for Theoretical Physics, 31 Caroline St. N., Waterloo, Ontario N2L 2Y5, Canada Anyon models can be symmetric
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 informationPh 219/CS 219. Exercises Due: Friday 20 October 2006
1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and
More informationSubfactors and Modular Tensor Categories
UNSW Topological matter, strings, K-theory and related areas University of Adelaide September 2016 Outline Motivation What is a modular tensor category? Where do modular tensor categories come from? Some
More informationBi-partite vertex model and multi-colored link invariants
Prepared for submission to JHEP Bi-partite vertex model and multi-colored link invariants arxiv:80758v [hep-th] 9 Nov 08 Saswati Dhara a, Romesh K Kaul b, P Ramadevi a, and Vivek Kumar Singh a a Department
More informationTopological Quantum Computation
Topological Quantum Computation arxiv:quant-ph/0101025v2 20 Sep 2002 Michael H. Freedman, Alexei Kitaev, Michael J. Larsen and Zhenghan Wang February 1, 2008 Microsoft Research, One Microsoft Way, Redmond,
More informationMatrix product states for the fractional quantum Hall effect
Matrix product states for the fractional quantum Hall effect Roger Mong (California Institute of Technology) University of Virginia Feb 24, 2014 Collaborators Michael Zaletel UC Berkeley (Stanford/Station
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 informationΨ({z i }) = i<j(z i z j ) m e P i z i 2 /4, q = ± e m.
Fractionalization of charge and statistics in graphene and related structures M. Franz University of British Columbia franz@physics.ubc.ca January 5, 2008 In collaboration with: C. Weeks, G. Rosenberg,
More informationMixed graph states. Constanza Riera, Ramij Rahaman, Matthew G. Parker
Mixed graph states Constanza Riera Ramij Rahaman Matthew G. Parker March 20 2018 arxiv:1506.03635v2 [quant-ph] 16 Mar 2016 1 Introduction The quantum graph state[1] is a pure quantum n-qubit state whose
More informationTopology driven quantum phase transitions
Topology driven quantum phase transitions Dresden July 2009 Simon Trebst Microsoft Station Q UC Santa Barbara Charlotte Gils Alexei Kitaev Andreas Ludwig Matthias Troyer Zhenghan Wang Topological quantum
More informationClassical simulations of non-abelian quantum Fourier transforms
Classical simulations of non-abelian quantum Fourier transforms Diploma Thesis Juan Bermejo Vega December 7, 2011 Garching First reviewer: Prof. Dr. J. Ignacio Cirac Second reviewer: Prof. Dr. Alejandro
More informationAn Invitation to the Mathematics of Topological Quantum Computation
Journal of Physics: Conference Series PAPER OPEN ACCESS An Invitation to the Mathematics of Topological Quantum Computation To cite this article: E C Rowell 2016 J. Phys.: Conf. Ser. 698 012012 View the
More informationQudit versions of the π/8 gate: Applications in fault-tolerant QC and nonlocality
Preliminaries Mathematical Structure Geometry Applications Qudit versions of the π/8 gate: Applications in fault-tolerant QC and nonlocality Mark Howard1 & Jiri Vala1,2 1 National 2 Dublin October 2012
More informationBoulder School 2016 Xie Chen 07/28/16-08/02/16
Boulder School 2016 Xie Chen 07/28/16-08/02/16 Symmetry Fractionalization 1 Introduction This lecture is based on review article Symmetry Fractionalization in Two Dimensional Topological Phases, arxiv:
More informationRepresentation Theory
Representation Theory Representations Let G be a group and V a vector space over a field k. A representation of G on V is a group homomorphism ρ : G Aut(V ). The degree (or dimension) of ρ is just dim
More informationPh 219b/CS 219b. Exercises Due: Wednesday 20 November 2013
1 h 219b/CS 219b Exercises Due: Wednesday 20 November 2013 3.1 Universal quantum gates I In this exercise and the two that follow, we will establish that several simple sets of gates are universal for
More informationModeling and Classification of Topological Phases of Matter. Zhenghan Wang Microsoft Station Q & UC Santa Barbara Texas, March 24, 2015
Modeling and Classification of Topological Phases of Matter Zhenghan Wang Microsoft Station Q & UC Santa Barbara Texas, March 24, 2015 Microsoft Station Q Search for non-abelian anyons in topological phases
More informationFermionic coherent states in infinite dimensions
Fermionic coherent states in infinite dimensions Robert Oeckl Centro de Ciencias Matemáticas Universidad Nacional Autónoma de México Morelia, Mexico Coherent States and their Applications CIRM, Marseille,
More informationTopological Quantum Computation in TGD Universe
CONTENTS 1 Topological Quantum Computation in TGD Universe M. Pitkänen, February 14, 2018 Email: matpitka6@gmail.com. http://tgdtheory.com/public_html/. Recent postal address: Rinnekatu 2-4 A 8, 03620,
More informationGROUP THEORY PRIMER. New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule
GROUP THEORY PRIMER New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule 1. Tensor methods for su(n) To study some aspects of representations of a
More informationarxiv:quant-ph/ v1 11 Nov 2005
On the SU() Parametrization of Qutrits arxiv:quant-ph/5v Nov 5 A. T. Bölükbaşı, T. Dereli Department of Physics, Koç University 445 Sarıyer, İstanbul, Turkey Abstract Parametrization of qutrits on the
More informationAnyons and Topological Quantum Computation
Anyons and Topological Quantum Computation João Oliveira Department of Mathematics, Técnico, Lisboa July 26, 2018 Abstract The aim of this text is to provide an introduction to the theory of topological
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 informationSubfactors and Topological Defects in Conformal Quantum Field Theory
Subfactors and Topological Defects in Conformal Quantum Field Theory Marcel Bischoff http://www.math.vanderbilt.edu/~bischom Department of Mathematics Vanderbilt University Nashville, TN San Antonio, TX,
More informationLecture notes: Quantum gates in matrix and ladder operator forms
Phys 7 Topics in Particles & Fields Spring 3 Lecture v.. Lecture notes: Quantum gates in matrix and ladder operator forms Jeffrey Yepez Department of Physics and Astronomy University of Hawai i at Manoa
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More information