Quantum Phase Estimation using Multivalued Logic.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 3
Advertisements

Quantum Circuit Decomposition
University of Queensland
Quantum Phase Estimation using Multivalued Logic Vamsi Parasa Marek Perkowski Department of Electrical and Computer Engineering, Portland State University.
Quantum Speedups DoRon Motter August 14, Introduction Two main approaches are known which produce fast Quantum Algorithms The first, and main approach.
Analysis of the Superoperator Obtained by Process Tomography of the Quantum Fourier Transform in a Liquid-State NMR Experiment Joseph Emerson Dept. of.
Department of Computer Science & Engineering University of Washington
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
Quantum Algorithms Towards quantum codebreaking Artur Ekert.
Shor Algorithm (continued) Anuj Dawar Use of number theory and reductions.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
Grover. Part 2. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z O is an Oracle H is Hadamards H.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
Ternary Deutsch’s, Deutsch-Jozsa and Affine functions Problems All those problems are not published yet.
Review of basic quantum and Deutsch-Jozsa. Can we generalize Deutsch-Jozsa algorithm? Marek Perkowski, Department of Electrical Engineering, Portland State.
“Both Toffoli and CNOT need little help to do universal QC” (following a paper by the same title by Yaoyun Shi) paper.
Shor Algorithm Anuj Dawar. Finding the eigenvalue is the same as finding its phase 
Quantum Behaviors: synthesis and measurement Martin Lukac Normen Giesecke Sazzad Hossain and Marek Perkowski Department of Electrical Engineering Portland.
Quantum Computing Joseph Stelmach.
Quantum Search Algorithms for Multiple Solution Problems EECS 598 Class Presentation Manoj Rajagopalan.
Anuj Dawar.
Authors Faisal Shah Khan Marek A. Perkowski Slides prepared by Faisal Shah Khan.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Introduction to Quantum logic (2) Yong-woo Choi.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
From finite projective geometry to quantum phase enciphering (Discrete Math of MUBs) H. Rosu, M. Planat, M. Saniga (IPICyT-Mx, LPMO-Fr, Astronomical Inst.-Sk)
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
1 Introduction to Quantum Information Processing QIC 710 / CS 678 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 / QNC 3129 Lectures.
October 1 & 3, Introduction to Quantum Computing Lecture 2 of 2 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum.
Inverting Well Conditioned Matrices in Quantum LogSpace Amnon Ta-Shma Tel-Aviv University.
Lecture note 8: Quantum Algorithms
Algorithms Artur Ekert. Our golden sequence H H Circuit complexity n QUBITS B A A B B B B A # of gates (n) = size of the circuit (n) # of parallel units.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Engineering of arbitrary U(N) transformation by quantum Householder reflections P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov.
Quantum Computing MAS 725 Hartmut Klauck NTU
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
1 Quantum Computing Lecture Eleven. 2 Outline  Shrinking sizes of electronic devices  Modern physics & quantum world  Principles of quantum computing.
QUANTUM COMPUTING Part II Jean V. Bellissard
Quantum Computing and Quantum Programming Language
Shor’s Factoring Algorithm
1/22 Quantum Algorithms Deutsch-Josza Algorithm: quantum computers are more powerful than classical ones. b f(b) b f(b) b f(b) 0 1 b f(b) 0.
Quantum Computing & Algorithms
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
What is a quantum computer? A quantum computer is any device for computation that makes use of quantum mechanical phenomena to perform operations on data,
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
A new algorithm for directed quantum search Tathagat Tulsi, Lov Grover, Apoorva Patel Vassilina NIKOULINA, M2R III.
Final Project for Phys 642: An Introduction to Quantum Information and Quantum Computing Fall 2013 Implementing a Computer Simulation of Shor’s Quantum.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
Paper Code : BCA-03 Paper Title : Mathematics Theory.
Introduction to Quantum Computing Lecture 1 of 2
Quantum simulators and hybrid algorithms
Four approaches to Shor
Chap 5 Q Fourier Transform: p
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Chap 4 Quantum Circuits: p
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
Math review - scalars, vectors, and matrices
Quantum Computing Joseph Stelmach.
Presentation transcript:

Quantum Phase Estimation using Multivalued Logic

Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion

Introduction QPE – one of the most important quantum subroutines, used in : – 1) Shor’s Algorithm – 2) Abrams and Lloyd Algorithm (Simulating quantum systems) – Calculation of Molecular Ground State Energies – 3) Quantum Counting (for Grover Search) – 4) Fourier Transform on arbitrary Z p

Abstract We generalize the Quantum Phase Estimation algorithm to MVL logic. qudits We show the quantum circuits for QPE using qudits. We derive the performance requirements of the QPE to achieve high probability of success. We show how this leads to logarithmic decrease in the number of qudits and exponential decrease in error probability of the QPE algorithm as the value of the radix d increases.

General Controlled Gates

This is nothing new, CNOT, CV, CV+ This is a new concept, but essentially the same concept and mathematics

Another new concept – we use controlled powers of some Unitary Matrix U

REMINDER OF EIGENVALUES AND EIGENVECTORS

What is eigenvalue? MATRIX * VECTOR = Constant * VECTOR Eigenvector of this Matrix Eigenvalue of this Matrix

Basic Math for Binary Phase Estimation

Finding the eigenvalue is the same as finding its phase 

Target register Index register to store the eigenvalue Unitary operator for which we calculate phase of eigenvalue using phase kickback we measure the phase We initialize to all states

Formulas for the phase estimation algorithm This is the input to QFT ()

Because e j  is an eigenvallue of U

We found phase Assume k an integer Number of bits

Concluding, we can calculate phase

Towards Generalization of Phase Estimation

Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion ISMVL 2011, May 2011, Tuusula, Finland

Abstract We generalize the Quantum Phase Estimation algorithm to MVL logic. qudits We show the quantum circuits for QPE using qudits. We derive the performance requirements of the QPE to achieve high probability of success. We show how this leads to logarithmic decrease in the number of qudits and exponential decrease in error probability of the QPE algorithm as the value of the radix d increases. ISMVL 2011, May 2011, Tuusula, Finland

Introduction QPE – one of the most important quantum subroutines, used in : – 1) Shor’s Algorithm – 2) Abrams and Lloyd Algorithm (Simulating quantum systems) – Calculation of Molecular Ground State Energies – 3) Quantum Counting (for Grover Search) – 4) Fourier Transform on arbitrary Z p ISMVL 2011, May 2011, Tuusula, Finland

Quantum phase estimation (QPE) ISMVL 2011, May 2011, Tuusula, Finland

QPE – Formal Definition ISMVL 2011, May 2011, Tuusula, Finland phase

QPE Algorithm– Binary logic case Schematic for the QPE Algorithm We first review the binary case: Eigenvector of U Measure phase in t qubits

QPE : step 1 – Initialization, Binary logic case ISMVL 2011, May 2011, Tuusula, Finland

QPE : step 2 – Apply the operator U Binary logic case

QPE : step 3 – Apply Inverse QFT Binary logic case

QPE : step 4 - Measurement If the phase  u is an exact binary fraction, we measure the estimate of the phase  u with probability of 1. If not, then we measure the estimate of the phase with a very high probability close to 1. ISMVL 2011, May 2011, Tuusula, Finland Binary logic case

Quantum circuit for u j The circuit for QFT is well known and hence not discussed. Binary logic case

Multiple- Valued Phase Estimation

MV logic case Now we have qudits not qubits We have t qudits for phase Now we have arbitrary Chrestenson instead Hadamard Now we Inverse QFT on base d, not base 2

QFT and Chrestenson MV logic case

ISMVL 2011, May 2011, Tuusula, Finland MV logic case

ISMVL 2011, May, Tuusula, Finland We apply inverse Quantum Fourier Transform MV logic case

ISMVL 2011, May, Tuusula, Finland MV logic case

These are d-valued quantum multiplexers

D-valued quantum multiplexers Case d= Target (date) control

ISMVL 2011, May, Tuusula, Finland MV logic case

Performance of Quantum Phase Estimation

ISMVL 2011, May, Tuusula, Finland MV logic case

ISMVL 2011, May, Tuusula, Finland binary

MV logic case

ISMVL 2011, May, Tuusula, Finland MV logic case

ISMVL 2011, May, Tuusula, Finland MV logic case

ISMVL 2011, May, Tuusula, Finland

How MVL HELPS Failure probability decreases exponentially with increase in radix d of the logic used

Less number of qudits for a given precision These are the requirements for a real world problem of calculating molecular energies

More RESULTS ISMVL 2011, May 2011, Tuusula, Finland ISMVL 2011, May, Tuusula, Finland

Conclusions Quantum Phase Estimation has many applications in Quantum Computing MVL is very helpful for Quantum Phase Estimation Using MVL causes exponential decrease in the failure probability for a given precision of phase required. Using MVL results in signification reduction in the number of qudits required as radix d increases ISMVL 2011, May 2011, Tuusula, Finland

Conclusions 2 The method creates high power unitary matrices U k of the original Matrix U for which eigenvector |u> we want to find phase. We cannot design these matrices as powers. This would be extremely wasteful We have to calculate these matrices and decompose them to gates New type of quantum logic synthesis problem: not permutative U, not arbitrary U, there are other problems like that, we found This research problem has been not solved in literature even in case of binary unitary matrices U ISMVL 2011, May 2011, Tuusula, Finland