{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:09:25Z","timestamp":1785830965334,"version":"3.56.0"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319968773","type":"print"},{"value":"9783319968780","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96878-0_5","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T12:53:57Z","timestamp":1532350437000},"page":"126-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":109,"title":["Pseudorandom Quantum States"],"prefix":"10.1007","author":[{"given":"Zhengfeng","family":"Ji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi-Kai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fang","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: Proceedings of the Twenty-Fourth Annual IEEE Conference on Computational Complexity (CCC 2009), pp. 229\u2013242. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/CCC.2009.42","DOI":"10.1109\/CCC.2009.42"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 41\u201360. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2213977.2213983","DOI":"10.1145\/2213977.2213983"},{"issue":"8","key":"5_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/2240236.2240258","volume":"55","author":"S Aaronson","year":"2012","unstructured":"Aaronson, S., Farhi, E., Gosset, D., Hassidim, A., Kelner, J., Lutomirski, A.: Quantum money. Commun. ACM 55(8), 84\u201392 (2012). https:\/\/doi.org\/10.1145\/2240236.2240258","journal-title":"Commun. ACM"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Emerson, J.: Quantum $$t$$-designs: $$t$$-wise independence in the quantum world. In: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (CCC 2007), pp. 129\u2013140, June 2007","DOI":"10.1109\/CCC.2007.26"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 474\u2013483. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.57. Full version at https:\/\/arxiv.org\/abs\/1404.6898","DOI":"10.1109\/FOCS.2014.57"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) APPROX\/RANDOM-2003. LNCS, vol. 2764, pp. 200\u2013215. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45198-3_18"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1137\/S0097539796302452","volume":"26","author":"A Barenco","year":"1997","unstructured":"Barenco, A., Berthiaume, A., Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C.: Stabilization of quantum computations by symmetrization. SIAM J. Comput. 26(5), 1541\u20131557 (1997). https:\/\/doi.org\/10.1137\/S0097539796302452","journal-title":"SIAM J. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-1-4757-0602-4_26","volume-title":"Advances in Cryptology","author":"CH Bennett","year":"1983","unstructured":"Bennett, C.H., Brassard, G., Breidbart, S., Wiesner, S.: Quantum cryptography, or unforgeable subway tokens. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 267\u2013275. Springer, Boston, MA (1983). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_26"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13(4), 850\u2013864 (1984). https:\/\/doi.org\/10.1137\/0213053","journal-title":"SIAM J. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"170502","DOI":"10.1103\/PhysRevLett.116.170502","volume":"116","author":"FGSL Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F.G.S.L., Harrow, A.W., Horodecki, M.: Efficient quantum pseudorandomness. Phys. Rev. Lett. 116, 170502 (2016). https:\/\/doi.org\/10.1103\/PhysRevLett.116.170502","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00220-016-2706-8","volume":"346","author":"FGSL Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F.G.S.L., Harrow, A.W., Horodecki, M.: Local random quantum circuits are approximate polynomial-designs. Commun. Math. Phys. 346(2), 397\u2013434 (2016). https:\/\/doi.org\/10.1007\/s00220-016-2706-8","journal-title":"Commun. Math. Phys."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"190502","DOI":"10.1103\/PhysRevLett.102.190502","volume":"102","author":"MJ Bremner","year":"2009","unstructured":"Bremner, M.J., Mora, C., Winter, A.: Are random pure states useful for quantum computation? Phys. Rev. Lett. 102, 190502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.102.190502","journal-title":"Phys. Rev. Lett."},{"key":"5_CR14","unstructured":"Chen, Y.H., Chung, K.M., Lai, C.Y., Vadhan, S.P., Wu, X.: Computational notions of quantum min-entropy. arXiv:1704.07309 (2017)"},{"key":"5_CR15","unstructured":"Chung, K.M., Shi, Y., Wu, X.: Physical randomness extractors: generating random numbers with minimal assumptions. arXiv preprint arXiv:1402.4797 (2014)"},{"issue":"9&10","key":"5_CR16","first-page":"721","volume":"16","author":"R Cleve","year":"2016","unstructured":"Cleve, R., Leung, D., Liu, L., Wang, C.: Near-linear constructions of exact unitary 2-designs. Quantum Inf. Comput. 16(9&10), 721\u2013756 (2016). http:\/\/www.rintonpress.com\/xxqic16\/qic-16-910\/0721-0756.pdf","journal-title":"Quantum Inf. Comput."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"012304","DOI":"10.1103\/PhysRevA.80.012304","volume":"80","author":"C Dankert","year":"2009","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80, 012304 (2009). https:\/\/doi.org\/10.1103\/PhysRevA.80.012304","journal-title":"Phys. Rev. A"},{"issue":"6","key":"5_CR18","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"D Dieks","year":"1982","unstructured":"Dieks, D.: Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982)","journal-title":"Phys. Lett. A"},{"issue":"5653","key":"5_CR19","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1126\/science.1090790","volume":"302","author":"J Emerson","year":"2003","unstructured":"Emerson, J., Weinstein, Y.S., Saraceno, M., Lloyd, S., Cory, D.G.: Pseudo-random unitary operators for quantum information processing. Science 302(5653), 2098\u20132100 (2003)","journal-title":"Science"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"190503","DOI":"10.1103\/PhysRevLett.105.190503","volume":"105","author":"E Farhi","year":"2010","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Nagaj, D., Shor, P.: Quantum state restoration and single-copy tomography for ground states of hamiltonians. Phys. Rev. Lett. 105, 190503 (2010). https:\/\/doi.org\/10.1103\/PhysRevLett.105.190503","journal-title":"Phys. Rev. Lett."},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Shor, P.: Quantum money from knots. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 276\u2013289. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2090236.2090260","DOI":"10.1145\/2090236.2090260"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1103\/PhysRevLett.72.1148","volume":"72","author":"SK Foong","year":"1994","unstructured":"Foong, S.K., Kanno, S.: Proof of Page\u2019s conjecture on the average entropy of a subsystem. Phys. Rev. Lett. 72, 1148\u20131151 (1994). https:\/\/doi.org\/10.1103\/PhysRevLett.72.1148","journal-title":"Phys. Rev. Lett."},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions (extended abstract). In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_22"},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986). https:\/\/doi.org\/10.1145\/6490.6503","journal-title":"J. ACM"},{"key":"5_CR25","unstructured":"Harrow, A.W.: The church of the symmetric subspace. arXiv:1308.6595 (2013)"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-642-03685-9_41","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Low, R.A.: Efficient quantum tensor product expanders and k-designs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM-2009. LNCS, vol. 5687, pp. 548\u2013561. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_41"},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00220-006-1535-6","volume":"265","author":"P Hayden","year":"2006","unstructured":"Hayden, P., Leung, D.W., Winter, A.: Aspects of generic entanglement. Commun. Math. Phys. 265(1), 95\u2013117 (2006). https:\/\/doi.org\/10.1007\/s00220-006-1535-6","journal-title":"Commun. Math. Phys."},{"issue":"3","key":"5_CR29","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/S0019-9958(67)90302-6","volume":"10","author":"CW Helstrom","year":"1967","unstructured":"Helstrom, C.W.: Detection theory and quantum mechanics. Inf. Control 10(3), 254\u2013291 (1967)","journal-title":"Inf. Control"},{"key":"5_CR30","first-page":"133","volume":"26","author":"AS Holevo","year":"1972","unstructured":"Holevo, A.S.: An analogue of statistical decision theory and noncommutative probability theory. Tr. Mosk. Matematicheskogo Obshchestva 26, 133\u2013149 (1972)","journal-title":"Tr. Mosk. Matematicheskogo Obshchestva"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1103\/RevModPhys.81.865","volume":"81","author":"R Horodecki","year":"2009","unstructured":"Horodecki, R., Horodecki, P., Horodecki, M., Horodecki, K.: Quantum entanglement. Rev. Mod. Phys. 81, 865\u2013942 (2009). https:\/\/doi.org\/10.1103\/RevModPhys.81.865","journal-title":"Rev. Mod. Phys."},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 220\u2013229. ACM, New York (1997). https:\/\/doi.org\/10.1145\/258533.258590","DOI":"10.1145\/258533.258590"},{"key":"5_CR33","unstructured":"Kueng, R., Gross, D.: Qubit stabilizer states are complex projective 3-designs. arXiv:1510.02767 (2015)"},{"key":"5_CR34","unstructured":"Liu, Z.W., Lloyd, S., Zhu, E.Y., Zhu, H.: Entropic scrambling complexities. arXiv:1703.08104 (2017)"},{"issue":"2111","key":"5_CR35","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1098\/rspa.2009.0232","volume":"465","author":"RA Low","year":"2009","unstructured":"Low, R.A.: Large deviation bounds for k-designs. Proc. R. Soc. Lond. A: Math. Phys. Eng. Sci. 465(2111), 3289\u20133308 (2009). http:\/\/rspa.royalsocietypublishing.org\/content\/465\/2111\/3289","journal-title":"Proc. R. Soc. Lond. A: Math. Phys. Eng. Sci."},{"issue":"5","key":"5_CR36","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1063\/1.523763","volume":"19","author":"E Lubkin","year":"1978","unstructured":"Lubkin, E.: Entropy of an n-system from its correlation with a k-reservoir. J. Math. Phys. 19(5), 1028\u20131031 (1978)","journal-title":"J. Math. Phys."},{"issue":"2","key":"5_CR37","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"5_CR38","unstructured":"Lutomirski, A.: An online attack against Wiesner\u2019s quantum money. arXiv:1010.0256 (2010)"},{"key":"5_CR39","unstructured":"Lutomirski, A., Aaronson, S., Farhi, E., Gosset, D., Hassidim, A., Kelner, J., Shor, P.: Breaking and making quantum money: toward a new quantum cryptographic protocol. In: Proceedings of the Innovations in Theoretical Computer Science Conference, ITCS 2010, pp. 20\u201331. Tsinghua University Press (2010)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Mezher, R., Ghalbouni, J., Dgheim, J., Markham, D.: Efficient quantum pseudorandomness with simple graph states. arXiv:1709.08091 (2017)","DOI":"10.1103\/PhysRevA.97.022333"},{"issue":"4","key":"5_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/2885493","volume":"63","author":"CA Miller","year":"2016","unstructured":"Miller, C.A., Shi, Y.: Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices. J. ACM (JACM) 63(4), 33 (2016)","journal-title":"J. ACM (JACM)"},{"key":"5_CR42","series-title":"Contemporary Mathematics","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/conm\/523\/10311","volume-title":"Error-Correcting Codes, Finite Geometries and Cryptography","author":"M Mosca","year":"2010","unstructured":"Mosca, M., Stebila, D.: Quantum coins. In: Bruen, A.A., Wehlau, D.L. (eds.) Error-Correcting Codes, Finite Geometries and Cryptography. Contemporary Mathematics, vol. 523, pp. 35\u201347. American Mathematical Society, Providence (2010). http:\/\/www.ams.org\/bookstore?fn=20&arg1=conmseries&ikey=CONM-523"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"021006","DOI":"10.1103\/PhysRevX.7.021006","volume":"7","author":"Y Nakata","year":"2017","unstructured":"Nakata, Y., Hirche, C., Koashi, M., Winter, A.: Efficient quantum pseudorandomness with nearly time-independent Hamiltonian dynamics. Phys. Rev. X 7, 021006 (2017). https:\/\/doi.org\/10.1103\/PhysRevX.7.021006","journal-title":"Phys. Rev. X"},{"issue":"5","key":"5_CR44","doi-asserted-by":"publisher","first-page":"052203","DOI":"10.1063\/1.4983266","volume":"58","author":"Y Nakata","year":"2017","unstructured":"Nakata, Y., Hirche, C., Morgan, C., Winter, A.: Unitary 2-designs from random X- and Z-diagonal unitaries. J. Math. Phys. 58(5), 052203 (2017). https:\/\/doi.org\/10.1063\/1.4983266","journal-title":"J. Math. Phys."},{"issue":"5","key":"5_CR45","doi-asserted-by":"publisher","first-page":"053043","DOI":"10.1088\/1367-2630\/16\/5\/053043","volume":"16","author":"Y Nakata","year":"2014","unstructured":"Nakata, Y., Koashi, M., Murao, M.: Generating a state t-design by diagonal quantum circuits. New J. Phys. 16(5), 053043 (2014). http:\/\/stacks.iop.org\/1367-2630\/16\/i=5\/a=053043","journal-title":"New J. Phys."},{"issue":"2","key":"5_CR46","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336\u2013375 (1999). https:\/\/doi.org\/10.1006\/jcss.1998.1618","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR47","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80043-1","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Ortigoso, J.: Twelve years before the quantum no-cloning theorem. arXiv:1707.06910 (2017)","DOI":"10.1119\/1.5021356"},{"key":"5_CR49","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1103\/PhysRevLett.71.1291","volume":"71","author":"DN Page","year":"1993","unstructured":"Page, D.N.: Average entropy of a subsystem. Phys. Rev. Lett. 71, 1291\u20131294 (1993). https:\/\/doi.org\/10.1103\/PhysRevLett.71.1291","journal-title":"Phys. Rev. Lett."},{"key":"5_CR50","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00708652","volume":"1","author":"JL Park","year":"1970","unstructured":"Park, J.L.: The concept of transition in quantum mechanics. Found. Phys. 1, 23\u201333 (1970)","journal-title":"Found. Phys."},{"issue":"11","key":"5_CR51","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1038\/nphys444","volume":"2","author":"S Popescu","year":"2006","unstructured":"Popescu, S., Short, A.J., Winter, A.: Entanglement and the foundations of statistical mechanics. Nat. Phys. 2(11), 754 (2006)","journal-title":"Nat. Phys."},{"issue":"6","key":"5_CR52","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387\u2013394. ACM (1990)","DOI":"10.1145\/100216.100269"},{"key":"5_CR54","doi-asserted-by":"publisher","first-page":"5653","DOI":"10.1103\/PhysRevE.52.5653","volume":"52","author":"J S\u00e1nchez-Ruiz","year":"1995","unstructured":"S\u00e1nchez-Ruiz, J.: Simple proof of Page\u2019s conjecture on the average entropy of a subsystem. Phys. Rev. E 52, 5653\u20135655 (1995). https:\/\/doi.org\/10.1103\/PhysRevE.52.5653","journal-title":"Phys. Rev. E"},{"key":"5_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevLett.77.1","volume":"77","author":"S Sen","year":"1996","unstructured":"Sen, S.: Average entropy of a quantum subsystem. Phys. Rev. Lett. 77, 1\u20133 (1996). https:\/\/doi.org\/10.1103\/PhysRevLett.77.1","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"5_CR56","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A Shamir","year":"1983","unstructured":"Shamir, A.: On the generation of cryptographically strong pseudorandom sequences. ACM Trans. Comput. Syst. 1(1), 38\u201344 (1983). https:\/\/doi.org\/10.1145\/357353.357357","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_CR57","unstructured":"Song, F.: Quantum-secure pseudorandom permutations, June 2017. Blog post. http:\/\/qcc.fangsong.info\/2017-06-quantumprp\/"},{"key":"5_CR58","doi-asserted-by":"crossref","unstructured":"Watrous, J.: The Theory of Quantum Information. Cambridge University Press, Cambridge (2018, to be published). A draft copy is available at https:\/\/cs.uwaterloo.ca\/~watrous\/TQI\/","DOI":"10.1017\/9781316848142"},{"issue":"15&16","key":"5_CR59","first-page":"1379","volume":"16","author":"Z Webb","year":"2016","unstructured":"Webb, Z.: The Clifford group forms a unitary 3-design. Quantum Inf. Comput. 16(15&16), 1379\u20131400 (2016). http:\/\/www.rintonpress.com\/xxqic16\/qic-16-1516\/1379-1400.pdf","journal-title":"Quantum Inf. Comput."},{"key":"5_CR60","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1103\/PhysRevA.58.1827","volume":"58","author":"RF Werner","year":"1998","unstructured":"Werner, R.F.: Optimal cloning of pure states. Phys. Rev. A 58, 1827\u20131832 (1998). https:\/\/doi.org\/10.1103\/PhysRevA.58.1827","journal-title":"Phys. Rev. A"},{"issue":"1","key":"5_CR61","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983). Original manuscript written Circa 1970","journal-title":"SIGACT News"},{"key":"5_CR62","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299, 802\u2013803 (1982)","journal-title":"Nature"},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 80\u201391, November 1982","DOI":"10.1109\/SFCS.1982.45"},{"issue":"13\u201314","key":"5_CR64","first-page":"1089","volume":"14","author":"H Yuen","year":"2014","unstructured":"Yuen, H.: A quantum lower bound for distinguishing random functions from random permutations. Quantum Inf. Comput. 14(13\u201314), 1089\u20131097 (2014). http:\/\/dl.acm.org\/citation.cfm?id=2685166","journal-title":"Quantum Inf. Comput."},{"key":"5_CR65","unstructured":"Zhandry, M.: How to construct quantum random functions. In: FOCS 2012, pp. 679\u2013687. IEEE (2012). http:\/\/eprint.iacr.org\/2012\/182"},{"key":"5_CR66","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. Quantum Inf. Comput. 15(7&8) (2015). http:\/\/arxiv.org\/abs\/1312.1027"},{"key":"5_CR67","unstructured":"Zhandry, M.: A note on quantum-secure PRPs (2016). https:\/\/eprint.iacr.org\/2016\/1076"},{"key":"5_CR68","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. iACR eprint 2017\/1080 (2017)"},{"key":"5_CR69","unstructured":"Zhu, H.: Multiqubit Clifford groups are unitary 3-designs. arXiv:1510.02619 (2015)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96878-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T02:07:08Z","timestamp":1661652428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96878-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968773","9783319968780"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}