ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2410.04984
  4. Cited By
A Meta-Complexity Characterization of Quantum Cryptography

A Meta-Complexity Characterization of Quantum Cryptography

7 October 2024
Bruno Cavalar
Eli Goldin
Matthew Gray
Peter Hall
ArXivPDFHTML

Papers citing "A Meta-Complexity Characterization of Quantum Cryptography"

2 / 2 papers shown
Title
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
Bill Fefferman
Soumik Ghosh
Makrand Sinha
Henry Yuen
21
0
0
21 Apr 2025
Founding Quantum Cryptography on Quantum Advantage, or, Towards
  Cryptography from $\mathsf{\#P}$-Hardness
Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from #P\mathsf{\#P}#P-Hardness
Dakshita Khurana
Kabir Tomer
19
8
0
23 Sep 2024
1