3 papers
quant-ph2026
Digital signatures with classical shadows on near-term quantum computers
Pradeep Niroula, Minzhao Liu, Sivaprasad Omanakuttan +15
Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing pro…
quant-ph2025
Local transformations of bipartite entanglement are rigid
John Bostanci, Tony Metger, Henry Yuen
Uhlmann's theorem is a fundamental result in quantum information theory that quantifies the optimal overlap between two bipartite pure states after applying local unitary operation…
quant-ph2025
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
Bill Fefferman, Soumik Ghosh, Makrand Sinha +1
We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography. In…