Ismétlés. General model of quantum algorithms InitializationParallelization Amplitude ampl. Measu- rement Classical input Classical output Quantum output.

Slides:



Advertisements
Similar presentations
A Quantum Programming Language
Advertisements

University of Strathclyde
prime factorization algorithm found by Peter Shor 1994
Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Computing MAS 725 Hartmut Klauck NTU
The Hidden Subgroup Problem. Problem of great importance in Quantum Computation Most Q.A. that run exponentially faster than their classical counterparts.
Quantum Phase Estimation using Multivalued Logic.
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.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
Quantum Theory Made Easy 0 1 Classical p0p0 p1p1 probabilities Quantum a0a0 a1a1 0 1 amplitudes p 0 +p 1 =1|a 0 | 2 +|a 1 | 2 =1 bit qubit p i is a real.
Shor Algorithm Anuj Dawar. Finding the eigenvalue is the same as finding its phase 
Quantum Computing Joseph Stelmach.
Quantum Search Algorithms for Multiple Solution Problems EECS 598 Class Presentation Manoj Rajagopalan.
Anuj Dawar.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
Shor’s Algorithm Osama Awwad Department of Computer Science Western Michigan University July 12, 2015.
Quantum Algorithms Preliminaria Artur Ekert. Computation INPUT OUTPUT Physics Inside (and outside) THIS IS WHAT OUR LECTURES WILL.
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.
Small-Depth Quantum Circuits Frederic Green Department of Math/CS Clark University Worcester, MA.
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
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.
Shor’s Algorithm -basic introduction –. The main goal for Shor’s Alg. Find the factors of a certain integer – Why?... Long story short: prime factors,
QUANTUM COMPUTING Part II Jean V. Bellissard
Quantum Computing and Quantum Programming Language
Quanum computing. What is quantum computation? New model of computing based on quantum mechanics. Quantum circuits, quantum Turing machines More powerful.
Shor’s Factoring Algorithm
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.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Quantum Computing & Algorithms
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing.
Capabilities and limitations of quantum computers Michele Mosca 1 November 1999 ECC ’99.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
1 Transactional Nature of Quantum Information Subhash Kak Computer Science, Oklahoma State Univ © Subhash Kak, June 2009.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
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.
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.
Shor's Factorization Algorithm Keith Kelley, CS 6800.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Quantum Circuit Visualization
Introduction to Quantum Computing Lecture 1 of 2
A low cost quantum factoring algorithm
Quantum Circuits and Algorithms
Four approaches to Shor
Quantum Computing: What’s It Good For?
Chap 5 Q Fourier Transform: p
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Qubit Recycling in Quantum Computation
OSU Quantum Information Seminar
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Quantum Computing Joseph Stelmach.
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 4 (2005) Richard Cleve DC 653
Presentation transcript:

Ismétlés

General model of quantum algorithms InitializationParallelization Amplitude ampl. Measu- rement Classical input Classical output Quantum output Quantum input

A Deutsch-Józsa algoritmus

Deutsch-Józsa-algoritmus

Quantum Fourier Transform

Classical Quantum Classical Discrete Fourier Transform (DFT) Quantum Discrete Fourier Transform (QFT)

How to implement QFT 3 Copyright © 2005 John Wiley & Sons Ltd.

How to implement QFT 6 Remarks –Complexity: –QFT is not for computing Fourier coefficients in a faster way since they are represented by probability amplitudes!

Kérjük kedves utasainkat ellenőrizzék az Önök előtti ülés háttámlájában található biztonsági útmutatót. A mentőmellények a székek alatt találhatók, a vészkijárat jobb hátul. Kérjük csatolják be biztonsági öveiket és fejezzék be a dohányzást! Felszállunk.

Quantum Phase Estimation

The problem Each unitary transform having eigenvector has eigenvalues in the form of. Phase ratio:

Idealistic case – back to the QFT

Quantum Phase Estimator How to initialize ?

Practical case IQFT will work not correctly

Prob. amplitudes

Error analysis

Quantum Phase Estimator

Error analysis

The RSA algorithm

Order finding – Shor algorithm

Connection between factoring and order finding

Prime factorization

The Shor Algoritm Ki, hogy csinálná??????

General model of quantum algorithms InitializationParallelization Amplitude ampl. Measu- rement Classical input Classical output Quantum output Quantum input

From quregister to tensor product of qubits Phase estimator: Shor: Connection between them:

Uniformly distributed eigenvectors by means of initialization of the lower quregister:

Using Shor’s order finding algorithm to break RSA

QFT as a generalized Hadamard Transform Hadamard: QFT:

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2024 SlidePlayer.com Inc. All rights reserved.