Quantum Computing antapex量子计算的底点.pptVIP

Quantum Computing Joseph Stelmach Overview Introduction Introduction Overview Representation of Data - Qubits Representation of Data - Superposition Representation of Data - Superposition Data Retrieval Relationships among data - Entanglement Overview Operations on Qubits - Reversible Logic Quantum Gates Quantum Gates - Hadamard Quantum Gates - Controlled NOT Example Operation - Multiplication By 2 Quantum Gates - Controlled Controlled NOT (CCN) A Universal Quantum Computer Overview Shor’s Algorithm Shor’s Algorithm - Periodicity Shor’s Algorithm - In Depth Analysis Shor’s Algorithm - Preparing Data Shor’s Algorithm - Modular Arithmetic Shor’s Algorithm - Superposition Collapse Shor’s Algorithm - Entanglement Shor’s Algorithm - QFT Shor’s Algorithm - QFT Shor’s Algorithm - QFT Shor’s Algorithm - The Factors :) Shor’s Algorithm - Problems Overview Conclusion The QFT comes up short and reveals the wrong period. This probability is actually dependant on your choice of q. The larger the q, the higher the probability of finding the correct probability. The period of the series ends up being odd If either of these cases occur, we go back to the beginning and pick a new x. * * Introduction and History Data Representation Operations on Data Shor’s Algorithm Conclusion and Open Questions What is a quantum computer? A quantum computer is a machine that performs calculations based on the laws of quantum mechanics, which is the behavior of particles at the sub-atomic level. “I think I can safely say that nobody understands quantum mechanics” - Feynman 1982 - Feynman proposed the idea of creating machines based on the laws of quantum mechanics instead of the laws of classical physics. 1985 - David Deutsch developed the quantum turing machine, showing that quantum circuits are universal. 1994 - Peter Shor came up with a quantum algorithm to factor very large numbers in polynomial time. 1997 - Lov Grover develops a quantum search algorithm with O(√N) compl