Quantum information and the PCP theorem (Q835644): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109833455 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0504075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCP characterizations of NP: toward a polynomially-small error-probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-constant error low degree test of almost-linear size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time quantum computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE has constant-round quantum interactive proof systems / rank
 
Normal rank

Latest revision as of 21:54, 1 July 2024

scientific article
Language Label Description Also known as
English
Quantum information and the PCP theorem
scientific article

    Statements

    Quantum information and the PCP theorem (English)
    0 references
    0 references
    0 references
    31 August 2009
    0 references
    quantum computation
    0 references
    quantum information
    0 references
    quantum interactive proofs
    0 references
    quantum advice
    0 references
    probabilistically checkable proofs
    0 references
    low degree test
    0 references

    Identifiers