Matthew Fox

works on

approximation algorithms 1 code equivalence 1 coding theory 1 computational complexity 1 distortion measures 1 lattice analogues 1

From the 1 of 4 linked papers with an AI index.

collaborators

Showing quant-phShow all

2 papers · 1 filter

quant-ph2025

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…

quant-ph2025

Bounds on Eventually Universal Quantum Gate Sets

Chaitanya Karamchedu, Matthew Fox, Daniel Gottesman

Say a collection of $n$ -qu $d$ it gates $I^$ is eventually universal if and only if there exists $N_{0} \geq n$ such that for all $N \geq N_{0}$ , one can approximate any $N$ -qu $d$ it unit…