Quantum computing and mathematical research. Chi-Kwong Li The College of William and Mary
|
|
- Luke Copeland
- 6 years ago
- Views:
Transcription
1 and mathematical research The College of William and Mary
2 Classical computing
3 Classical computing Hardware - Beads and bars.
4 Classical computing Hardware - Beads and bars. Input - Using finger skill to change the states of the device.
5 Classical computing Hardware - Beads and bars. Input - Using finger skill to change the states of the device. Processor - Mechanical process with clever algorithms based on elementary arithmetic rules.
6 Classical computing Hardware - Beads and bars. Input - Using finger skill to change the states of the device. Processor - Mechanical process with clever algorithms based on elementary arithmetic rules. Output - Beads and bars, then recorded by brush and ink.
7 Modern computing
8 Modern computing Hardware - Mechanical/electronic/integrated circuits.
9 Modern computing Hardware - Mechanical/electronic/integrated circuits. Input - Punch cards, keyboards, scanners, sounds, etc. all converted to binary bits - (0, 1) sequences.
10 Modern computing Hardware - Mechanical/electronic/integrated circuits. Input - Punch cards, keyboards, scanners, sounds, etc. all converted to binary bits - (0, 1) sequences. Processor - Manipulations of (0, 1) sequences using Boolean logic.
11 Modern computing 0 0 = = = = 1 Hardware - Mechanical/electronic/integrated circuits. Input - Punch cards, keyboards, scanners, sounds, etc. all converted to binary bits - (0, 1) sequences. Processor - Manipulations of (0, 1) sequences using Boolean logic.
12 Modern computing 0 0 = = = = 1 Hardware - Mechanical/electronic/integrated circuits. Input - Punch cards, keyboards, scanners, sounds, etc. all converted to binary bits - (0, 1) sequences. Processor - Manipulations of (0, 1) sequences using Boolean logic. Output - (0, 1) sequences realized as visual images, which can be viewed or printed.
13
14 Hardware - Super conductor, trapped ions, optical lattices, quantum dot, MNR, etc.
15 Hardware - Super conductor, trapped ions, optical lattices, quantum dot, MNR, etc. Input - Quantum states in a specific form - Qubit (Quantum bit).
16 Hardware - Super conductor, trapped ions, optical lattices, quantum dot, MNR, etc. Input - Quantum states in a specific form - Qubit (Quantum bit). Processor - Provide suitable environment for the quantum system of qubits to evolve.
17 Hardware - Super conductor, trapped ions, optical lattices, quantum dot, MNR, etc. Input - Quantum states in a specific form - Qubit (Quantum bit). Processor - Provide suitable environment for the quantum system of qubits to evolve. Output - Measurement of the resulting quantum states.
18 Hardware - Super conductor, trapped ions, optical lattices, quantum dot, MNR, etc. Input - Quantum states in a specific form - Qubit (Quantum bit). Processor - Provide suitable environment for the quantum system of qubits to evolve. Output - Measurement of the resulting quantum states. All these require the understanding of mathematics, physics, chemistry, computer sciences, engineering, etc.
19 Some quantum physics background from Youtube! Dr. Quantum - Two-slit experiment.
20 Some quantum physics background from Youtube! Dr. Quantum - Two-slit experiment. Dr. Quantum - Entanglement.
21 Some quantum physics background from Youtube! Dr. Quantum - Two-slit experiment. Dr. Quantum - Entanglement. Quantum teleportation.
22 Mathematical challenges How to control the (initial) quantum states?
23 Mathematical challenges How to control the (initial) quantum states? How to create the appropriate environment for the quantum mechanical system to evolve without observing?
24 Mathematical challenges How to control the (initial) quantum states? How to create the appropriate environment for the quantum mechanical system to evolve without observing? How to fight decoherence (the interaction of the system and the external environment)?
25 Mathematical challenges How to control the (initial) quantum states? How to create the appropriate environment for the quantum mechanical system to evolve without observing? How to fight decoherence (the interaction of the system and the external environment)? How to use the phenomena of superposition and entanglement effectively to design quantum algorithms.
26 Quantum states and quantum bits Suppose a quantum system have two (discrete) measurable physical sates, say, up spin and down spin of a particle.
27 Quantum states and quantum bits Suppose a quantum system have two (discrete) measurable physical sates, say, up spin and down spin of a particle. They will be represented by 0 = ( ) 1 0 and 1 = ( ) 0. 1
28 Quantum states and quantum bits Suppose a quantum system have two (discrete) measurable physical sates, say, up spin and down spin of a particle. They will be represented by 0 = ( ) 1 0 and 1 = ( ) 0. 1 Inside the black box, the vector state may be in superposition state (the famous Schrödinger cat which could be half alive and half dead) represented by ( ) α v = ψ = α 0 + β 1 = C 2, α 2 + β 2 = 1. β
29 Quantum states and quantum bits Suppose a quantum system have two (discrete) measurable physical sates, say, up spin and down spin of a particle. They will be represented by 0 = ( ) 1 0 and 1 = ( ) 0. 1 Inside the black box, the vector state may be in superposition state (the famous Schrödinger cat which could be half alive and half dead) represented by ( ) α v = ψ = α 0 + β 1 = C 2, α 2 + β 2 = 1. β In quantum mechanics/computing, one uses such a basic quantum state/ quantum bit (qubit).
30 In fact, it is more convenient to represent the quantum state ψ as a rank one orthogonal projection: ( ) 1 + z x + iy Q = vv = ψ ψ = 1 2 x iy 1 z with x, y, z R such that x 2 + y 2 + z 2 = 1.
31 In fact, it is more convenient to represent the quantum state ψ as a rank one orthogonal projection: ( ) 1 + z x + iy Q = vv = ψ ψ = 1 2 x iy 1 z with x, y, z R such that x 2 + y 2 + z 2 = 1. There is a Bloch sphere representation of a qubit
32 Quantum gates and quantum operations The state of k qubits is represented as the tensor product of k 2 2 matrices Q 1 Q k.
33 Quantum gates and quantum operations The state of k qubits is represented as the tensor product of k 2 2 matrices Q 1 Q k. To accommodate various quantum effects, one considers 2 k 2 k density matrices, i.e., trace one positive semidefinite Hermitian matrices.
34 All quantum gates and quantum evolutions (for a closed system) are unitary similarity transforms of the density matrices representing the states, i.e., A(t) U(t)A(0)U(t) for unitaries U(t).
35 All quantum gates and quantum evolutions (for a closed system) are unitary similarity transforms of the density matrices representing the states, i.e., A(t) U(t)A(0)U(t) for unitaries U(t). All quantum operations, quantum channels, quantum measurement, etc. are (trace preserving) completely positive linear map Φ
36 All quantum gates and quantum evolutions (for a closed system) are unitary similarity transforms of the density matrices representing the states, i.e., A(t) U(t)A(0)U(t) for unitaries U(t). All quantum operations, quantum channels, quantum measurement, etc. are (trace preserving) completely positive linear map Φ admitting the operator sum representation A r X i AXj, j=1 with r j=1 X j X j = I in case Φ is trace preserving.
37 Some sample matrix problems Quantum control. For a given a subgroup K of the group of unitary matrices and for given density matrices A and B, determine min UAU B F = A 2 F + B 2 F 2 max Re tr (UAU B ). U K U K
38 Some sample matrix problems Quantum control. For a given a subgroup K of the group of unitary matrices and for given density matrices A and B, determine min UAU B F = A 2 F + B 2 F 2 max Re tr (UAU B ). U K U K Here X F = (tr X X) 1/2 is the Frobenius norm.
39 Some sample matrix problems Quantum control. For a given a subgroup K of the group of unitary matrices and for given density matrices A and B, determine min UAU B F = A 2 F + B 2 F 2 max Re tr (UAU B ). U K U K Here X F = (tr X X) 1/2 is the Frobenius norm. More generally, for given density matrices A 0, A 1,..., A m and t 1,..., t m 0 summing up to 1, determine m min t j U j A j Uj A 0 : U 1,..., U m K. F j=1
40 Construction of quantum operations Let A 1,..., A m M r and B 1,..., B m M s be density matrices.
41 Construction of quantum operations Let A 1,..., A m M r and B 1,..., B m M s be density matrices. Can we find a quantum operation (trace preserving completely positive linear map) Φ : M r M s such that Φ(A j ) = B j for j = 1,..., m?
42 Construction of quantum operations Let A 1,..., A m M r and B 1,..., B m M s be density matrices. Can we find a quantum operation (trace preserving completely positive linear map) Φ : M r M s such that Φ(A j ) = B j for j = 1,..., m? This can be viewed as an interpolating problem.
43 Quantum error correction For a given quantum channel Φ : M n M n, can we find a k-dimensional quantum error correction code,
44 Quantum error correction For a given quantum channel Φ : M n M n, can we find a k-dimensional quantum error correction code, i.e., a k-dimensional subspace V of C n such that Φ(A) = A for all A M n satisfying P V AP V = A, where P V is the orthogonal projection of C n onto V.
45 Quantum error correction For a given quantum channel Φ : M n M n, can we find a k-dimensional quantum error correction code, i.e., a k-dimensional subspace V of C n such that Φ(A) = A for all A M n satisfying P V AP V = A, where P V is the orthogonal projection of C n onto V. This gives rise to problems in rank k-numerical ranges Λ k (A) C.
46 General questions and formalisms In general, given Hermitian matrices A 1,..., A m, determine submatrices of UA 1 U,..., UA m U with special structure.
47 General questions and formalisms In general, given Hermitian matrices A 1,..., A m, determine submatrices of UA 1 U,..., UA m U with special structure. One may use the theory in operator algebras to provide the formalisms.
48 General questions and formalisms In general, given Hermitian matrices A 1,..., A m, determine submatrices of UA 1 U,..., UA m U with special structure. One may use the theory in operator algebras to provide the formalisms. Researchers also used algebraic techniques, topological techniques, etc. to study the problems.
49 General questions and formalisms In general, given Hermitian matrices A 1,..., A m, determine submatrices of UA 1 U,..., UA m U with special structure. One may use the theory in operator algebras to provide the formalisms. Researchers also used algebraic techniques, topological techniques, etc. to study the problems. There are also problems on crytology, complexity, etc.
50 General questions and formalisms In general, given Hermitian matrices A 1,..., A m, determine submatrices of UA 1 U,..., UA m U with special structure. One may use the theory in operator algebras to provide the formalisms. Researchers also used algebraic techniques, topological techniques, etc. to study the problems. There are also problems on crytology, complexity, etc. Conclusion It is a wonderful interdisciplinary rsearch area. You are welcome to explore more and join the club!
Lecture 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 informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More information*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
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 informationQuantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationQuantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
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 informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
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 informationGreat Ideas in Theoretical Computer Science. Lecture 28: A Gentle Introduction to Quantum Computation
5-25 Great Ideas in Theoretical Computer Science Lecture 28: A Gentle Introduction to Quantum Computation May st, 208 Announcements Please fill out the Faculty Course Evaluations (FCEs). https://cmu.smartevals.com
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 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 informationSecrets of Quantum Information Science
Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More information)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI
Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1
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 informationCLASSIFICATION OF COMPLETELY POSITIVE MAPS 1. INTRODUCTION
CLASSIFICATION OF COMPLETELY POSITIVE MAPS STEPHAN HOYER ABSTRACT. We define a completely positive map and classify all completely positive linear maps. We further classify all such maps that are trace-preserving
More informationQUANTUM ENTANGLEMENT AND ITS ASPECTS. Dileep Dhakal Masters of Science in Nanomolecular Sciences
QUANTUM ENTANGLEMENT AND ITS ASPECTS Dileep Dhakal Masters of Science in Nanomolecular Sciences Jacobs University Bremen 26 th Nov 2010 Table of Contents: Quantum Superposition Schrödinger s Cat Pure vs.
More informationThe PANORAMA. Numerical Ranges in. Modern Times. Man-Duen Choi 蔡文端. For the 12 th WONRA.
The PANORAMA of Numerical Ranges in Modern Times Man-Duen Choi 蔡文端 choi@math.toronto.edu For the 12 th WONRA In the last century, Toeplitz-Hausdorff Theorem, Ando-Arveson Dilation Theorem, In the 21 st
More informationUnitary rotations. October 28, 2014
Unitary rotations October 8, 04 The special unitary group in dimensions It turns out that all orthogonal groups SO n), rotations in n real dimensions) may be written as special cases of rotations in a
More informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationHow quantum computation gates can be realized in terms of scattering theory approach to quantum tunneling of charge transport
ISSN: 2347-3215 Volume 3 Number 3 (March-2015) pp. 62-66 www.ijcrar.com How quantum computation gates can be realized in terms of scattering theory approach to quantum tunneling of charge transport Anita
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 informationWhat is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.
What is a quantum computer? Quantum Architecture by Murat Birben A quantum computer is a device designed to take advantage of distincly quantum phenomena in carrying out a computational task. A quantum
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 informationPhysics 239/139 Spring 2018 Assignment 6
University of California at San Diego Department of Physics Prof. John McGreevy Physics 239/139 Spring 2018 Assignment 6 Due 12:30pm Monday, May 14, 2018 1. Brainwarmers on Kraus operators. (a) Check that
More informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
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 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
More informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
More informationStochastic Quantum Dynamics I. Born Rule
Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible
More informationBasic Notation and Background
Department of Mathematics, The College of William and Mary, Williamsburg, Virginia, USA; Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi, P.R. of China. Hilbert spaces The
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 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 informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
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 informationexample: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω
Dynamics of a Quantum System: QM postulate: The time evolution of a state ψ> of a closed quantum system is described by the Schrödinger equation where H is the hermitian operator known as the Hamiltonian
More information1 Measurements, Tensor Products, and Entanglement
Stanford University CS59Q: Quantum Computing Handout Luca Trevisan September 7, 0 Lecture In which we describe the quantum analogs of product distributions, independence, and conditional probability, and
More informationINTRODUCTORY NOTES ON QUANTUM COMPUTATION
INTRODUCTORY NOTES ON QUANTUM COMPUTATION Keith Hannabuss Balliol College, Oxford Hilary Term 2009 Notation. In these notes we shall often use the physicists bra-ket notation, writing ψ for a vector ψ
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 informationphys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference
Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)
More informationIntroduction to Quantum Computing for Folks
Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum
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 informationFuture of Quantum Science and Technology
Future of Quantum Science and Technology Serge Haroche S.H &D.Wineland, 2012 Nobel in Physics Quantum theory has opened to us the microscopic world of particles, atoms and photons.and has given us the
More informationLecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States
Lecture 13B: Supplementary Notes on Advanced Topics Outer Products, Operators, Density Matrices In order to explore the complexity of many particle systems a different way to represent multiparticle states
More information- Why aren t there more quantum algorithms? - Quantum Programming Languages. By : Amanda Cieslak and Ahmana Tarin
- Why aren t there more quantum algorithms? - Quantum Programming Languages By : Amanda Cieslak and Ahmana Tarin Why aren t there more quantum algorithms? there are only a few problems for which quantum
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationS.K. Saikin May 22, Lecture 13
S.K. Saikin May, 007 13 Decoherence I Lecture 13 A physical qubit is never isolated from its environment completely. As a trivial example, as in the case of a solid state qubit implementation, the physical
More informationquantum mechanics is a hugely successful theory... QSIT08.V01 Page 1
1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails
More informationQuantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
More informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More information1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation
QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationWhy Quantum Technologies?
Why Quantum Technologies? Serge Haroche Quantum Europe 2017 Malta, February 17 th 2017 Quantum theory has opened to us the microscopic world of particles, atoms and photons.and has given us the keys of
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationQLang: Qubit Language
QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated
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 informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationGates for Adiabatic Quantum Computing
Gates for Adiabatic Quantum Computing Richard H. Warren Abstract. The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle
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 Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationSolution 4 for USTC class Physics of Quantum Information
Solution 4 for 2018 2019 USTC class Physics of Quantum Information Shuai Zhao, Xin-Yu Xu, Kai Chen National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of
More informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
More informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
More informationQuantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
More informationQuantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.
Quantum Algorithms Andreas Klappenecker Texas A&M University Lecture notes of a course given in Spring 003. Preliminary draft. c 003 by Andreas Klappenecker. All rights reserved. Preface Quantum computing
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationQuantum Entanglement and Error Correction
Quantum Entanglement and Error Correction Fall 2016 Bei Zeng University of Guelph Course Information Instructor: Bei Zeng, email: beizeng@icloud.com TA: Dr. Cheng Guo, email: cheng323232@163.com Wechat
More informationThe Framework of Quantum Mechanics
The Framework of Quantum Mechanics We now use the mathematical formalism covered in the last lecture to describe the theory of quantum mechanics. In the first section we outline four axioms that lie at
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
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 informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
More informationThe Theory of Quantum Information
The Theory of Quantum Information John Watrous Institute for Quantum Computing University of Waterloo 2018 John Watrous To be published by Cambridge University Press. Please note that this is a draft,
More informationIntroduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
More information4th year Project demo presentation
4th year Project demo presentation Colm Ó héigeartaigh CASE4-99387212 coheig-case4@computing.dcu.ie 4th year Project demo presentation p. 1/23 Table of Contents An Introduction to Quantum Computing The
More informationLecture 2: Introduction to Quantum Mechanics
CMSC 49: Introduction to Quantum Computation Fall 5, Virginia Commonwealth University Sevag Gharibian Lecture : Introduction to Quantum Mechanics...the paradox is only a conflict between reality and your
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More informationShort introduction to Quantum Computing
November 7, 2017 Short introduction to Quantum Computing Joris Kattemölle QuSoft, CWI, Science Park 123, Amsterdam, The Netherlands Institute for Theoretical Physics, University of Amsterdam, Science Park
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 informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
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 informationExample: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.
Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell
More informationQuantum Error Correction Codes - From Qubit to Qudit
Quantum Error Correction Codes - From Qubit to Qudit Xiaoyi Tang Paul McGuirk December 7, 005 1 Introduction Quantum computation (QC), with inherent parallelism from the superposition principle of quantum
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 informationOptimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit
with Ultracold Trapped Atoms at the Quantum Speed Limit Michael Goerz May 31, 2011 with Ultracold Trapped Atoms Prologue: with Ultracold Trapped Atoms Classical Computing: 4-Bit Full Adder Inside the CPU:
More informationIntroduction to Quantum Logic. Chris Heunen
Introduction to Quantum Logic Chris Heunen 1 / 28 Overview Boolean algebra Superposition Quantum logic Entanglement Quantum computation 2 / 28 Boolean algebra 3 / 28 Boolean algebra A Boolean algebra is
More informationQuantum gate. Contents. Commonly used gates
Quantum gate From Wikipedia, the free encyclopedia In quantum computing and specifically the quantum circuit model of computation, a quantum gate (or quantum logic gate) is a basic quantum circuit operating
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 informationExperimental Quantum Computing: A technology overview
Experimental Quantum Computing: A technology overview Dr. Suzanne Gildert Condensed Matter Physics Research (Quantum Devices Group) University of Birmingham, UK 15/02/10 Models of quantum computation Implementations
More informationApplication of Structural Physical Approximation to Partial Transpose in Teleportation. Satyabrata Adhikari Delhi Technological University (DTU)
Application of Structural Physical Approximation to Partial Transpose in Teleportation Satyabrata Adhikari Delhi Technological University (DTU) Singlet fraction and its usefulness in Teleportation Singlet
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationThe Nobel Prize in Physics 2012
The Nobel Prize in Physics 2012 Serge Haroche Collège de France and École Normale Supérieure, Paris, France David J. Wineland National Institute of Standards and Technology (NIST) and University of Colorado
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 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 informationD.5 Quantum error correction
D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the
More informationOpen Quantum Systems
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 77 Open Quantum Systems Effects in Interferometry, Quantum Computation, and Adiabatic Evolution JOHAN
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 informationDecomposition of Quantum Gates
Decomposition of Quantum Gates With Applications to Quantum Computing Dean Katsaros, Eric Berry, Diane C. Pelejo, Chi-Kwong Li College of William and Mary January 12, 215 Motivation Current Conclusions
More information