Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire (2411.00529v1)

Published 1 Nov 2024 in quant-ph and cs.CR

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. 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.
  2. On the hardness of detecting macroscopic superpositions, 2020.
  3. 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.
  4. 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.
  5. Quantum NP - a survey, 2002.
  6. 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.
  7. Shalev Ben-David and Or Sattath. Quantum Tokens for Digital Signatures. Quantum, 7:901, January 2023.
  8. 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.
  9. Non-quantum cryptanalysis of the noisy version of aaronson–christiano’s quantum money scheme. IET Information Security, 13(4):362–366, 2019.
  10. 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.
  11. W. T. Gowers and O. Hatami. Inverse and stability theorems for approximate representations of finite groups, 2016.
  12. Robust combiners and universal constructions for quantum cryptography. In TCC, 2024.
  13. 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.
  14. S Issai. Neue begründung der theorie der gruppencharaktere, 1905.
  15. On ε𝜀\varepsilonitalic_ε-representations. Israel Journal of Mathematics, 43:315–323, 1982.
  16. Publicly verifiable quantum money from random lattices, 2022.
  17. 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.
  18. Quantum money from quaternion algebras. Mathematical Cryptology, 2(1):60–83, Oct. 2022.
  19. Breaking and making quantum money: toward a new quantum cryptographic protocol, 2009.
  20. On the rigidity of sparse random graphs. Journal of Graph Theory, 85(2):466–480, 2017.
  21. 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.
  22. Robert J McEliece. A public-key cryptosystem based on algebraic. Coding Thv, 4244:114–116, 1978.
  23. 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.
  24. Quantum unpredictability. In Asiacrypt, 2024.
  25. 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.
  26. A computational separation between quantum no-cloning and no-telegraphing. In ITCS 2024, 2023.
  27. 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.
  28. Jean-Pierre Serre et al. Linear representations of finite groups, volume 42. Springer, 1977.
  29. 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.
  30. 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.
  31. Stephen Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, January 1983.
  32. 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.
  33. Mark Zhandry. Quantum lightning never strikes the same state twice. or: quantum money from cryptographic assumptions. Journal of Cryptology, 34:1–56, 2021.
  34. Mark Zhandry. Quantum money from abelian group actions. In ITCS 2024, 2024. https://eprint.iacr.org/2023/1097.

Summary

  • The paper introduces a duality principle linking unitary representations and Fourier subspace extraction, expanding foundational results in quantum computation.
  • It applies group representation theory to construct quantum money and lightning, using non-Abelian group actions to overcome limitations of previous models.
  • The research pioneers the concept of 'quantum fire,' defining states that are efficiently clonable but resistant to telegraphic transfer, thus advancing secure quantum state management.

Essay on "A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire"

The paper "A General Quantum Duality for Representations of Groups with Applications to Quantum Money, Lightning, and Fire" explores a profound duality within quantum computation, drawing connections between group representations and quantum cryptographic constructs. This duality extends a foundational result by Aaronson, Atia, and Susskind, elucidating the computational equivalence between manipulating quantum states in different bases. The authors generalize this to a broader duality principle for groups, establishing that implementing a unitary representation is equivalent to Fourier subspace extraction corresponding to irreducible representations.

Key Contributions and Applications

  1. Quantum Money and Lightning: The paper presents significant advancements in constructing quantum money and its stricter variant, quantum lightning. These concepts leverage the no-cloning theorem to ensure states are verifiable but unclonable. The manuscript delineates a framework for quantum lightning grounded in concrete cryptographic assumptions, overcoming previous insurmountable barriers in this space.
  2. Enhancing Quantum Money through Group Actions: The duality insights lead to a compelling construction of quantum money using non-Abelian group actions, particularly highlighting advancements over Abelian group-based methods. This transition eradicates prior reliance on idealized models and provides real-world instantiations, notably utilizing group actions from the symmetric group involved in the McEliece cryptosystem.
  3. Quantum Fire and Cloning vs. Telegraphing: Introducing the notion of "quantum fire," the authors discuss states that are efficiently clonable but non-telegraphable, addressing quantum state's inherent intangible properties that prevent classical encoding while allowing replication. The manuscript provides the first plausible construction of quantum fire within a non-oracle model.

Implications and Theoretical Insights

  • Quantum Complexity and Cryptography:

This work has profound implications for quantum cryptographic primitives, offering pathways to secure constructs devoid of overly strong assumptions like indistinguishability obfuscation (iO). The duality principle herein is anticipated to influence quantum complexity theory by establishing new equivalences and simplifying reduction proofs.

  • Practical Cryptographic Schemes:

By applying group action representations, this research advances quantum money's feasibility, presenting verifiable and unclonable currency systems that can transform how digital transactions acknowledge quantum principles.

  • Generalized Framework:

Notably, the framework transcends quantum money to accommodate instances of cryptographic constructs previously not imaginable through singular group action perspectives. This generalization is potent for theorists seeking to extrapolate quantum mechanical phenomena to practical cryptographic applications without rendering classical security assumptions irrelevant.

Future Prospectives

  • Empirical Evaluation:

Real-world adaptation would necessitate simulations and experimental validations on quantum systems capable of exemplifying the discussed duality, particularly focusing on scalability and implementation across varied quantum architecture.

  • Exploration of Non-Abelian Properties:

Delving deeper into non-Abelian groups could uncover new classes of cryptographic functions, further decoupling quantum constructs from classical dependencies, and potential exploration could redefine complexity boundaries.

  • Quantum Networking and State Communication:

The concept of quantum fire suggests novel mechanisms for handling quantum states in distributed networks, proposing decentralized handling of state cloning and distribution while maintaining state integrity.

In conclusion, this paper not only advances theoretical constructs but also sets the foundation for next-generation quantum cryptographic developments. The applications to quantum money, lightning, and fire underscore the depth of the proposed duality principle, marking a significant stride toward practical quantum computing paradigms. The robustness, backed by non-trivial cryptographic assumptions, bolsters confidence in these constructs being pivotal elements in both theoretical exploration and applied quantum computing.

File Document Download Save Streamline Icon: https://streamlinehq.com PDF File Document Download Save Streamline Icon: https://streamlinehq.com Markdown