Search Results for author: Scott Aaronson

Found 14 papers, 2 papers with code

A very preliminary analysis of DALL-E 2

no code implementations25 Apr 2022 Gary Marcus, Ernest Davis, Scott Aaronson

The DALL-E 2 system generates original synthetic images corresponding to an input text as caption.

Common Sense Reasoning

Efficient Learning of Non-Interacting Fermion Distributions

no code implementations20 Feb 2021 Scott Aaronson, Sabee Grewal

We give an efficient classical algorithm that recovers the distribution of a non-interacting fermion state over the computational basis.

On the Hardness of Detecting Macroscopic Superpositions

no code implementations16 Sep 2020 Scott Aaronson, Yosi Atia, Leonard Susskind

In other words, observing interference between the $|$Alive$\rangle$and $|$Dead$\rangle$ states is a "necromancy-hard" problem, technologically infeasible in any world where death is permanent.

Quantum Physics General Relativity and Quantum Cosmology

PDQP/qpoly = ALL

no code implementations22 May 2018 Scott Aaronson

We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself.

Quantum Physics Computational Complexity

Online Learning of Quantum States

no code implementations NeurIPS 2018 Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, Ashwin Nayak

Even in the "non-realizable" setting---where there could be arbitrary noise in the measurement outcomes---we show how to output hypothesis states that do significantly worse than the best possible states at most $\operatorname{O}\!\left(\sqrt {Tn}\right) $ times on the first $T$ measurements.

online learning

Experimental learning of quantum states

no code implementations30 Nov 2017 Andrea Rocchetto, Scott Aaronson, Simone Severini, Gonzalo Carvacho, Davide Poderini, Iris Agresti, Marco Bentivegna, Fabio Sciarrino

The number of parameters describing a quantum state is well known to grow exponentially with the number of particles.

Learning Theory

Quantum POMDPs

no code implementations11 Jun 2014 Jennifer Barry, Daniel T. Barry, Scott Aaronson

We present quantum observable Markov decision processes (QOMDPs), the quantum analogues of partially observable Markov decision processes (POMDPs).

The Ghost in the Quantum Turing Machine

no code implementations2 Jun 2013 Scott Aaronson

In honor of Alan Turing's hundredth birthday, I unwisely set out some thoughts about one of Turing's obsessions throughout his life, the question of physics and free will.

Quantum Physics General Literature History and Philosophy of Physics

Quantum Copy-Protection and Quantum Money

no code implementations24 Oct 2011 Scott Aaronson

Moving beyond the oracle world, we also present an explicit candidate scheme for publicly-verifiable quantum money, based on random stabilizer states; as well as two explicit schemes for copy-protecting the family of point functions.

Quantum Physics Computational Complexity

The Computational Complexity of Linear Optics

1 code implementation14 Nov 2010 Scott Aaronson, Alex Arkhipov

For this, we need two unproven conjectures: the "Permanent-of-Gaussians Conjecture", which says that it is #P-hard to approximate the permanent of a matrix A of independent N(0, 1) Gaussian entries, with high probability over A; and the "Permanent Anti-Concentration Conjecture", which says that |Per(A)|>=sqrt(n!

Quantum Physics Computational Complexity

Closed Timelike Curves Make Quantum and Classical Computing Equivalent

no code implementations19 Aug 2008 Scott Aaronson, John Watrous

While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas.

Quantum Physics Computational Complexity

NP-complete Problems and Physical Reality

no code implementations12 Feb 2005 Scott Aaronson

Can NP-complete problems be solved efficiently in the physical universe?

Quantum Physics Computational Complexity General Relativity and Quantum Cosmology

Quantum Computing, Postselection, and Probabilistic Polynomial-Time

no code implementations23 Dec 2004 Scott Aaronson

I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements.

Quantum Physics Computational Complexity

Improved Simulation of Stabilizer Circuits

10 code implementations25 Jun 2004 Scott Aaronson, Daniel Gottesman

Second, we show that the problem of simulating stabilizer circuits is complete for the classical complexity class ParityL, which means that stabilizer circuits are probably not even universal for classical computation.

Quantum Physics Computational Complexity

Cannot find the paper you are looking for? You can Submit a new open access paper.