Search Results for author:
Found 15 papers, 2 papers with code
Testing GPT-4 with Wolfram Alpha and Code Interpreter plug-ins on math and science problems
This report describes a test of the large language model GPT-4 with the Wolfram Alpha and the Code Interpreter plug-ins on 105 original problems in science and math, at the high school and college levels, carried out in June-August 2023.
A very preliminary analysis of DALL-E 2
The DALL-E 2 system generates original synthetic images corresponding to an input text as caption.
Efficient Tomography of Non-Interacting Fermion States
We give an efficient algorithm that learns a non-interacting fermion state, given copies of the state.
On the Hardness of Detecting Macroscopic Superpositions
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
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
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.
Experimental learning of quantum states
The number of parameters describing a quantum state is well known to grow exponentially with the number of particles.
Quantum POMDPs
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
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
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
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
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
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
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
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
