Quantum algorithm

Results: 328



#Item
1Lecture 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

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

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2018-08-28 08:59:24
2Lecture 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

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

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2018-08-26 18:23:30
3Lecture 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

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

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2018-09-06 04:47:45
4Span-Program-Based Quantum Algorithm for Evaluating Formulas

Span-Program-Based Quantum Algorithm for Evaluating Formulas

Add to Reading List

Source URL: www.ucw.cz

Language: English - Date: 2012-07-07 14:33:50
    5CSE 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

    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

    Add to Reading List

    Source URL: courses.cs.washington.edu

    Language: English - Date: 2006-02-02 17:35:25
      6The Efficiency of a Cluster Algorithm for the Quantum Heisenberg Model on a Kagome Lattice Masterarbeit der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern

      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

      Add to Reading List

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

      Language: English - Date: 2011-02-14 08:55:18
        7CPSC: Quantum Computation  John Watrous, University of Calgary Lecture 6: Simon’s algorithm February 2, 2006

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

        Add to Reading List

        Source URL: cs.uwaterloo.ca

        Language: English - Date: 2013-03-20 12:24:49
          8Span-program-based quantum algorithm for evaluating formulas † ˇ Robert Spalek  Ben W. Reichardt∗

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

          Add to Reading List

          Source URL: www.ucw.cz

          Language: English - Date: 2008-12-05 23:14:08
            9Current Quantum Cryptography Algorithm Is Optimal: A Proof 1st Oscar Galindo 2 Vladik Kreinovich nd

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

            Add to Reading List

            Source URL: www.cs.utep.edu

            Language: English - Date: 2018-05-26 11:55:30
              10The 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

              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

              Add to Reading List

              Source URL: ciim.usf.edu

              - Date: 1980-01-01 00:00:00