Self-testing of a single quantum device under computational assumptions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- A Parallel Repetition Theorem
- A cryptographic test of quantumness and certifiable randomness from a single quantum device
- Certifiable quantum dice, or, true random number generation secure against quantum adversaries
- Classical verification of quantum computations
- Computationally-secure and composable remote state preparation
- How to delegate computations
- Inverse and stability theorems for approximate representations of finite groups
- Maximal violation of Bell's inequalities is generic in quantum field theory
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- On lattices, learning with errors, random linear codes, and cryptography
- Qfactory: classically-instructed remote secret qubits preparation
- Robust self-testing of the singlet
- Secure multi-party quantum computation
- Self testing quantum apparatus
- Spooky Encryption and Its Applications
- Universal security for randomness expansion from the spot-checking protocol
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
This page was built for publication: Self-testing of a single quantum device under computational assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229304)
