<--- Back to Details
First PageDocument Content
Probabilistic complexity theory / Cryptographic protocols / IP / Interactive proof system / Arthur–Merlin protocol / NP / Zero-knowledge proof / Proof of knowledge / QMA / Theoretical computer science / Computational complexity theory / Applied mathematics
Probabilistic complexity theory
Cryptographic protocols
IP
Interactive proof system
Arthur–Merlin protocol
NP
Zero-knowledge proof
Proof of knowledge
QMA
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: theory.lcs.mit.edu

Download Document from Source Website

Share Document on Facebook

Similar Documents

Computational complexity theory / Cryptography / Complexity classes / Theory of computation / NP / IP / Advice / PP / P / Soundness / Commitment scheme / Certificate

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Quantum mechanics / Physics / Theoretical physics / Chemistry / Mathematical formulation of quantum mechanics / Quantum superposition / Unitary transformation / Quantum computing / Hamiltonian / Quantum algorithm / Degenerate energy levels / Schrdinger equation

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document