
See our previous results on open quantum problems here:
✓Physical Superintelligence is the AI native laboratory fueling the fast physics takeoff.

See our previous results on open quantum problems here:

We built PSI as the AI-native laboratory fueling the physics takeoff, leveraging physical superintelligence to vastly expand the pace and scale of research physicists can pursue. Come build with us. psi.inc/

"This is a huge result. It resolves a decades-old conjecture with important implications for the nature of problems that admit quantum speedups. The proof draws on and extends several lines of work in the analysis of boolean functions and probabilistic combinatorics. Everything is brought together in a rather magical way.”

Guy Blanc (of MIT), Jordan Docter, Carmen Strassle and Li-Yang Tan (of Stanford), who settled a special case of the conjecture's classical simulation consequence in August, have been reading our proof and are writing a short exposition of it. They wrote to us:

We discovered the proof with a research system we developed internally, in a run on our own infrastructure, leveraging a non-public Anthropic model. @DavidTurturean at PSI led this work. The proof builds on ideas of Shachar Lovett and Jiapeng Zhang, of David Reimer, and of others.

We formalized and checked the proof using Lean, a proof assistant language commonly used for machine verification of mathematical results. The manuscript and the Lean formalization are public here: github.com/physical-superint…

PSI proved this conjecture is true: that bounded polynomials of low degree have influential variables. The influence of a bit is the average change in a polynomial's value when the bit is flipped.

Scott Aaronson and Andris Ambainis had connected this question to a conjecture about polynomials. If true, quantum computers are at most polynomially faster than classical ones unless the inputs satisfy a special condition, such as the exponential structure in Shor's algorithm.

Last month, PSI solved five long-standing problems in quantum information theory. Now, we resolve one of the most fundamental questions in quantum computing: when can quantum computers be exponentially faster than classical ones by an exponential margin?

Today Physical Superintelligence PBC is announcing a proof of the Aaronson-Ambainis conjecture, one of the central open problems in quantum complexity, with major implications for quantum computing speedup. psi.inc/research/aaronson-am… Thread 👇

We built PSI as the AI native laboratory fueling the physics takeoff, leveraging superintelligence to vastly expand the pace and scale of fundamental and applied research physicists can pursue. Come build with us. psi.inc/

▪️ We construct a process that remains causal even when the parties share arbitrary entangled auxiliary systems, yet has no purification in any finite auxiliary dimension. The obstruction persists on an open set of nearby processes. (OQP 43)

▪️ For a maximally entangled pair of d-dimensional systems, Fourier-phase measurements give the largest CGLMP Bell violation among d-outcome projective measurements. Every maximizing choice of measurements is unitarily equivalent to one of these. (OQP 27)

▪️ Any composition of 2(d−1) PPT maps on a d-dimensional system is entanglement breaking, for every d ≥ 2. The maps can differ. (OQP 38 aka PPT²)

▪️ We prove three-copy undistillability for 0 ≤ α ≤ 0.4625 in every dimension. In dimensions 3 and 4, we derive the sharp three-copy bound for 0 ≤ α ≤ ½ and classify its minimizers for 0 < α < 1/2. (OQP 2, Werner states, three copies)

▪️ In the vacuum of a massive free scalar field in 3+1 dimensions, two fixed bounded regions satisfy the CHSH inequality beyond a finite separation, even though they remain entangled. (Open Quantum Problem 12)