Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3605726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The detectability lemma and quantum gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542516 / 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: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive linear maps on complex matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-and-a-half quantum de Finetti theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QIP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear transformations which preserve trace and positive semidefiniteness of operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using entanglement in quantum multi-prover interactive proofs / 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: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A de Finetti representation for finite symmetric quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3400490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional hardness for satisfiable 3-CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE has constant-round quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge against quantum attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theorem and strong converse for quantum channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792245 / rank
 
Normal rank

Latest revision as of 06:43, 13 July 2024

scientific article
Language Label Description Also known as
English
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
scientific article

    Statements

    Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2017
    0 references
    interactive proof systems
    0 references
    quantum computing
    0 references
    perfect completeness
    0 references
    entanglement
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers