3 citations · 4 across the 2 of their papers we have counts for
4 papers · 1 filter
Learning Random Quantum Circuits and the Emergence of Pseudorandomness
Srinivasan Arunachalam, Qizhao Huang, Makrand Sinha
We give an efficient algorithm for learning -dimensional brickwork random quantum circuits using only copies of the output state obtained by applying to the all-zero input.…
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…
Simple constructions of linear-depth t-designs and pseudorandom unitaries
Tony Metger, Alexander Poremba, Makrand Sinha +1
Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of resear…
Pseudorandom unitaries with non-adaptive security
Tony Metger, Alexander Poremba, Makrand Sinha +1
Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time al…