From the 1 of 4 linked papers with an AI index.
4 papers
The Code Distortion Problem
Huck Bennett, Matthew Fox, Bryant Morrell
The paper defines a code distortion measure between linear error‑correcting codes and studies the computational problem of finding a minimum‑distortion mapping, proving NP‑hardness…
Semiclassical Gravity Efficiently Solves -Complete Problems
Matthew Fox, Chaitanya Karamchedu, Sotirios Mygdalas
Assuming the gravitational field is classical and that it couples to quantum fields via the semiclassical Einstein field equations, we show that the weak-field dynamics of a massiv…
A Criterion for Post-Selected Quantum Advantage
Chaitanya Karamchedu, Matthew Fox, Daniel Gottesman
Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not…
Bounds on Eventually Universal Quantum Gate Sets
Chaitanya Karamchedu, Matthew Fox, Daniel Gottesman
Say a collection of -quit gates is eventually universal if and only if there exists such that for all , one can approximate any -quit unit…