Towards a universal gateset for $\mathsf{QMA}_1$
Dorian Rudolph

TL;DR
This paper advances understanding of the universal gateset for the class $ extsf{QMA}_1$, establishing universality for certain gatesets in cyclotomic fields, and introduces new $ extsf{QMA}_1$-complete Hamiltonian problems.
Contribution
It proves universality of specific gatesets in cyclotomic fields for $ extsf{QMA}_1$, and introduces the first $ extsf{QMA}_1$-complete 2-local Hamiltonian problem.
Findings
Gateset $G_{2^k}$ is universal for all gatesets in $ extsf{Q}( ext{zeta}_{2^k})$.
Quantum $l$-SAT is complete for $ extsf{QMA}_1^{G_{2^k}}$ for all $l eq3$ (or $l eq4$ depending on $k$).
First $ extsf{QMA}_1$-complete 2-local Hamiltonian problem in $ extsf{Q}( ext{zeta}_{2^k})$.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · graph theory and CDMA systems
