NDLI: A Multiprover Interactive Proof System for the Local Hamiltonian Problem

Please wait, while we are loading the content...

Interactive Coding for Multiparty Protocols

Homophily and the Glass Ceiling Effect in Social Networks

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

Arithmetic Cryptography: Extended Abstract

Uniform Sampling for Matrix Approximation

The Computational Benefit of Correlated Instances

A New Approach to the Sensitivity Conjecture

The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data

Verifiably Truthful Mechanisms

Direct Sum Testing

Sketching Cuts in Graphs and Hypergraphs

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback

Dynamic Models of Reputation and Competition in Job-Market Matching

Fractal Structures in Adversarial Prediction

Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults

Relax, No Need to Round: Integrality of Clustering Formulations

Why are Images Smooth?

Standard Simplices and Pluralities are Not the Most Noise Stable

Separation between Estimation and Approximation

Mechanism Design with Strategic Mediators

On Sample-Based Testers

Very Sparse Additive Spanners and Emulators

Simulating Noisy Channel Interaction

Voting with Coarse Beliefs

On Learning Mixture Models for Permutations

Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH

On the Communication Complexity of Secure Function Evaluation with Long Output

On Multiplicative Weight Updates for Concave and Submodular Function Maximization

A Physically Universal Cellular Automaton

Communication with Imperfectly Shared Randomness

Deterministic Extractors for Additive Sources: Extended Abstract

Accuracy for Sale: Aggregating Data with a Variance Constraint

$L_{p}$ Testing and Learning of Discrete Distributions

Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive

Deterministic Rateless Codes for BSC

Complex Contagions in Kleinberg's Small World Model

Restricted Distribution Automatizability in PAC-Semantics

Non-Interactive Proofs of Proximity

Privacy-Preserving Public Information for Sequential Games

Robust Hierarchical k-Center Clustering

It'll Probably Work Out: Improved List-Decoding Through Random Operations

Better Outcomes from More Rationality

Sunflowers and Testing Triangle-Freeness of Functions

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

Content Provider	ACM Digital Library
Author	Fitzsimons, Joseph Vidick, Thomas
Abstract	We give a quantum interactive proof system for the local Hamiltonian problem on n qubits in which (i) the verifier has a single round of interaction with five entangled provers, (ii) the verifier sends a classical message on O(log n) bits to each prover, who replies with a constant number of qubits, and (iii) completeness and soundness are separated by an inverse polynomial in \$n\$. As the same class of proof systems, without entanglement between the provers, is included in QCMA, our result provides the first indication that quantum multiprover interactive proof systems with entangled provers may be strictly more powerful than unentangled-prover interactive proof systems. A distinguishing feature of our protocol is that the completeness property requires honest provers to share a large entangled state, obtained as the encoding of the ground state of the local Hamiltonian via an error-correcting code. Our result can be interpreted as a first step towards a multiprover variant of the quantum PCP conjecture.
Starting Page	103
Ending Page	112
Page Count	10
File Format	PDF
ISBN	9781450333337
DOI	10.1145/2688073.2688094
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Entanglement Quantum interactive proofs Local hamiltonian
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A multiprover interactive proof system for the local

A multiprover interactive proof system for the local Hamiltonian problem

Classical verification of quantum proofs

A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers

A quasipolynomial-time algorithm for the quantum separability problem

A multiprover interactive proof for NEXP . . .

Two-Message Quantum Interactive Proofs and the Quantum Separability Problem

Quantum multi-prover interactive proof systems with limited prior entanglement

The complexity of the local Hamiltonian problem (2004)

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

Similar Documents

A multiprover interactive proof system for the local

A multiprover interactive proof system for the local Hamiltonian problem

Classical verification of quantum proofs

A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers

A quasipolynomial-time algorithm for the quantum separability problem

A multiprover interactive proof for NEXP . . .

Two-Message Quantum Interactive Proofs and the Quantum Separability Problem

Quantum multi-prover interactive proof systems with limited prior entanglement

The complexity of the local Hamiltonian problem (2004)

A Multiprover Interactive Proof System for the Local Hamiltonian Problem