Zero-knowledge proofs of quantumness

DOI10.62056/AYIV4FE-3MaRDI QIDQ7326438zbMATH OpenFDO

Authors Duong Hieu Phan, Weiqiang Wen, Xing-Yu Yan, Jinwei Zheng

Publication date 9 September 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AYIV4FE-3

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A cryptographic test of quantumness and certifiable randomness from a single quantum device
• An efficient quantum factoring algorithm
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• Hardness of SIS and LWE with small parameters
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 7651035 (Why is no real title available?)
• Non-interactive classical verification of quantum computation
• Quantum advantage from any non-local game
• Simple tests of quantumness also certify qubits
• The computational complexity of linear optics
• Unclonable non-interactive zero-knowledge

This page was built for publication: Zero-knowledge proofs of quantumness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326438)