Aaronson

Results: 149



#Item
21The Need for Structure in Quantum Speedups Scott Aaronson∗ MIT Andris Ambainis† University of Latvia and IAS, Princeton

The Need for Structure in Quantum Speedups Scott Aaronson∗ MIT Andris Ambainis† University of Latvia and IAS, Princeton

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2014-02-06 14:52:01
    22Quantum Copy-Protection and Quantum Money Scott Aaronson∗ Abstract 1

    Quantum Copy-Protection and Quantum Money Scott Aaronson∗ Abstract 1

    Add to Reading List

    Source URL: www.scottaaronson.com

    Language: English - Date: 2009-05-12 21:03:22
      23Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether  a function f : [n] → [n] is a

      Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether  a function f : [n] → [n] is a

      Add to Reading List

      Source URL: www.scottaaronson.com

      Language: English - Date: 2011-10-21 00:13:04
        24BQP and the Polynomial Hierarchy Scott Aaronson∗ Abstract The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve

        BQP and the Polynomial Hierarchy Scott Aaronson∗ Abstract The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve

        Add to Reading List

        Source URL: www.scottaaronson.com

        Language: English - Date: 2010-02-16 00:41:32
          25Forrelation: A Problem that Optimally Separates Quantum ∗ from Classical Computing † Scott Aaronson

          Forrelation: A Problem that Optimally Separates Quantum ∗ from Classical Computing † Scott Aaronson

          Add to Reading List

          Source URL: www.scottaaronson.com

          Language: English - Date: 2015-04-11 11:37:21
            26Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

            Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

            Add to Reading List

            Source URL: homepages.math.uic.edu

            Language: English - Date: 2013-03-08 12:40:06
              27The Learnability of Quantum States Scott Aaronson∗ MIT Abstract Traditional quantum state tomography requires a number of measurements that grows exponentially

              The Learnability of Quantum States Scott Aaronson∗ MIT Abstract Traditional quantum state tomography requires a number of measurements that grows exponentially

              Add to Reading List

              Source URL: www.scottaaronson.com

              Language: English - Date: 2008-11-13 22:47:28
                28A FULL CHARACTERIZATION OF QUANTUM ADVICE∗ SCOTT AARONSON† AND ANDREW DRUCKER‡ Abstract. We prove the following surprising result: given any quantum state ρ on n qubits, there exists a local Hamiltonian H on poly

                A FULL CHARACTERIZATION OF QUANTUM ADVICE∗ SCOTT AARONSON† AND ANDREW DRUCKER‡ Abstract. We prove the following surprising result: given any quantum state ρ on n qubits, there exists a local Hamiltonian H on poly

                Add to Reading List

                Source URL: www.scottaaronson.com

                Language: English - Date: 2014-02-22 14:06:38
                  29Quantum Computing, Postselection, and Probabilistic Polynomial-Time Scott Aaronson∗ Institute for Advanced Study, Princeton, NJ (USA)

                  Quantum Computing, Postselection, and Probabilistic Polynomial-Time Scott Aaronson∗ Institute for Advanced Study, Princeton, NJ (USA)

                  Add to Reading List

                  Source URL: www.scottaaronson.com

                  Language: English - Date: 2006-11-24 03:52:38
                    30Advice Coins for Classical and Quantum Computation Scott Aaronson∗ Andrew Drucker† Abstract

                    Advice Coins for Classical and Quantum Computation Scott Aaronson∗ Andrew Drucker† Abstract

                    Add to Reading List

                    Source URL: www.scottaaronson.com

                    Language: English - Date: 2015-04-22 11:25:30