A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire (2411.00529v1)
Abstract: Aaronson, Atia, and Susskind established that swapping quantum states $|\psi\rangle$ and $|\phi\rangle$ is computationally equivalent to distinguishing their superpositions $|\psi\rangle\pm|\phi\rangle$. We extend this to a general duality principle: manipulating quantum states in one basis is equivalent to extracting values in a complementary basis. Formally, for any group, implementing a unitary representation is equivalent to Fourier subspace extraction from its irreducible representations. Building on this duality principle, we present the applications: * Quantum money, representing verifiable but unclonable quantum states, and its stronger variant, quantum lightning, have resisted secure plain-model constructions. While (public-key) quantum money has been constructed securely only from the strong assumption of quantum-secure iO, quantum lightning has lacked such a construction, with past attempts using broken assumptions. We present the first secure quantum lightning construction based on a plausible cryptographic assumption by extending Zhandry's construction from Abelian to non-Abelian group actions, eliminating reliance on a black-box model. Our construction is realizable with symmetric group actions, including those implicit in the McEliece cryptosystem. * We give an alternative quantum lightning construction from one-way homomorphisms, with security holding under certain conditions. This scheme shows equivalence among four security notions: quantum lightning security, worst-case and average-case cloning security, and security against preparing a canonical state. * Quantum fire describes states that are clonable but not telegraphable: they cannot be efficiently encoded classically. These states "spread" like fire, but are viable only in coherent quantum form. The only prior construction required a unitary oracle; we propose the first candidate in the plain model.
- Scott Aaronson. Quantum copy-protection and quantum money. In Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC ’09, pages 229–242, Washington, DC, USA, 2009. IEEE Computer Society.
- On the hardness of detecting macroscopic superpositions, 2020.
- Quantum money from hidden subspaces. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC ’12, page 41–60, New York, NY, USA, 2012. Association for Computing Machinery.
- One-shot signatures and applications to hybrid quantum/classical authentication. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, 52nd ACM STOC, pages 255–268. ACM Press, June 2020.
- Quantum NP - a survey, 2002.
- László Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’16, page 684–697, New York, NY, USA, 2016. Association for Computing Machinery.
- Shalev Ben-David and Or Sattath. Quantum Tokens for Digital Signatures. Quantum, 7:901, January 2023.
- Robert Beals. Quantum computation of fourier transforms over symmetric groups. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 48–53, 1997.
- Non-quantum cryptanalysis of the noisy version of aaronson–christiano’s quantum money scheme. IET Information Security, 13(4):362–366, 2019.
- Quantum money from knots. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS ’12, page 276–289, New York, NY, USA, 2012. Association for Computing Machinery.
- W. T. Gowers and O. Hatami. Inverse and stability theorems for approximate representations of finite groups, 2016.
- Robust combiners and universal constructions for quantum cryptography. In TCC, 2024.
- From the hardness of detecting superpositions to cryptography: Quantum public key encryption and commitments. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 639–667. Springer, 2023.
- S Issai. Neue begründung der theorie der gruppencharaktere, 1905.
- On ε𝜀\varepsilonitalic_ε-representations. Israel Journal of Mathematics, 43:315–323, 1982.
- Publicly verifiable quantum money from random lattices, 2022.
- Quantum public-key encryption with tamper-resilient public keys from one-way functions. In Leonid Reyzin and Douglas Stebila, editors, Advances in Cryptology – CRYPTO 2024, pages 93–125, Cham, 2024. Springer Nature Switzerland.
- Quantum money from quaternion algebras. Mathematical Cryptology, 2(1):60–83, Oct. 2022.
- Breaking and making quantum money: toward a new quantum cryptographic protocol, 2009.
- On the rigidity of sparse random graphs. Journal of Graph Theory, 85(2):466–480, 2017.
- Another round of breaking and making quantum money: How to not build it from lattices, and more. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part I, volume 14004 of LNCS, pages 611–638. Springer, Heidelberg, April 2023.
- Robert J McEliece. A public-key cryptosystem based on algebraic. Coding Thv, 4244:114–116, 1978.
- Robust quantum public-key encryption with applications to quantum key distribution. In Leonid Reyzin and Douglas Stebila, editors, Advances in Cryptology – CRYPTO 2024, pages 126–151, Cham, 2024. Springer Nature Switzerland.
- Quantum unpredictability. In Asiacrypt, 2024.
- Full quantum equivalence of group action dlog and cdh, and more. In International Conference on the Theory and Application of Cryptology and Information Security, pages 3–32. Springer, 2022.
- A computational separation between quantum no-cloning and no-telegraphing. In ITCS 2024, 2023.
- Bhaskar Roberts. Security analysis of quantum lightning. In Anne Canteaut and François-Xavier Standaert, editors, Advances in Cryptology – EUROCRYPT 2021, pages 562–567, Cham, 2021. Springer International Publishing.
- Jean-Pierre Serre et al. Linear representations of finite groups, volume 42. Springer, 1977.
- P.W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 124–134, 1994.
- Asymptotic of the largest and the typical dimensions of irreducible representations of a symmetric group. Functional analysis and its applications, 19(1):21–31, 1985.
- Stephen Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, January 1983.
- Jun Yan. General properties of quantum bit commitments. In International Conference on the Theory and Application of Cryptology and Information Security, pages 628–657. Springer, 2022.
- Mark Zhandry. Quantum lightning never strikes the same state twice. or: quantum money from cryptographic assumptions. Journal of Cryptology, 34:1–56, 2021.
- Mark Zhandry. Quantum money from abelian group actions. In ITCS 2024, 2024. https://eprint.iacr.org/2023/1097.