Publications (7)
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…
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…
On Formally Undecidable Traits of Intelligent Machines
Matthew Fox
Building on work by Alfonseca et al. (2021), we study the conditions necessary for it to be logically possible to prove that an arbitrary artificially intelligent machine will exhi…
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 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…
On a Weighted Series of the Hurwitz Zeta Function
Matthew Fox, Chaitanya Karamchedu
In this note we prove that for all , , and with , the (alternating) weighted series of the Hurwi…
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…