Sumcheck-based delegation of quantum computing to rational server (Q5925559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226224471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sumcheck-based delegation of quantum computing to rational server / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of topological field theories by quantum computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular functor which is universal for quantum computation / 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: Universal Quantum Simulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5741632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness and device independence of verifiable blind quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantum linearity test for robustly verifying entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qfactory: classically-instructed remote secret qubits preparation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle separation of BQP and PH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient rational proofs with strong utility-gap guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Sumchecks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Proofs with Multiple Provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing and quadratically signed weight enumerators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy / 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: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank

Latest revision as of 06:47, 29 July 2024

scientific article; zbMATH DE number 7540255
Language Label Description Also known as
English
Sumcheck-based delegation of quantum computing to rational server
scientific article; zbMATH DE number 7540255

    Statements

    Sumcheck-based delegation of quantum computing to rational server (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    quantum computing
    0 references
    rational interactive proof
    0 references
    game theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers