4 papers · 1 filter
Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
Bruno Cavalar, Eli Goldin, Matthew Gray +3
One of the most fundamental problems in distribution testing is the identity testing problem: given samples , the goal is to determine whether the samples are drawn…
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…
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…
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…