How to verify that a small device is quantum, unconditionally
From MaRDI portal
Cites work
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- A cryptographic test of quantumness and certifiable randomness from a single quantum device
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification
- Bounds for entropy and divergence for distributions over a two-element set
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Classical homomorphic encryption for quantum circuits
- Classical verification of quantum computations
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Constructive post-quantum reductions
- Fast learning requires good memory: a time-space lower bound for parity learning
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 1088242 (Why is no real title available?)
- scientific article; zbMATH DE number 1842490 (Why is no real title available?)
- Oblivious transfer with a memory-bounded receiver
- Proofs of quantumness from trapdoor permutations
- Quantum advantage from any non-local game
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Simple schemes in the bounded storage model
- Simple tests of quantumness also certify qubits
- Speak much, remember little: cryptography in the bounded storage model, revisited
- The rank of sparse random matrices over finite fields
- Theory of Cryptography
This page was built for publication: How to verify that a small device is quantum, unconditionally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233219)
