Optimised resource construction for verifiable quantum computation (Q2988006): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q62099846, #quickstatements; #temporary_batch_1722284575798
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of linear optics / 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: Q2969059 / 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: Composable Security of Delegated Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Sharing of Quantum Secrets over Untrusted Channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum One-Time Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The measurement calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty entanglement in graph states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Blind Quantum Computation / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62099846 / rank
 
Normal rank

Latest revision as of 21:31, 29 July 2024

scientific article
Language Label Description Also known as
English
Optimised resource construction for verifiable quantum computation
scientific article

    Statements

    Identifiers