Towards a universal gateset for $\mathsf{QMA}_1$
Abstract
is with perfect completeness, i.e., the prover must accept with a probability of exactly in the YES-case. Whether and are equal is still a major open problem. It is not even known whether has a universal gateset; Solovay-Kitaev does not apply due to perfect completeness. Hence, we do not generally know whether (superscript denoting gateset), given two universal gatesets . In this paper, we make progress towards the gateset question by proving that for all , the gateset (Amy et al., RC 2024) is universal for all gatesets in the cyclotomic field , i.e. for all gatesets in . For , we can even show that suffices for all -th cyclotomic fields. We exhibit complete problems for all : Quantum -SAT in is complete for for all , and if , where quantum -SAT is the problem of deciding whether a set of -local Hamiltonians has a common ground state. Additionally, we give the first -complete -local Hamiltonian problem: It is -complete (for ) to decide whether a given -local Hamiltonian in has a nonempty nullspace. Our techniques also extend to sparse Hamiltonians, and so we can prove the first -complete (i.e. with two unentangled provers) Hamiltonian problem. Finally, we prove that the Gapped Clique Homology problem defined by King and Kohler (FOCS 2024) is -complete, and the Clique Homology problem without promise gap is PSPACE-complete.
Cite
@article{arxiv.2411.02681,
title = {Towards a universal gateset for $\mathsf{QMA}_1$},
author = {Dorian Rudolph},
journal= {arXiv preprint arXiv:2411.02681},
year = {2025}
}
Comments
37 pages, 3 figures; add references, minor fixes, rename LHSV to ELH