5 papers
The Code Distortion Problem
Huck Bennett, Matthew Fox, Bryant Morrell
Two linear error-correcting codes are called linearly equivalent if there is a linear isometry mapping to . I…
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…
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 unita…
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…
A Refinement of the McCreight-Meyer Union Theorem
Matthew Fox, Chaitanya Karamchedu
Using properties of Blum complexity measures and certain complexity class operators, we exhibit a total computable and non-decreasing function such that for all…