Depth-efficient proofs of quantumness
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the $\textit{quantum advantage}$ of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and be accepted, while any polynomial-time clas...
Main Authors: | Zhenning Liu, Alexandru Gheorghiu |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-09-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2022-09-19-807/pdf/ |
Similar Items
-
Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
by: Alexandru Gheorghiu, et al.
Published: (2017-01-01) -
Interaction and Depth against Nondeterminism in Proof Search
by: Ozan Kahramanogullari
Published: (2014-05-01) -
Quantum Proofs of Proximity
by: Marcel Dall'Agnol, et al.
Published: (2022-10-01) -
Security proof of practical quantum key distribution with detection-efficiency mismatch
by: Yanbao Zhang, et al.
Published: (2021-01-01) -
Intelligent Bio-Latticed Cryptography: A Quantum-Proof Efficient Proposal
by: Ohood Saud Althobaiti, et al.
Published: (2022-11-01)