Pseudorandom unitaries with non-adaptive security (2402.14803v1)
Abstract: Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a simple PRU construction that is a concatenation of a random Clifford unitary, a pseudorandom binary phase operator, and a pseudorandom permutation operator. We prove that this PRU construction is secure against non-adaptive distinguishers assuming the existence of quantum-secure one-way functions. This means that no efficient quantum query algorithm that is allowed a single application of $U{\otimes \mathrm{poly}(n)}$ can distinguish whether an $n$-qubit unitary $U$ was drawn from the Haar measure or our PRU ensemble. We conjecture that our PRU construction remains secure against adaptive distinguishers, i.e. secure against distinguishers that can query the unitary polynomially many times in sequence, not just in parallel.
- Quantum pseudoentanglement. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2024.
- Pseudorandom isometries. arXiv preprint arXiv:2311.02901, 2023.
- Cryptography from pseudorandom quantum states. In Annual International Cryptology Conference, pages 208–236. Springer, 2022.
- Scrambling speed of random quantum circuits. arXiv preprint arXiv:1210.6644, 2012.
- Uncloneable quantum encryption via oracles. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, 2020.
- D. Bump. Lie Groups. Graduate Texts in Mathematics. Springer New York, 2013.
- Matthias Christandl. The Structure of Bipartite Quantum States-Insights from Group Theory and Cryptography. Ph. D. Thesis, 2006.
- Hidden cosets and applications to unclonable cryptography. In Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I 41, pages 556–584. Springer, 2021.
- Quantum copy-protection of compute-and-compare programs in the quantum random oracle model. arXiv preprint arXiv:2009.13865, 2020.
- Cryptographic censorship. arXiv preprint arXiv:2402.03425, 2024.
- Representation theory: a first course, volume 129. Springer Science & Business Media, 2013.
- Aram W Harrow. The church of the symmetric subspace. arXiv preprint arXiv:1308.6595, 2013.
- Quantum advantage in learning from experiments. Science, 376(6598):1182–1186, 2022.
- Pseudorandom unitaries are neither real nor sparse nor noise-robust. arXiv preprint arXiv:2306.11677, 2023.
- Black holes as mirrors: quantum information in random subsystems. Journal of High Energy Physics, 2007(09):120–120, September 2007.
- Pseudorandom quantum states. In Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III 38, pages 126–152. Springer, 2018.
- Complementarity and the unitarity of the black hole S-matrix. Journal of High Energy Physics, 2023(2), February 2023.
- Quantum pseudorandom scramblers. arXiv preprint arXiv:2309.08941, 2023.
- Quantum commitments and signatures without one-way functions. In Annual International Cryptology Conference, pages 269–295. Springer, 2022.
- Leonard Susskind. Computational complexity and black hole horizons. Fortschritte der Physik, 64(1):24–43, 2016.
- Ewout van den Berg. A simple method for sampling random Clifford operators. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 54–59. IEEE, 2021.
- Mark Zhandry. A note on quantum-secure PRPs. arXiv preprint arXiv:1611.05564, 2016.
- Mark Zhandry. How to construct quantum random functions. Journal of the ACM (JACM), 68(5):1–43, 2021.
- Tony Metger (18 papers)
- Alexander Poremba (22 papers)
- Makrand Sinha (19 papers)
- Henry Yuen (51 papers)