How to Verify a Quantum Computation (Q4568113): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
How to Verify a Quantum Computation
Property / OpenAlex ID
 
Property / OpenAlex ID: W2201916012 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.09180 / rank
 
Normal rank
Property / title
 
How to Verify a Quantum Computation (English)
Property / title: How to Verify a Quantum Computation (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial quantum algorithm for approximating the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new universal and fault-tolerant quantum basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum disclosure proofs of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Blind Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proof systems with polynomially bounded strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in the Bounded-Quantum-Storage Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composable Security of Delegated Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegating Computation / 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: Optimised resource construction for verifiable quantum computation / 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: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE has constant-round quantum interactive proof systems / rank
 
Normal rank

Latest revision as of 22:11, 15 July 2024

scientific article; zbMATH DE number 6890208
Language Label Description Also known as
English
How to Verify a Quantum Computation
scientific article; zbMATH DE number 6890208

    Statements

    0 references
    15 June 2018
    0 references
    complexity theory
    0 references
    cryptography
    0 references
    interactive proofs
    0 references
    quantum computing
    0 references
    quantum interactive proofs
    0 references
    quantum cryptography
    0 references
    How to Verify a Quantum Computation (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references