VISIT THE WEBSITE OF THE CHAIR OF MESOSCOPIC PHYSICS
|
|
- Julia Cooper
- 5 years ago
- Views:
Transcription
1 Chaire de Physique Mésoscopique Michel Devoret Année 00, mai - juin INTRODUCTION AU CALCUL QUANTIQUE INTRODUCTION TO QUANTUM COMPUTATION Quatrième Leçon / Fourth Lecture This College de France document is for consultation only. Reproduction rights are reserved. 0-IV- VISIT TE WEBSITE OF TE CAIR OF MESOSCOPIC PSICS then follow Enseignement > Sciences Physiques > Physique Mésoscopique > Site web or PDF FILES OF ALL PAST LECTURES ARE POSTED Questions, comments and corrections are welcome! write to "phymeso@gmail.com" 0-IV-
2 CONTENT OF TIS EAR'S LECTURES QUANTUM COMPUTATION FROM TE PERSPECTIVE OF MESOSCOPIC CIRCUITS. Introduction, c-bits versus q-bits. The Pauli matrices and quantum computation primitives 3. Stabilizer formalism for state representation 4. Clifford calculus 5. Algorithms 6. Error correction 0-IV-3 CALENDAR OF SEMINARS May : Cristian Urbina, (Quantronics group, SPEC-CEA Saclay) Josephson effect in atomic contacts and carbon nanotubes May 8: Benoît Douçot (LPTE / Université Pierre et Marie Curie) Towards the physical realization of topologically protected qubits June : Takis Kontos (LPA / Ecole Normale Supérieure) Points quantiques et ferromagnétisme June 8: Cristiano Ciuti (MPQ, Université Paris - Diderot) Ultrastrong coupling circuit QED : vacuum degeneracy and quantum phase transitions June 5: Leo DiCarlo (ale) Preparation and measurement of tri-partite entanglement in a superconducting quantum circuit June : Vladimir Manucharian (ale) The fluxonium circuit: an electrical dual of the Cooper-pair box? 0-IV-4
3 LECTURE IV : CLIFFORD CALCULUS. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations 0-IV-5 OUTLINE. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations 0-IV-5a 3
4 BASIC INGREDIENTS OF STABILIER FORMALISM Primary Pauli operators:... N N =6 example: Stabilizer element: PP P P { I,,, } II Stabilizer: {,,..., N } ± PP... PN = M I M M M { } Condensed form: { M, M,..., M } i j, k, M jmkm jmk = I represents a state of the register α β ν { αβγ} N elements,,,m M ± M α β γ A D-dimensional state manifold of the register is represented by: D = N P { Mα, Mβ,..., Mμ} P elements N : number of qubits 0-IV-6d STABILIER REGISTER STATE A single-state stabilizer can be written as an array of symbols: ± ± P P P P P P ± P P... P + I + I N N N N NN 00 + I + I ( 0 + )( 0 + ) N Pauli words with N+ symbols arranged in "alphabetical" order (I---) The associated state simultaneously diagonalizes the operator-words with + eigenvalue: = I I 0 I + I ( 0 + )( 0 ) = IV-7c 4
5 STABILIER STATE MAPPING (continued) + + remove signs ( 0 + )( 0 + ) + ( 0 )( 0 ) = = ,,, less is more! +? Observe that: + + R y π + since π/ rotation around IV-8e STABILIER STATE MAPPING (continued) + I + I + 00 pivot = = II + II + II + I + I + I pivot pivot + I + I + + I I 000 = = IV-9 5
6 OUTLINE. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations 0-IV-5b CONSTRUCTION OF A STABILIER CLASS All the Pauli multi-qubit primary operators I I II II II 0-IV-0 6
7 CONSTRUCTION OF A STABILIER CLASS I pick one operator: II I II II II 0-IV-0a CONSTRUCTION OF A STABILIER CLASS I exclude non-com. operators I II II II 0-IV-0b 7
8 CONSTRUCTION OF A STABILIER CLASS II I II I II II II pick next operator II,II 0-IV-0c CONSTRUCTION OF A STABILIER CLASS II I II I II II II exclude non-com. operators II,II 0-IV-0d 8
9 CONSTRUCTION OF A STABILIER CLASS II I II I II II II pick next operator exclude product II,II,I II,II 0-IV-0e CONSTRUCTION OF A STABILIER CLASS II I II I II II II A N D II,II,I S O O N II,II 0-IV-0f 9
10 First choice: NUMBER OF STABILIER CLASSES N Second choice: N Third choice: the - comes from excluding I exclude non.com., last gen. and I N 4 exclude non.com., last gen. comb. and I N k+ k k-th choice: N Total nb. choices: ( N k+ k N k+ ) ( N k = + )( ) k= k= N Last factor corresponds to the number of arrangements of numbers thru N on hyper-cube of stabilizer gen. combinations. It must be divided out to get the classes. The number of stabilizer classes is thus: N N k+ N N ( ) ( )( ) k= + = IV-a NUMBER OF CLIFFORD STATES N CS ( )( ) N N N = N N CS ln N CS 0 Information in selecting one of these states: ln N CS ln N CS grows like N / information is super-extensive! N Gottesman-Knill theorem entanglement, Bell violations, teleportation, error correction, but... 0-IV-c 0
11 OUTLINE 0-IV-5c. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations TE SINGLE QUBIT CLIFFORD GROUP Consider isomorphisms of the Pauli group into itself Each isomorphism is characterized by the set of the images of the generators: z x g g { } { },,,,,, z x g g z x x z gg gg = The two images must satisfy: There are therefore 6x4=4 isomorphisms, called elements of the -qubit Clifford group: / / = = = Id = = / / = = = / / = = = Why and not? / P [ ] / P The latter is an operator acting on kets. The former is a super-operator acting on operators. 0-IV-3c
12 TE SINGLE QUBIT CLIFFORD GROUP IS ISOMORPIC TO TE OCTAEDRAL GROUP / π rotation around + π/ rotation around / π/ rotation around π/ rotation around / The notation A a means the transformation is a "rotation" around axis A with angle aπ. Attention: A = Id 0-IV-4b GENERATORS OF TE -QUBIT CLIFFORD GROUP (ISOMORPIC TO TE OCTAEDRAL GROUP) Consider S 4 the permutation group on 4 objects, isomorphic to the octahedral group, symmetry group of the cube and the octahedron R R + ( π) ( π /) objects 34 are diagonals R ( π /) R ( π /) = = R+ ( π) = = st choice of generators / duality vertex-face 3 nd choice of generators 3 4 / R ( π /) = = R ( π /) = = 3 4 objects 34 are pairs of faces / 0-IV-5a
13 USEFUL RELATIONS FOR QUANTUM COMPILERS / π/ rot. around / π/ rot. around = / / / / / π/ rot. around π/ rot. around / / / π/ rot. around π/ rot. around 0-IV-6 OUTLINE. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations 0-IV-5d 3
14 TWO-QUBIT QUANTUM PROCESSOR slide courtesy of Leo DiCarlo & Rob Schoelkopf ale University f I f I Q Q 0-IV-7 TWO-QUBIT QUANTUM PROCESSOR slide courtesy of Leo DiCarlo & Rob Schoelkopf ale University f I [I] β f [I] α I Q Q 0-IV-7a 4
15 TWO-QUBIT QUANTUM PROCESSOR slide courtesy of Leo DiCarlo & Rob Schoelkopf ale University [I] δ f I [I] γ f I Q Q 0-IV-7b TWO-QUBIT QUANTUM PROCESSOR slide courtesy of Leo DiCarlo & Rob Schoelkopf ale University f I f I Q Q 0-IV-7c 5
16 UPGRADING TE PROCESSOR TO 4 QUBITS slide courtesy of Leo DiCarlo & Rob Schoelkopf Q Q Q3 Q4 0-IV-8 CIRCUIT AMILTONIAN qubit qubit α = ω aa+ ( aa) α = ω aa + ( aa) 0-IV-9 6
17 CIRCUIT AMILTONIAN qubit qubit cavity α = ω aa+ ( aa) α = ω aa + ( aa) c = ω aa c c c total = c coupling 0-IV-9a CIRCUIT AMILTONIAN qubit qubit cavity α = ω aa+ ( aa) coupling g RWA α = ω aa + ( aa) ( a ac + aac) + g ( aac + aac) total c = ω aa c c c c = coupling 0-IV-9b 7
18 energy EFFECTIVE QUBIT-QUBIT INTERACTIONS external field 00 OFF ON 00 0-IV-0 EFFECTIVE QUBIT-QUBIT INTERACTIONS OFF ON ON OFF 0-IV-0a 8
19 EFFECTIVE QUBIT-QUBIT INTERACTIONS "FLIP-FLOP" 0 "SECULAR" OFF ON ON OFF 0-IV-0a σ NATURAL ENTANGLING OPERATIONS σ Uˆ ( τ) = exp ( iˆ intτ/ ) * * Secular interaction: ˆ int = g σσ z z with adjustment of gate duration time: [ ] / π τ s = 4 Flip-flop interaction: ˆ int = g ( σσ + + σσ + ) = g ( σσ x x + σσ y y) / τ f = [ ] [ ] π 4g g /4 /4 0-IV- 9
20 REFOCUS SEQUENCE NECESSAR WIT FLIP-FLOP INTERACTION ˆ Consider = g ( t) σ σ + g ( t) σ σ int x x x y y y π 0, 4 0 τ g () t dt/ y π π, 4 4 Green points: [] / equivalent ( 0,0) π,0 4 0 τ g () t dt/ x Need to cut sequence in sections, with a 80 flip of one qubit around x or y. 0-IV- OUTLINE. Review of stabilizer properties. Number of stabilizers 3. One-qubit Clifford operations 4. Two-qubit interactions 5. Two-qubit Clifford operations 0-IV-5e 0
21 GOTTESMAN TABLES FOR QUANTUM OPERATIONS Bit Flip (NOT) π rotation along ˆx [] - Phase Flip π rotation along ẑ [] - adamard π rotation along xˆ + zˆ NOT / π/ rotation along ŷ [] / - Example of a -qubit gate: ct, ct, c control CNOT I phase kick-back I I I I I as in Boolean algebra target 0-IV-3a RULES OF CLIFFORD CALCULUS FOR N QUBITS They are found starting from: B A= [ B] A[ B] α α α B [ A] = [ A] = [ A] / B [ A] = [ B][ A] = [ A] if A and B anticommute if A and B commute if A and B anticommute if A and B commute α NOTE TAT: B = B [ ] [ ] α A = B A= B 0-IV-4a
22 EAMPLE OF CLIFFORD CALCULATIONS / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I I = I / I = / I = / = / = Only need to know: ẑ xˆ = yˆ ŷ ẑ ˆx 0-IV-5 EAMPLE OF POWER OF STABILIER FORMALISM () ow do we go from the Computational basis to the Sign basis? { I, I, } { I, I, } { 00, 0, 0, } { ++, +, +, } For both qubit, must be changed into This is performed by a 90 rotation around (easier than ). I / I / { I, I, } { I, I, } / I I = I / I I = I / I I = I / I I = I 0-IV-6a
23 EAMPLE OF POWER OF STABILIER FORMALISM () ow do we go from the i-sign basis to the Phase basis? / / / { I, I, } ( 0 i )( 0 i ) ( 0 i )( 0 i ) + + +,, ( 0 i )( 0 i ) ( 0 i )( 0 i ) +, We need an entanglement operator: I = I = = {,, } ,, , / / { I, I, } {,, } signs unimportant in basis representation 0-IV-7a VISUALIING TE CLIFFORD MOVES ON TE STABILIER MAP () I I Bell I I I i-bell I I / I / / I / I I I I Comp I I I I 0-IV-8 3
24 VISUALIING TE CLIFFORD MOVES ON TE STABILIER MAP () Phase I I Bell I I I i-bell I I / I / / I I I I Comp I I I I 0-IV-9 END OF LECTURE 4
INTRODUCTION AU CALCUL QUANTIQUE INTRODUCTION TO QUANTUM COMPUTATION. What is a quantum computer? Aren't all computers quantum?
Chaire de Physique Mésoscopique Michel Devoret Année, mai - juin INTRODUCTION AU CALCUL QUANTIQUE INTRODUCTION TO QUANTUM COMPUTATION Première Leçon / First Lecture This College de France document is for
More informationElectrical quantum engineering with superconducting circuits
1.0 10 0.8 01 switching probability 0.6 0.4 0.2 00 P. Bertet & R. Heeres SPEC, CEA Saclay (France), Quantronics group 11 0.0 0 100 200 300 400 swap duration (ns) Electrical quantum engineering with superconducting
More informationRÉSONATEURS NANOMÉCANIQUES DANS LE RÉGIME QUANTIQUE NANOMECHANICAL RESONATORS IN QUANTUM REGIME
Chaire de Physique Mésoscopique Michel Devoret Année 1, 15 mai - 19 juin RÉSONATEURS NANOMÉCANIQUES DANS LE RÉGIME QUANTIQUE NANOMECHANICAL RESONATORS IN QUANTUM REGIME Troisième leçon / Third lecture
More informationAdvances in Josephson Quantum Circuits
APS 00 March Meeting, Tutorial #3 Advances in Josephson Quantum Circuits Instructors: Michel Devoret, Yale University "Introduction to superconducting quantum circuits" Yasunobu Nakamura, NEC Japan "Superconducting
More informationQuantum Optics and Quantum Informatics FKA173
Quantum Optics and Quantum Informatics FKA173 Date and time: Tuesday, 7 October 015, 08:30-1:30. Examiners: Jonas Bylander (070-53 44 39) and Thilo Bauch (0733-66 13 79). Visits around 09:30 and 11:30.
More informationINTRODUCTION À LA PHYSIQUE MÉSOSCOPIQUE: ÉLECTRONS ET PHOTONS INTRODUCTION TO MESOSCOPIC PHYSICS: ELECTRONS AND PHOTONS
Chaire de Physique Mésoscopique Michel Devoret Année 2007, Cours des 7 et 14 juin INTRODUCTION À LA PHYSIQUE MÉSOSCOPIQUE: ÉLECTRONS ET PHOTONS INTRODUCTION TO MESOSCOPIC PHYSICS: ELECTRONS AND PHOTONS
More informationJosephson qubits. P. Bertet. SPEC, CEA Saclay (France), Quantronics group
Josephson qubits P. Bertet SPEC, CEA Saclay (France), Quantronics group Outline Lecture 1: Basics of superconducting qubits Lecture 2: Qubit readout and circuit quantum electrodynamics Lecture 3: 2-qubit
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 informationTeleportation-based approaches to universal quantum computation with single-qubit measurements
Teleportation-based approaches to universal quantum computation with single-qubit measurements Andrew Childs MIT Center for Theoretical Physics joint work with Debbie Leung and Michael Nielsen Resource
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 informationCIRCUITS ET SIGNAUX QUANTIQUES QUANTUM SIGNALS AND CIRCUITS VISIT THE WEBSITE OF THE CHAIR OF MESOSCOPIC PHYSICS
Chaire de Physique Mésoscopique Michel Devoret Année 2008, 13 mai - 24 juin CIRCUITS ET SIGNAUX QUANTIQUES QUANTUM SIGNALS AND CIRCUITS Première leçon / First Lecture This College de France document is
More informationDistributing Quantum Information with Microwave Resonators in Circuit QED
Distributing Quantum Information with Microwave Resonators in Circuit QED M. Baur, A. Fedorov, L. Steffen (Quantum Computation) J. Fink, A. F. van Loo (Collective Interactions) T. Thiele, S. Hogan (Hybrid
More informationDriving Qubit Transitions in J-C Hamiltonian
Qubit Control Driving Qubit Transitions in J-C Hamiltonian Hamiltonian for microwave drive Unitary transform with and Results in dispersive approximation up to 2 nd order in g Drive induces Rabi oscillations
More informationINTRODUCTION À LA PHYSIQUE MÉSOSCOPIQUE: ÉLECTRONS ET PHOTONS INTRODUCTION TO MESOSCOPIC PHYSICS: ELECTRONS AND PHOTONS
Chaire de Physique Mésoscopique Michel Devoret Année 2007, Cours des 7 et 14 juin INTRODUCTION À LA PHYSIQUE MÉSOSCOPIQUE: ÉLECTRONS ET PHOTONS INTRODUCTION TO MESOSCOPIC PHYSICS: ELECTRONS AND PHOTONS
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 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 informationCavity QED with Rydberg Atoms Serge Haroche, Collège de France & Ecole Normale Supérieure, Paris
Cavity QED with Rydberg Atoms Serge Haroche, Collège de France & Ecole Normale Supérieure, Paris A three lecture course Goal of lectures Manipulating states of simple quantum systems has become an important
More informationSimulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
More informationJohn Stewart Bell Prize. Part 1: Michel Devoret, Yale University
John Stewart Bell Prize Part 1: Michel Devoret, Yale University SUPERCONDUCTING ARTIFICIAL ATOMS: FROM TESTS OF QUANTUM MECHANICS TO QUANTUM COMPUTERS Part 2: Robert Schoelkopf, Yale University CIRCUIT
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 informationLecture 2, March 2, 2017
Lecture 2, March 2, 2017 Last week: Introduction to topics of lecture Algorithms Physical Systems The development of Quantum Information Science Quantum physics perspective Computer science perspective
More informationRÉSONATEURS NANOMÉCANIQUES DANS LE RÉGIME QUANTIQUE NANOMECHANICAL RESONATORS IN QUANTUM REGIME
Chaire de Physique Mésoscopique Michel Devoret Année 1, 15 mai - 19 juin RÉSONATEURS NANOMÉCANIQUES DANS LE RÉGIME QUANTIQUE NANOMECHANICAL RESONATORS IN QUANTUM REGIME Deuxième leçon / Second lecture
More informationQUANTUM COMPUTING. Part II. Jean V. Bellissard. Georgia Institute of Technology & Institut Universitaire de France
QUANTUM COMPUTING Part II Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France QUANTUM GATES: a reminder Quantum gates: 1-qubit gates x> U U x> U is unitary in M 2 ( C
More informationOmm Al-Qura University Dr. Abdulsalam Ai LECTURE OUTLINE CHAPTER 3. Vectors in Physics
LECTURE OUTLINE CHAPTER 3 Vectors in Physics 3-1 Scalars Versus Vectors Scalar a numerical value (number with units). May be positive or negative. Examples: temperature, speed, height, and mass. Vector
More informationLecture 2, March 1, 2018
Lecture 2, March 1, 2018 Last week: Introduction to topics of lecture Algorithms Physical Systems The development of Quantum Information Science Quantum physics perspective Computer science perspective
More informationarxiv: v2 [quant-ph] 7 Feb 2018
Demonstration of Envariance and Parity Learning on the IBM 6 Qubit Processor Davide Ferrari and Michele Amoretti, : Department of Engineering and Architecture - University of Parma, Italy : Quantum Information
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationC/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
More informationParity-Protected Josephson Qubits
Parity-Protected Josephson Qubits Matthew Bell 1,2, Wenyuan Zhang 1, Lev Ioffe 1,3, and Michael Gershenson 1 1 Department of Physics and Astronomy, Rutgers University, New Jersey 2 Department of Electrical
More informationCollège de France abroad Lectures Quantum information with real or artificial atoms and photons in cavities
Collège de France abroad Lectures Quantum information with real or artificial atoms and photons in cavities Serge Haroche, Collège de France & Ecole Normale Supérieure, Paris www.college-de-france.fr A
More informationAugust 28, 2016 (Sunday)
August 28, 2016 (Sunday) 09:00-10: 30 The Theory of Statistical Comparison with Applications in Quantum Information Science....... 1 Francesco Buscemi (Nagoya University) 10:50-12:20 Introduction to measurement-based
More informationAutonomous Quantum Error Correction. Joachim Cohen QUANTIC
Autonomous Quantum Error Correction Joachim Cohen QUANTIC Outline I. Why quantum information processing? II. Classical bits vs. Quantum bits III. Quantum Error Correction WHY QUANTUM INFORMATION PROCESSING?
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More informationQuantum computing and mathematical research. Chi-Kwong Li The College of William and Mary
and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to
More informationQuReP. Quantum Repeaters for Long Distance Fibre-Based Quantum Communication. Rob Thew. Coordinator: Nicolas Gisin
QuReP Quantum Repeaters for Long Distance Fibre-Based Quantum Communication Rob Thew Coordinator: Nicolas Gisin 1. Direct transmission Photon source Alice 2. Entanglement distribution: α Goal is to distribute
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationarxiv: v2 [quant-ph] 5 Dec 2013
Decomposition of quantum gates Chi Kwong Li and Diane Christine Pelejo Department of Mathematics, College of William and Mary, Williamsburg, VA 23187, USA E-mail: ckli@math.wm.edu, dcpelejo@gmail.com Abstract
More informationIBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
More informationAmplification, entanglement and storage of microwave radiation using superconducting circuits
Amplification, entanglement and storage of microwave radiation using superconducting circuits Jean-Damien Pillet Philip Kim s group at Columbia University, New York, USA Work done in Quantum Electronics
More informationShort Course in Quantum Information Lecture 8 Physical Implementations
Short Course in Quantum Information Lecture 8 Physical Implementations Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture : Intro
More informationExploring the quantum dynamics of atoms and photons in cavities. Serge Haroche, ENS and Collège de France, Paris
Exploring the quantum dynamics of atoms and photons in cavities Serge Haroche, ENS and Collège de France, Paris Experiments in which single atoms and photons are manipulated in high Q cavities are modern
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 Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More informationDoing Atomic Physics with Electrical Circuits: Strong Coupling Cavity QED
Doing Atomic Physics with Electrical Circuits: Strong Coupling Cavity QED Ren-Shou Huang, Alexandre Blais, Andreas Wallraff, David Schuster, Sameer Kumar, Luigi Frunzio, Hannes Majer, Steven Girvin, Robert
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 informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationRichard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo
CS 497 Frontiers of Computer Science Introduction to Quantum Computing Lecture of http://www.cs.uwaterloo.ca/~cleve/cs497-f7 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum
More informationElectrical Quantum Engineering with Superconducting Circuits
1.0 10 0.8 01 switching probability 0.6 0.4 0.2 00 Electrical Quantum Engineering with Superconducting Circuits R. Heeres & P. Bertet SPEC, CEA Saclay (France), Quantronics group 11 0.0 0 100 200 300 400
More informationLie algebraic aspects of quantum control in interacting spin-1/2 (qubit) chains
.. Lie algebraic aspects of quantum control in interacting spin-1/2 (qubit) chains Vladimir M. Stojanović Condensed Matter Theory Group HARVARD UNIVERSITY September 16, 2014 V. M. Stojanović (Harvard)
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationSuperconducting Qubits. Nathan Kurz PHYS January 2007
Superconducting Qubits Nathan Kurz PHYS 576 19 January 2007 Outline How do we get macroscopic quantum behavior out of a many-electron system? The basic building block the Josephson junction, how do we
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 informationLecture 2 Version: 14/08/29. Frontiers of Condensed Matter San Sebastian, Aug , Dr. Leo DiCarlo dicarlolab.tudelft.
Introduction to quantum computing (with superconducting circuits) Lecture 2 Version: 14/89 Frontiers of Condensed Matter San Sebastian, Aug. 28-3, 214 Dr. Leo DiCarlo l.dicarlo@tudelft.nl dicarlolab.tudelft.nl
More informationIntroduction to Quantum Information Processing
Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the
More informationBaby's First Diagrammatic Calculus for Quantum Information Processing
Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38 Quantum computing ˆ Quantum computing is usually
More informationQuantum Computer Algorithms: basics
Quantum Computer Algorithms: basics Michele Mosca Canada Research Chair in Quantum Computation SQUINT Summer School on Quantum Information Processing June 3 Overview A quantum computing model Basis changes
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechanics for Scientists and Engineers David Miller Vector spaces, operators and matrices Vector spaces, operators and matrices Vector space Vector space We need a space in which our vectors exist
More informationProjects about Quantum adder circuits Final examination June 2018 Quirk Simulator
Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator http://algassert.com/2016/05/22/quirk.html PROBLEM TO SOLVE 1. The HNG gate is described in reference: Haghparast M. and
More informationα x x 0 α x x f(x) α x x α x ( 1) f(x) x f(x) x f(x) α x = α x x 2
Quadratic speedup for unstructured search - Grover s Al- CS 94- gorithm /8/07 Spring 007 Lecture 11 01 Unstructured Search Here s the problem: You are given an efficient boolean function f : {1,,} {0,1},
More informationIntroduction to Cavity QED: fundamental tests and application to quantum information Serge Haroche July 2004
Introduction to Cavity QED: fundamental tests and application to quantum information Serge Haroche July 2004 A very active research field: Code information in simple systems (atoms, photons..) and use
More informationMatrix Representation
Matrix Representation Matrix Rep. Same basics as introduced already. Convenient method of working with vectors. Superposition Complete set of vectors can be used to express any other vector. Complete set
More informationQUANTUM ELECTRONICS ON THE TRAY* *Sur le plateau (de Saclay)
QUANTUM ELECTRONIC ON THE TRAY* *ur le plateau (de aclay) Goal: Reveal the quantum behavior of electrons everal ways of revealing the quantum behavior of electrons 1 Interference experiments of coherent
More informationON THE ROLE OF THE BASIS OF MEASUREMENT IN QUANTUM GATE TELEPORTATION. F. V. Mendes, R. V. Ramos
ON THE ROLE OF THE BASIS OF MEASREMENT IN QANTM GATE TELEPORTATION F V Mendes, R V Ramos fernandovm@detiufcbr rubens@detiufcbr Lab of Quantum Information Technology, Department of Teleinformatic Engineering
More informationIntroduction to Circuit QED Lecture 2
Departments of Physics and Applied Physics, Yale University Experiment Michel Devoret Luigi Frunzio Rob Schoelkopf Andrei Petrenko Nissim Ofek Reinier Heeres Philip Reinhold Yehan Liu Zaki Leghtas Brian
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More informationLecture 3: Hilbert spaces, tensor products
CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second
More informationResearch Article Expression of a Tensor Commutation Matrix in Terms of the Generalized Gell-Mann Matrices
Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2007, Article ID 20672, 0 pages doi:0.55/2007/20672 Research Article Expression of a Tensor Commutation
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 informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
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 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 informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationConcepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.
Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models CS448J, Autumn 2015, Stanford University Dominik L. Michels Advanced Computation Models There is a variety of advanced
More informationCircuit QED: A promising advance towards quantum computing
Circuit QED: A promising advance towards quantum computing Himadri Barman Jawaharlal Nehru Centre for Advanced Scientific Research Bangalore, India. QCMJC Talk, July 10, 2012 Outline Basics of quantum
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 informationLecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
More informationCircuit Quantum Electrodynamics
Circuit Quantum Electrodynamics David Haviland Nanosturcture Physics, Dept. Applied Physics, KTH, Albanova Atom in a Cavity Consider only two levels of atom, with energy separation Atom drifts through
More informationQuantum Computation. Michael A. Nielsen. University of Queensland
Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum
More informationarxiv: v1 [quant-ph] 29 Apr 2010
Minimal memory requirements for pearl necklace encoders of quantum convolutional codes arxiv:004.579v [quant-ph] 29 Apr 200 Monireh Houshmand and Saied Hosseini-Khayat Department of Electrical Engineering,
More information1 Quantum Circuits. CS Quantum Complexity theory 1/31/07 Spring 2007 Lecture Class P - Polynomial Time
CS 94- Quantum Complexity theory 1/31/07 Spring 007 Lecture 5 1 Quantum Circuits A quantum circuit implements a unitary operator in a ilbert space, given as primitive a (usually finite) collection of gates
More informationTopologicaly protected abelian Josephson qubits: theory and experiment.
Topologicaly protected abelian Josephson qubits: theory and experiment. B. Doucot (Jussieu) M.V. Feigelman (Landau) L. Ioffe (Rutgers) M. Gershenson (Rutgers) Plan Honest (pessimistic) review of the state
More informationDescribing Quantum Circuits with Systolic Arrays
escribing Quantum Circuits with Systolic Arrays Aasavari have and Eurípides Montagne School of Electrical Engineering and Computer Science University of Central Florida, Orlando, FL E-mail:{aasavari, eurip}@cs.ucf.edu
More informationMetastable states in an RF driven Josephson oscillator
Metastable states in an RF driven Josephson oscillator R. VIJAYARAGHAVAN Daniel Prober Robert Schoelkopf Steve Girvin Department of Applied Physics Yale University 3-16-2006 APS March Meeting I. Siddiqi
More informationLecture 20: Bell inequalities and nonlocality
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the
More informationTHE ABC OF COLOR CODES
THE ABC OF COLOR CODES Aleksander Kubica ariv:1410.0069, 1503.02065 work in progress w/ F. Brandao, K. Svore, N. Delfosse 1 WHY DO WE CARE ABOUT QUANTUM CODES? Goal: store information and perform computation.
More informationLecture 6, March 30, 2017
Lecture 6, March 30, 2017 Last week: This week: Brief revisit of the Transmon qubit Gate charge insensitivity Anharmonicity and driving of qubit Tuning by magnetic flux Qubit-Qubit coupling in circuit
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 informationMeasuring progress in Shor s factoring algorithm
Measuring progress in Shor s factoring algorithm Thomas Lawson Télécom ParisTech, Paris, France 1 / 58 Shor s factoring algorithm What do small factoring experiments show? Do they represent progress? 2
More informationRoutes towards quantum information processing with superconducting circuits
Routes towards quantum information processing with superconducting circuits? 0 1 1 0 U 2 1 0? 0 1 U 1 U 1 Daniel Estève Quantronics SPEC CEA Saclay Quantum Mechanics: resources for information processing
More informationDissipation in Transmon
Dissipation in Transmon Muqing Xu, Exchange in, ETH, Tsinghua University Muqing Xu 8 April 2016 1 Highlight The large E J /E C ratio and the low energy dispersion contribute to Transmon s most significant
More informationQuantum Optics. Manipulation of «simple» quantum systems
Quantum Optics Manipulation of «simple» quantum systems Antoine Browaeys Institut d Optique, Palaiseau, France Quantum optics = interaction atom + quantum field e g ~ 1960: R. Glauber (P. Nobel. 2005),
More informationChapter 2. Basic Principles of Quantum mechanics
Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical
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 informationQUANTUM HOMOMORPHIC ENCRYPTION FOR POLYNOMIAL-SIZED CIRCUITS
QUANTUM HOMOMORPHIC ENCRYPTION FOR POLYNOMIAL-SIZED CIRCUITS Florian Speelman (joint work with Yfke Dulek and Christian Schaffner) http://arxiv.org/abs/1603.09717 QIP 2017, Seattle, Washington, Monday
More informationTransformation of quantum states using uniformly controlled rotations
Transformation of quantum states using uniformly controlled rotations Mikko Möttönen, Juha J. Vartiainen, Ville Bergholm, and Martti M. Salomaa Materials Physics Laboratory, P.O. Box 2200, FIN-02015 Helsinki
More informationarxiv: v2 [quant-ph] 16 Nov 2018
aaacxicdvhlsgmxfe3hv62vvswncwelkrmikdlgi7cqc1yfwyro+mthmasibkjlgg+wk3u/s2/wn8wfsxs1qsjh3nuosckjhcuhb8fry5+yxfpejyawv1bx2jxnm8tto1hftcs23ui7aohciwcjnxieojjf/xphvrdcxortlqhqykdgj6u6ako5kjmwo5gtsc0fi/qtgbvtaxmolcnxuap7gqihlspyhdblqgbicil5q1atid3qkfhfqqo+1ki6e5f+cyrt/txh1f/oj9+skd2npbhlnngojzmpd8k9tyjdw0kykioniem9jfmxflvtjmjlaseio9n9llpk/ahkfldycthdga3aj3t58/gwfolthsqx2olgidl87cdyigsjusbud182x0/7nbjs9utoacgfz/g1uj2phuaubx9u6fyy7kljdts8owchowj1dsarmc6qvbi39l78ta8bw9nvoovjv1tsanx9rbsmy8zw==
More informationChapter 1. Quantum interference 1.1 Single photon interference
Chapter. Quantum interference. Single photon interference b a Classical picture Quantum picture Two real physical waves consisting of independent energy quanta (photons) are mutually coherent and so they
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 information