<--- Back to Details
First PageDocument 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
Date: 2014-11-28 23:31:17
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

Source URL: www.quantum-lab.org

Download Document from Source Website

File Size: 139,37 KB

Share Document on Facebook

Similar Documents

CS378, MA375T, PHY341  Homework 1 Homework 1 Introduction to Quantum Information Science

CS378, MA375T, PHY341 Homework 1 Homework 1 Introduction to Quantum Information Science

DocID: 1xVZC - View Document

CS378, MA375T, PHY341  Homework 2 Homework 2 Introduction to Quantum Information Science

CS378, MA375T, PHY341 Homework 2 Homework 2 Introduction to Quantum Information Science

DocID: 1xVYW - View Document

CS378, MA375T, PHY341  Homework 9 Homework 9 Introduction to Quantum Information Science

CS378, MA375T, PHY341 Homework 9 Homework 9 Introduction to Quantum Information Science

DocID: 1xVwY - View Document

CS378, MA375T, PHY341  Homework 4 Homework 4 Introduction to Quantum Information Science

CS378, MA375T, PHY341 Homework 4 Homework 4 Introduction to Quantum Information Science

DocID: 1xVe2 - View Document

CS378, MA375T, PHY341  Homework 6 Homework 6 Introduction to Quantum Information Science

CS378, MA375T, PHY341 Homework 6 Homework 6 Introduction to Quantum Information Science

DocID: 1xUVZ - View Document