# Quantum proof systems for iterated exponential time, and beyond

@article{Fitzsimons2018QuantumPS, title={Quantum proof systems for iterated exponential time, and beyond}, author={Joseph Fitzsimons and Zhengfeng Ji and Thomas Vidick and Henry S. Yuen}, journal={Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing}, year={2018} }

We show that any language solvable in nondeterministic time exp( exp(⋯exp(n))), where the number of iterated exponentials is an arbitrary function R(n), can be decided by a multiprover interactive proof system with a classical polynomial-time verifier and a constant number of quantum entangled provers, with completeness 1 and soundness 1 − exp(−Cexp(⋯exp(n))), where the number of iterated exponentials is R(n)−1 and C>0 is a universal constant. The result was previously known for R=1 and R=2; we…

## Figures from this paper

## 15 Citations

NEEXP in MIP

- Computer ScienceFOCS 2019
- 2019

The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.

Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs

- Computer Science, Mathematics2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The main result is that the two classes are equal, i.e., MIP* = PZK-MIP*.

NEEXP is Contained in MIP*

- Computer Science2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- 2019

The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.

Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

- Mathematics, Computer ScienceComputational Complexity Conference
- 2019

Lower bounds are given on the complexity class PZK-MIPcoδ (2, 1,1, s) of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap 1 --- s gets arbitrarily small.

Nonlocal games, compression theorems, and the arithmetical hierarchy

- Computer ScienceSTOC
- 2022

The Π2-completeness result is a new “gapless” compression theorem that holds for both quantum and commuting operator strategies, and explains how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression.

A generalization of CHSH and the algebraic structure of optimal strategies

- Computer ScienceQuantum
- 2020

This work introduces an algebraic generalization of CHSH by viewing it as a linear constraint system (LCS) game, exhibiting self-testing properties that are qualitatively different, and gives the first example of a game that is not a self-test.

The membership problem for constant-sized quantum correlations is undecidable

- Computer ScienceArXiv
- 2021

There is a family of constant-sized correlations such that solving the quantum membership problem for this family is computationally impossible, and the undecidability that arises in understanding Bell experiments is not dependent on varying the number of measurements in the experiment.

Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP

- Mathematics, Computer ScienceArXiv
- 2019

The LHI protocol makes previous research for Local Hamiltonians applicable to check the history state of interactive proofs, and Broadbent et al.'s zero-knowledge protocol for QMA \cite{BJSW} to quantum multi-prover systems in order to obtain the second result.

Constant-sized robust self-tests for states and measurements of unbounded dimension

- Mathematics
- 2021

We consider correlations, ?=,G , arising from measuring a maximally entangled state using = measurements with two outcomes each, constructed from = projections that add up to G . We show that the…

On the complexity of zero gap MIP

- Mathematics, Computer ScienceICALP
- 2020

This paper proves that $\mathsf{MIP}^*_0$ extends beyond the first level of the arithmetical hierarchy, and in fact is equal to $\Pi_2^0$, the class of languages that can be decided by quantified formulas of the form $\forall y \, \exists z \, R(x,y,z)$.

## References

SHOWING 1-10 OF 51 REFERENCES

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

- Computer Science, MathematicsITCS
- 2015

This work gives a quantum interactive proof system for the local Hamiltonian problem on n qubits in which the verifier has a single round of interaction with five entangled provers and completeness and soundness are separated by an inverse polynomial in $n.

Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA

- Mathematics2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
- 2018

We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the…

A quantum linearity test for robustly verifying entanglement

- Mathematics, Computer ScienceSTOC
- 2017

A simple two-player test which certifies that the players apply tensor products of Pauli σX and σZ observables on the tensor product of n EPR pairs is introduced, which is the first robust self-test for n E PR pairs.

Quantum interactive proofs with weak error bounds

- Computer Science, MathematicsITCS '12
- 2012

This paper proves that the computational power of quantum interactive proof systems, with a double-exponentially small gap in acceptance probability between the completeness and soundness cases, is…

The Quantum Moment Problem and Bounds on Entangled Multi-prover Games

- Mathematics2008 23rd Annual IEEE Conference on Computational Complexity
- 2008

It is proved that a hierarchy of semidefinite programs similar to the one given by Navascues, Pironioand Acin converges to the entangled value of the game and it would follow that the languages recognized by a multi-prover interactive proof system where the provers share entanglement are recursive.

Compression of quantum multi-prover interactive proofs

- MathematicsSTOC
- 2017

It is established that non local games are provably harder than classical games without any complexity theory assumptions and gap amplification for nonlocal games may be impossible in general.

Proof verification and the hardness of approximation problems

- Computer Science, MathematicsJACM
- 1998

It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard.

Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

- Mathematics, Computer ScienceComputational Complexity Conference
- 2019

Lower bounds are given on the complexity class PZK-MIPcoδ (2, 1,1, s) of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap 1 --- s gets arbitrarily small.

A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers

- Computer Science2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
- 2012

This work proves a strong limitation on the ability of entangled provers to collude in a multiplayer game, and shows that the correlations produced by any entangled strategy which succeeds in the multilinearity test with high probability can always be closely approximated using shared randomness alone.

Three-Player Entangled XOR Games Are NP-Hard to Approximate

- Computer Science2013 IEEE 54th Annual Symposium on Foundations of Computer Science
- 2013

The key technical component of this work is a soundness analysis of a point-vs-plane low-degree test against entangled players that extends and simplifies the analysis of the multilinearity test by Ito and Vidick.