Towards a quantum-inspired proof for ip = pspace

Ayal Green; Guy Kindler; Yupan Liu

doi:10.26421/QIC21.5-6-2

Towards a quantum-inspired proof for ip = pspace

Ayal Green
, Guy Kindler
, Yupan Liu

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [6] showing a quantum-inspired interactive protocol (IP) for PreciseBQP where the prover is only assumed to be a PreciseBQP machine, and show that the result can be strengthened to show an IP for NP^PP with a prover which is only assumed to be an NP^PP machine-which was not known before. We also show how the protocol can be used to directly verify QMA computations, thus connect-ing the sum-check protocol by [2] with the result of [6, 29]. Our results shed light on a quantum-inspired proof for IP = PSPACE, as PreciseQMA captures the full PSPACE power.

Original language	English
Pages (from-to)	377-386
Number of pages	10
Journal	Quantum Information and Computation
Volume	21
Issue number	5-6
DOIs	https://doi.org/10.26421/QIC21.5-6-2
State	Published - 2021

Bibliographical note

Publisher Copyright:
© Rinton Press.

Keywords

Delegating quantum computation
Interactive proofs

Access to Document

10.26421/QIC21.5-6-2

Cite this

@article{9f0fc794e60d41948b2f887d30425cfc,

title = "Towards a quantum-inspired proof for ip = pspace",

abstract = "We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [6] showing a quantum-inspired interactive protocol (IP) for PreciseBQP where the prover is only assumed to be a PreciseBQP machine, and show that the result can be strengthened to show an IP for NPPP with a prover which is only assumed to be an NPPP machine-which was not known before. We also show how the protocol can be used to directly verify QMA computations, thus connect-ing the sum-check protocol by [2] with the result of [6, 29]. Our results shed light on a quantum-inspired proof for IP = PSPACE, as PreciseQMA captures the full PSPACE power.",

keywords = "Delegating quantum computation, Interactive proofs",

author = "Ayal Green and Guy Kindler and Yupan Liu",

note = "Publisher Copyright: {\textcopyright} Rinton Press.",

year = "2021",

doi = "10.26421/QIC21.5-6-2",

language = "אנגלית",

volume = "21",

pages = "377--386",

journal = "Quantum Information and Computation",

issn = "1533-7146",

publisher = "Sciendo",

number = "5-6",

}

TY - JOUR

T1 - Towards a quantum-inspired proof for ip = pspace

AU - Green, Ayal

AU - Kindler, Guy

AU - Liu, Yupan

N1 - Publisher Copyright: © Rinton Press.

PY - 2021

Y1 - 2021

N2 - We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [6] showing a quantum-inspired interactive protocol (IP) for PreciseBQP where the prover is only assumed to be a PreciseBQP machine, and show that the result can be strengthened to show an IP for NPPP with a prover which is only assumed to be an NPPP machine-which was not known before. We also show how the protocol can be used to directly verify QMA computations, thus connect-ing the sum-check protocol by [2] with the result of [6, 29]. Our results shed light on a quantum-inspired proof for IP = PSPACE, as PreciseQMA captures the full PSPACE power.

AB - We explore quantum-inspired interactive proof systems where the prover is limited. Namely, we improve on a result by [6] showing a quantum-inspired interactive protocol (IP) for PreciseBQP where the prover is only assumed to be a PreciseBQP machine, and show that the result can be strengthened to show an IP for NPPP with a prover which is only assumed to be an NPPP machine-which was not known before. We also show how the protocol can be used to directly verify QMA computations, thus connect-ing the sum-check protocol by [2] with the result of [6, 29]. Our results shed light on a quantum-inspired proof for IP = PSPACE, as PreciseQMA captures the full PSPACE power.

KW - Delegating quantum computation

KW - Interactive proofs

UR - https://www.scopus.com/pages/publications/85103876256

U2 - 10.26421/QIC21.5-6-2

DO - 10.26421/QIC21.5-6-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85103876256

SN - 1533-7146

VL - 21

SP - 377

EP - 386

JO - Quantum Information and Computation

JF - Quantum Information and Computation

IS - 5-6

ER -

Towards a quantum-inspired proof for ip = pspace

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this