Decomposition of Quantum Gates
|
|
- Christopher Clifford Tucker
- 6 years ago
- Views:
Transcription
1 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
2 Motivation Current Conclusions and Schemes Another Important Scheme Future Directions
3 Motivation Qubit Classical computers store information in bits, vs qubits in a Quantum computer
4 Motivation Qubit Classical computers store information in bits, vs qubits in a Quantum computer Quantum Gates Quantum gates are similar to logic gates in classical computing, in that they are used to manipulate a quantum system
5 Motivation Qubits and Quantum Gates have Mathematical Realizations
6 Motivation Qubits and Quantum Gates have Mathematical Realizations Qubits are vectors
7 Motivation Qubits and Quantum Gates have Mathematical Realizations Qubits are vectors Quantum Gates are Unitary Matrices
8 Motivation Qubits are Quantum Systems
9 Motivation Qubits are Quantum Systems Letting apple i, apple 1i be apple two measureables, the vector (qubit) a 1 b = a + b represents the superposition a i + b 1i 1
10 Motivation Qubits are Quantum Systems Letting apple i, apple 1i be apple two measureables, the vector (qubit) a 1 b = a + b represents the superposition a i + b 1i 1 We concatenate 2+ qubits into multi-qubit quantum ensembles via tensor products:
11 Motivation Qubits are Quantum Systems Letting apple i, apple 1i be apple two measureables, the vector (qubit) a 1 b = a + b represents the superposition a i + b 1i 1 We concatenate 2+ qubits into multi-qubit quantum ensembles via tensor products: apple a b apple c d = 2 3 ac 6ad 4bc5 bd
12 Motivation Quantum Computing Letting apple i, apple 1i be apple two measureables, a qubit a 1 b = a + b represents the superposition a i + b 1i 1 We concatenate 2+ qubits into multi-qubit quantum ensembles via tensor products: apple a b apple c d = 2 3 ac 6ad 4bc5 bd This 2-qubit system has 4 measureables, represented by the basis vectors of C 4.
13 Motivation Example. Consider further apple a b apple c d = 2 3 ac 6ad 4bc5 bd
14 Motivation Example. Consider further apple a b apple c d = 2 3 ac 6ad 4bc5 bd I The basis vectors, corresponding to physical measureables, of the above bipartite or joint quantum state are e 1 = 6 4 5, e 2 = 6 4 5, e 3 = , and e 4 =
15 Example. I We use the physicists notation; i = , 1i = , 1i = , 11i =
16 motivation Example. I We use the physicists notation; i = , 1i = , 1i = , 11i = So, ac ad bc bd 3 5 = ac i + ad 1i + bc 1i + bd 11i
17 Motivation Question: How Many Measureables does a 64-qubit multipartite system have?
18 Motivation Some other operations Let A, B 2 M 2. The tensor product of A and B is A B = apple a11 B a 12 B a 21 B a 22 B. The direct sum of A and B is defined as A B = apple A B, where 2 M 2.
19 Motivation Quantum Gates reign things in An n-qubit system has 2 n measureable states, and a classical computer has to deal with each of these...
20 Motivation Quantum gates reign things in An n-qubit system has 2 n measureable states, and a classical computer has to deal with each of these... A Quantum computer uses Quantum, orunitary, Gates (Unitary matrices) to handle these n-qubit systems in a single operation.
21 Motivation Definition AmatrixU 2 M n (C) isunitaryifu U = U U = I where denotes the conjugate transpose. Important Properties U is invertible and U 1 = U The rows and columns of U are orthonormal
22 Motivation-Example Quantum Gates in 1 qubit Hadamard Gate The Hadamard gate, H, is a commonly used gate where H = 1 p 2 apple Pauli Matrices x = apple 1 1 y = z = apple i i apple 1 1
23 Motivation The set of Quantum Gates a quantum computer can generate directly determines its capability.
24 Motivation The set of Quantum Gates a quantum computer can generate directly determines its capability. Obviously, we do not want to limit our systems possible operations...
25 Motivation The set of Unitary Gates a quantum computer can generate directly determines its capability. Obivously, we do not want to limit our systems possible operations... We can do even better: How can we not only allow for all operations, but have an e cient generating set of simple unitaries?
26 A Decomposition Scheme-2 Qubit Case Experimentalists are working on possible physical manifestations in the 1-4 qubit cases. 2 Qubits Corresponds to 4-by-4 Unitaries There are two types of gates that are easy to implement 1-control gates Free-gates
27 A Decomposition Scheme-2 Qubit Case Experimentalists are working on possible physical manifestations in the 1-4 qubit cases. 2 Qubits Corresponds to 4-by-4 Unitaries There are two types of gates that are easy to implement 1-control gates Free-gates Experimentalists find these to be simple to implement.
28 Decomposition of Quantum Gates-2 Qubit Case 1-Control Gates (1V )=I 2 V (V )=V I v 11 v 12 (V ) = 6 1 4v 21 v (V 1) = 6 v 11 v v 21 v 22
29 Decomposition of Quantum Gates-2 Qubit Case Free-Gates (V ) =V I 2 = ( V )=I 2 V = 2 3 v 11 v 12 6 v 11 v 12 4v 21 v 22 5 v 21 v v 11 v 12 6v 21 v 22 4 v 11 v 12 5 v 21 v 22
30 A Decomposition Scheme-2 Qubit Case Whats the di erence? Consider a 2-qubit Vector State q = a i + a 1 1i + a 2 1i + a 3 11i.
31 A Decomposition Scheme-2 Qubit Case Whats the di erence? Consider a 2-qubit Vector State q = a i + a 1 1i + a 2 1i + a 3 11i. Operating on this system with a free-gate, ( V ), yields (I V )(q) = i V (a i + a 1 1i)+ 1i V (a 2 i + a 3 1i).
32 A Decomposition Scheme-2 Qubit Case Whats the di erence? Consider a 2-qubit Vector State q = a i + a 1 1i + a 2 1i + a 3 11i. Operating on this system with a free-gate, ( V ), yields (I V )(q) = i V (a i + a 1 1i)+ 1i V (a 2 i + a 3 1i). Operating on this system with a 1-control gate, (1V), yields (I V )(q) =a i + a 1 1i + 1iV (a 2 i + a 3 1i).
33 A Decomposition Scheme-2 Qubit Case Whats the di erence? Consider a 2-qubit Vector State q = a i + a 1 1i + a 2 1i + a 3 11i. Operating on this system with a free-gate, (*V), yields (I V )(q) = i V (a i + a 1 1i)+ 1i V (a 2 i + a 3 1i). Operating on this system with a 1-control gate, (1V), yields (I V )(q) =a i + a 1 1i + 1iV (a 2 i + a 3 1i). 1-controls, or controlled gates, in general, are named so because they act solely on some of the components of a multi-partite state, and leave the rest alone (computationally expensive!)
34 A Decomposition Scheme-2 Qubit case Previous Result(Li, Roberts, Yin) Using control gates, one can decompose an arbitrary n-by-n n unitary matrix into a product of at most 2 unitary matrices I P-unitary matrices are (1V ), (V ), (V 1), and v 11 v 12 4 v 21 v
35 A Decomposition Scheme-2 Qubit case Previous Result(Li, Roberts, Yin) Using control gates, one can decompose an arbitrary n-by-n n unitary matrix into a product of at most 2 unitary matrices I P-unitary matrices are (1V ), (V ), (V 1), and i.e. n k = n! k!(n k)! v 11 v 12 4 v 21 v
36 A Decomposition Scheme-2 Qubit case Previous Result(Li, Roberts, Yin) One can decompose an arbitrary n-by-n unitary matrix into a n product of at most 2 P-unitary matrices I P-unitary matrices are (1V ), (V ), (V 1), and i.e v 11 v 12 4 v 21 v n k = n! k!(n k)!. For 4-by-4, at most 6 unitary matrices. For 8-by-8, at most 14 unitary matrices. etc.
37 A Decomposition Scheme-2 Qubit case The above decomposition scheme heavily utilized control gates. The next step was to introduce free-gates into the decomposition, and achieve a lowest possible cost.
38 A Decomposition Scheme-2 Qubit case The above decomposition scheme heavily utilized control gates. The next step was to introduce free-gates into the decomposition, and achieve a lowest possible cost. More Important Results (Li, Pelejo) In the 4-by-4 case, 3 1-control gates is enough for any unitary
39 A Decomposition Scheme-2 Qubit case The above decomposition scheme heavily utilized control gates. The next step was to introduce free-gates into the decomposition, and achieve a lowest possible cost. More Important Results (Li, Pelejo) In the 4-by-4 case, 3 1-control gates is enough for any unitary We can always freely transform a 4-by-4 1-control gate into a (1V) gate
40 A Decomposition Scheme-2 Qubit case The above decomposition scheme heavily utilized control gates. The next step was to introduce free-gates into the decomposition, and achieve a lowest possible cost. More Important Results (Li, Pelejo) In the 4-by-4 case, 3 1-control gates is enough for any unitary We can always freely transform a 4-by-4 1-control gate into a (1V) gate A decomposition scheme was developed and extended to all n, as well as a recursive formula giving the number of free and k-control gates that could be used to decompose an arbitrary unitary.
41 A Decomposition Scheme-2 Qubit case The above decomposition scheme heavily utilized control gates. The next step was to introduce free-gates into the decomposition, and achieve a lowest possible cost. More Important Results (Li, Pelejo) In the 4-by-4 case, 3 1-control gates is enough for any unitary We can always freely transform a 4-by-4 1-control gate into a (1V) gate A decomposition scheme was developed and extended to all n, as well as a recursive formula giving the number of free and k-control gates that could be used to decompose an arbitrary unitary. We want(ed) to further reduce the number of controls!
42 Current Scheme Questions: How many gates are necessary, and, specifically, how many 1-control gates are necessary and su cient? What is the most e unitaries? cient scheme for decomposing general 1-control gates are a metaphoric cost in a decomposition!
43 Current Scheme How should one attack the problem? What can we do for free that simplifies the problem, or gives telling information about our candidate?
44 Current Scheme How should one attack the problem? What can we do for free that simplifies the problem, or gives telling information about our candidate? (?)
45 Current Scheme How should one attack the problem? What can we do for free that simplifies the problem, or gives telling information about our candidate? (?) Switch focus from finding ways to decompose a matrix, to finding out what must be true if the matrix can be written as a product of free gates, free gates and a single 1-control gate, etc.
46 Current Scheme Example in 4-by-4 case If a matrix M can be decomposed using only free gates, it can be written as M = A B, Where A and B are 2-by-2 unitary matrices.
47 Current Scheme Example in 4-by-4 case If a matrix M can be decomposed using only free gates, it can be written as M = A B, Where A and B are 2-by-2 unitary matrices. (?) This requires that each block be a scalar multiple of some unitary!
48 Current Scheme Example in 4-by-4 case If a matrix M can be decomposed using only free gates, it can be written as M = A B, Where A and B are 2-by-2 unitary matrices. (?) This requires that each block be a scalar multiple of some unitary! If M can be decomposed using free gates, and a single 1-control, then it can be written as M =(A B)(I 2 W )(E F ), Where A, B, W, E, F all unitary.
49 Current Scheme Recall the Singular Value Decomposition For any matrix A 2 M n, there is a unitary equivalence of A yielding a diagonal matrix, with entries the singular values of A
50 Our Scheme Recall the Singular Value Decomposition For any matrix A 2 M n, there is a unitary equivalence of A yielding a diagonal matrix, with entries the singular values of A Example. M = apple i i.
51 Current Scheme Recall the Singular Value Decomposition For any matrix A 2 M n, there is a unitary equivalence of A yielding a diagonal matrix, with entries the singular values of A Example. M = apple i i. Its singular value decomposition yields the factorization, M = U V = apple i i apple 1 1 apple 1 1.
52 Sidenote Not Gate The unitary matrix apple 1 1 is known as the Not Gate. I It is important-a class of controlled gates utilizes its properties Ex., the CNOT Gate is
53 Current Scheme Number of necessary 1-control gates apple M11 M We let M = 12 be a general 4 4 unitary matrix. By the M 21 M 22 SVD, there exist unitary U and V such that V M 11 U = C = diag(c 1, c 2 ). So where S = diag(s 1, s 2 ). (I 2 V ) M (I 2 U) = apple C SU VS VCU, Our Scheme revolves around the values of c 1 and c 2
54 Current Scheme Free Decomposition (Theorem) Given a 4 by 4 unitary matrix M = apple M11 M 12 M 21 M 22 =(I 2 V ) apple C SU VS VCU (I 2 U), Letting C = diag(c 1, c 2 ). Then, M is a product of free gates if and only if c 1 = c 2 and s 1 UV + c 1 UV and s 1 c 1 V are scalar matrices. I i.e., for a given unitary, check three things, and you ll know whether controlled gates are needed for decomposition!
55 Current Scheme One 1-Control and Free Gates (Theorem) Again, take a unitary and write it as M = apple apple M11 M 12 =(I M 21 M 2 V ) C SU 22 VS VCU (I 2 U). Then, M is a product of free gates and one 1-control gate if and only if either, (i) c 1 = c 2 and C, S, U, and V are simultaneously unitarily diagonalizeable. (ii) c 1 6= c 2 2 (, 1) and V, U are both scalar matrices. (iii) C and S are rank 2
56 Current Scheme 2 1-Control and Free Gates(?) We know that a unitary can be written as a product of free gates and two 1-control gates when c 1 = c 2 2 (, 1) and U, V are not simultaneously diagonalizeable. This is incomplete, c 1 6= c 2 and?
57 Another Scheme The Result of Kraus and Cirac-see [1] The authors proved that every U 2 SU(4) can be written as U =(A 1 A 2 )(exp(i(d x x x +d y y y +d z z z ))(B 1 B 2 ) with A 1, A 2, B 1, B 2 2 SU(2), d x, d y, d z 2 R.
58 Another Scheme We also know that any U 2 SU(4) is decomposable using at most three 1-control gates-[6]. We wish to know whether the two di erent schemes can be used in combination. i.e. SVD is not computationally expensive-when is it better? Can this be used to find conditions where two 1-controls are su cient? Insight into the general case
59 Future Directions Comparison of the two Schemes. Utility of Di erent Schemes Relative to Di erent Physical Manifestations. Find a quantitative operation on a matrix which determines which scheme is most e cient. Higher qubits.
60 Acknowledgements Eric Berry, Diane C. Pelejo, Dr. Chi-Kwong Li The NSF for their support through the EXTREEMS-QED grant William and Mary Mathematics
61 References B. Kraus and J.I. Cirac, Optimal Creation of Entanglement Using a Two Qubit Gate, Kazuyuki FUJII, Hiroshi OIKE and Tatsuo SUZUKI, More on the Isomorphism SU(2) SU(2) and SO(4), Stephen Bullock and Igor Markov. An Arbitrary Two-qubit Computation In 23 Elementary Gates. arxiv:quant-ph/2112 Chi-Kwong Li, Rebecca Roberts, Xiaoyan Yin Decomposition of unitary matrices and quantum gates arxiv: Chi-Kwong Li, Diane Pelejo Decomposition of quantum gates arxiv: M. Nakahara and T. Ohmi, Quantum Computing: From Linear Algebra to Physical Realizations
Principles 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 informationarxiv: v4 [quant-ph] 8 Mar 2013
Decomposition of unitary matrices and quantum gates Chi-Kwong Li, Rebecca Roberts Department of Mathematics, College of William and Mary, Williamsburg, VA 2387, USA. (E-mail: ckli@math.wm.edu, rlroberts@email.wm.edu)
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 informationLinear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
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 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 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 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 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 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 informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
More informationChapter 11 Evolution by Permutation
Chapter 11 Evolution by Permutation In what follows a very brief account of reversible evolution and, in particular, reversible computation by permutation will be presented We shall follow Mermin s account
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 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 informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
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 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 informationThe Singular Value Decomposition (SVD) and Principal Component Analysis (PCA)
Chapter 5 The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA) 5.1 Basics of SVD 5.1.1 Review of Key Concepts We review some key definitions and results about matrices that will
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 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 informationLinear Algebra (Review) Volker Tresp 2017
Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
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 informationLecture notes on Quantum Computing. Chapter 1 Mathematical Background
Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationLinear Algebra (Review) Volker Tresp 2018
Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c
More informationMath/CS 466/666: Homework Solutions for Chapter 3
Math/CS 466/666: Homework Solutions for Chapter 3 31 Can all matrices A R n n be factored A LU? Why or why not? Consider the matrix A ] 0 1 1 0 Claim that this matrix can not be factored A LU For contradiction,
More informationQuantum Geometric Algebra
ANPA 22: Quantum Geometric Algebra Quantum Geometric Algebra ANPA Conference Cambridge, UK by Dr. Douglas J. Matzke matzke@ieee.org Aug 15-18, 22 8/15/22 DJM ANPA 22: Quantum Geometric Algebra Abstract
More informationChapter III. Quantum Computation. Mathematical preliminaries. A.1 Complex numbers. A.2 Linear algebra review
Chapter III Quantum Computation These lecture notes are exclusively for the use of students in Prof. MacLennan s Unconventional Computation course. c 2017, B. J. MacLennan, EECS, University of Tennessee,
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationMaths for Signals and Systems Linear Algebra in Engineering
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE
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 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 informationSection 2.2: The Inverse of a Matrix
Section 22: The Inverse of a Matrix Recall that a linear equation ax b, where a and b are scalars and a 0, has the unique solution x a 1 b, where a 1 is the reciprocal of a From this result, it is natural
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 informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
More informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationarxiv: v3 [math.ra] 22 Aug 2014
arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William
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 informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
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 informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices
Linear maps preserving rank of tensor products of matrices Journal: Manuscript ID: GLMA-0-0 Manuscript Type: Original Article Date Submitted by the Author: -Aug-0 Complete List of Authors: Zheng, Baodong;
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 informationMath 3191 Applied Linear Algebra
Math 191 Applied Linear Algebra Lecture 8: Inverse of a Matrix Stephen Billups University of Colorado at Denver Math 191Applied Linear Algebra p.1/0 Announcements We will not make it to section. tonight,
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 information1 Linearity and Linear Systems
Mathematical Tools for Neuroscience (NEU 34) Princeton University, Spring 26 Jonathan Pillow Lecture 7-8 notes: Linear systems & SVD Linearity and Linear Systems Linear system is a kind of mapping f( x)
More informationUniversal quantum computers
F. UNIVERSAL QUANTUM COMPUTERS 169 F Universal quantum computers Hitherto we have used a practical definition of universality: since conventional digital computers are implemented in terms of binary digital
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationQuantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)
Quantum Computation Alessandra Di Pierro alessandra.dipierro@univr.it 21 Info + Programme Info: http://profs.sci.univr.it/~dipierro/infquant/ InfQuant1.html Preliminary Programme: Introduction and Background
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
More informationMAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :
MAC 0 Module Systems of Linear Equations and Matrices II Learning Objectives Upon completing this module, you should be able to :. Find the inverse of a square matrix.. Determine whether a matrix is invertible..
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 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 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 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 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 informationIs Quantum Search Practical?
DARPA Is Quantum Search Practical? George F. Viamontes Igor L. Markov John P. Hayes University of Michigan, EECS Outline Motivation Background Quantum search Practical Requirements Quantum search versus
More informationQuantum Circuits for Incompletely Specified Two-Qubit Operators
Quantum Circuits for Incompletely Specified Two-Qubit Operators arxiv:quant-ph/0401162v4 6 Jan 2005 Vivek V. Shende Igor L. Markov Department of Electrical Engineering and Computer Science The University
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
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 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 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 informationSection Partitioned Matrices and LU Factorization
Section 2.4 2.5 Partitioned Matrices and LU Factorization Gexin Yu gyu@wm.edu College of William and Mary partition matrices into blocks In real world problems, systems can have huge numbers of equations
More informationImage Registration Lecture 2: Vectors and Matrices
Image Registration Lecture 2: Vectors and Matrices Prof. Charlene Tsai Lecture Overview Vectors Matrices Basics Orthogonal matrices Singular Value Decomposition (SVD) 2 1 Preliminary Comments Some of this
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
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 informationOptimal Realizations of Controlled Unitary Gates
Optimal Realizations of Controlled nitary Gates Guang Song and Andreas Klappenecker Department of Computer Science Texas A&M niversity College Station, TX 77843-3112 {gsong,klappi}@cs.tamu.edu Abstract
More informationNotes on Solving Linear Least-Squares Problems
Notes on Solving Linear Least-Squares Problems Robert A. van de Geijn The University of Texas at Austin Austin, TX 7871 October 1, 14 NOTE: I have not thoroughly proof-read these notes!!! 1 Motivation
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
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 informationforms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
More informationLecture 6. Numerical methods. Approximation of functions
Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation
More informationNumerical Linear Algebra
Chapter 3 Numerical Linear Algebra We review some techniques used to solve Ax = b where A is an n n matrix, and x and b are n 1 vectors (column vectors). We then review eigenvalues and eigenvectors and
More information1 Matrices and matrix algebra
1 Matrices and matrix algebra 1.1 Examples of matrices A matrix is a rectangular array of numbers and/or variables. For instance 4 2 0 3 1 A = 5 1.2 0.7 x 3 π 3 4 6 27 is a matrix with 3 rows and 5 columns
More informationEcon 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis
Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide
More information7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
More informationOn PPT States in C K C M C N Composite Quantum Systems
Commun. Theor. Phys. (Beijing, China) 42 (2004) pp. 25 222 c International Academic Publishers Vol. 42, No. 2, August 5, 2004 On PPT States in C K C M C N Composite Quantum Systems WANG Xiao-Hong, FEI
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
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 informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More 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 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: v3 [quant-ph] 17 Sep 2017
Quantum Error Correction using Hypergraph States Shashanka Balakuntala and Goutam Paul # Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641 004, India,
More informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More informationSingular Value Decomposition
Chapter 6 Singular Value Decomposition In Chapter 5, we derived a number of algorithms for computing the eigenvalues and eigenvectors of matrices A R n n. Having developed this machinery, we complete our
More informationMath 2331 Linear Algebra
2.2 The Inverse of a Matrix Math 2331 Linear Algebra 2.2 The Inverse of a Matrix Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu,
More informationThe Principles of Quantum Mechanics: Pt. 1
The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018
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 information