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…