Lecture 22, Tues April 11: Grover The next quantum algorithm we’ll cover is… Grover’s Algorithm which was discovered in 1995, shortly after Shor’s algorithm. Both Grover and Shor were working at Bell Labs at the

Source URL: www.scottaaronson.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Emerging technologies
• Quantum computing
• Quantum algorithms
• Quantum information science
• Quantum algorithm
• Algorithm
• P versus NP problem
• NP
• PP

Lecture 20, Tues April 4: Shor, Quantum Fourier Transform Last time we started in on Shor’s algorithm, a quantum algorithm that can factor ​N​ into ​p​×​q​ in polynomial time by reducing the problem to per

Source URL: www.scottaaronson.com

• Mathematical analysis
• Mathematics
• Mathematical logic
• Set theory
• Operator theory
• Code
• Inner model theory
• Partial differential equations
• Complex analysis
• Omega-regular language
• Differential forms on a Riemann surface

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

Source URL: www.scottaaronson.com

• Quantum mechanics
• Physics
• Theoretical physics
• Chemistry
• Mathematical formulation of quantum mechanics
• Quantum superposition
• Unitary transformation
• Quantum computing
• Hamiltonian
• Quantum algorithm
• Degenerate energy levels
• Schrdinger equation

Span-Program-Based Quantum Algorithm for Evaluating Formulas

Source URL: www.ucw.cz

CSE 599d - Quantum Computing Grover’s Algorithm Dave Bacon Department of Computer Science & Engineering, University of Washington After Peter Shor demonstrated that quantum computers could efficiently factor, great in

Source URL: courses.cs.washington.edu

The Efficiency of a Cluster Algorithm for the Quantum Heisenberg Model on a Kagome Lattice Masterarbeit der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern

Source URL: www.wiese.itp.unibe.ch

CPSC: Quantum Computation John Watrous, University of Calgary Lecture 6: Simon’s algorithm February 2, 2006

Source URL: cs.uwaterloo.ca

Span-program-based quantum algorithm for evaluating formulas † ˇ Robert Spalek Ben W. Reichardt∗

Source URL: www.ucw.cz

Current Quantum Cryptography Algorithm Is Optimal: A Proof 1st Oscar Galindo 2 Vladik Kreinovich nd

Source URL: www.cs.utep.edu

The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

Source URL: ciim.usf.edu