3 papers
quant-ph2025
Hardness of Quantum Distribution Learning and Quantum Cryptography
Taiga Hiroka, Min-Hsiu Hsieh, Tomoyuki Morimae
The existence of one-way functions (OWFs) forms the minimal assumption in classical cryptography. However, this is not necessarily the case in quantum cryptography. One-way puzzles…
quant-ph2024
Quantum Cryptography and Meta-Complexity
Taiga Hiroka, Tomoyuki Morimae
In classical cryptography, one-way functions (OWFs) are the minimal assumption, while it is not the case in quantum cryptography. Several new primitives have been introduced such a…
quant-ph2024
Computational Complexity of Learning Efficiently Generatable Pure States
Taiga Hiroka, Min-Hsiu Hsieh
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computatio…