Back to Results
First PageMeta Content
Quantum information science / Complexity classes / Interactive proof system / QMA / NEXPTIME / IP / Probabilistically checkable proof / Qubit / Quantum computer / Theoretical computer science / Applied mathematics / Computational complexity theory


A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract
Add to Reading List

Document Date: 2014-11-28 23:31:17

Open Document

File Size: 139,37 KB

Share Result on Facebook

City

Pasadena / /

Company

3SAT / Quantum Technologies / /

Country

United States / Sudan / /

/

Facility

National University of Singapore / California Institute of Technology / Singapore University of Technology / /

IndustryTerm

diferent protocol / minimum energy / interactive-proof systems / interactive proof systems / proof systems / lowest-energy state / multi-prover interactive proof systems / energy / /

Organization

National University of Singapore / Singapore / California Institute of Technology / Singapore University of Technology and Design / American Mathematical Society / /

Person

Joseph Fitzsimons∗ Thomas Vidick / /

ProvinceOrState

California / Massachusetts / /

Technology

one-round interactive protocol / diferent protocol / corresponding protocol / QMIP∗ protocol / two-prover interactive protocols / MIP∗ protocol / two-prover protocol / /

URL

http /

SocialTag