Towards a quantum-inspired proof for ip = pspace

Ayal Green; Guy Kindler; Yupan Liu

doi:https://doi.org/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

The Hebrew University of Jerusalem

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

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

Keywords

Delegating quantum computation
Interactive proofs

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Nuclear and High Energy Physics
Statistical and Nonlinear Physics
General Physics and Astronomy
Mathematical Physics
Computational Theory and Mathematics

Access to Document

https://doi.org/10.26421/QIC21.5-6-2

Cite this

@article{dcd2096fcbc74b1e9d9f5643589368b0,

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 = "https://doi.org/10.26421/QIC21.5-6-2",

language = "الإنجليزيّة",

volume = "21",

pages = "377--386",

journal = "Quantum Information and Computation",

issn = "1533-7146",

publisher = "Rinton Press Inc.",

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 - http://www.scopus.com/inward/record.url?scp=85103876256&partnerID=8YFLogxK

U2 - https://doi.org/10.26421/QIC21.5-6-2

DO - https://doi.org/10.26421/QIC21.5-6-2

M3 - مقالة

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

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this