Taiga Hiroka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Taiga Hiroka has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Ryo Nishimaki
NTT Social Informatics Laboratories
2 shared publicationsTakashi Yamakawa
Kyoto University
2 shared publications- Takashi Yamakawa
Kyoto University
2 shared publications Fuyuki Kitagawa
NTT Social Informatics Laboratories
1 shared publication- Fuyuki Kitagawa
NTT Social Informatics Laboratories
1 shared publication - Min-Hsiu Hsieh
Foxconn Research Taipei Taiwan
1 shared publication
Latest Publications
- 28 November 2024
- Published by Springer Nature
- p. 126-158
Robust Combiners and Universal Constructions for Quantum Cryptography
- 28 November 2024
- Published by Springer Nature
- p. 126-158
Robust Combiners and Universal Constructions for Quantum Cryptography
- Open Access
Computational Complexity of Learning Efficiently Generatable Pure States
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the computational complexity of quantum state learning, which can be seen as a quantum generalization of distributional learning introduced by Kearns et.al [STOC94]. Previous works by Chung and Lin [TQC21], and Bădescu and O$'$Donnell [STOC21] study the sample complexity of the quantum state learning and show that polynomial copies are sufficient if unknown quantum states are promised efficiently generatable. However, their algorithms are inefficient, and the computational complexity of this learning problem remains unresolved. In this work, we study the computational complexity of quantum state learning when the states are promised to be efficiently generatable. We show that if unknown quantum states are promised to be pure states and efficiently generateable, then there exists a quantum polynomial time algorithm $A$ and a language $L \in PP$ such that $A^L$ can learn its classical description. We also observe the connection between the hardness of learning quantum states and quantum cryptography. We show that the existence of one-way state generators with pure state outputs is equivalent to the average-case hardness of learning pure states. Additionally, we show that the existence of EFI implies the average-case hardness of learning mixed states.Open AccessComputational Complexity of Learning Efficiently Generatable Pure States
Understanding the computational complexity of learning efficient classical programs in various learning models has been a fundamental and important question in classical computational learning theory. In this work, we study the computational complexity of quantum state learning, which can be seen as a quantum generalization of distributional learning introduced by Kearns et.al [STOC94]. Previous works by Chung and Lin [TQC21], and Bădescu and O$'$Donnell [STOC21] study the sample complexity of the quantum state learning and show that polynomial copies are sufficient if unknown quantum states are promised efficiently generatable. However, their algorithms are inefficient, and the computational complexity of this learning problem remains unresolved. In this work, we study the computational complexity of quantum state learning when the states are promised to be efficiently generatable. We show that if unknown quantum states are promised to be pure states and efficiently generateable, then there exists a quantum polynomial time algorithm $A$ and a language $L \in PP$ such that $A^L$ can learn its classical description. We also observe the connection between the hardness of learning quantum states and quantum cryptography. We show that the existence of one-way state generators with pure state outputs is equivalent to the average-case hardness of learning pure states. Additionally, we show that the existence of EFI implies the average-case hardness of learning mixed states. - Open Access
Robust Combiners and Universal Constructions for Quantum Cryptography
A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of the original candidates satisfies correctness and security. A universal construction is a closely related notion to a robust combiner. A universal construction for a primitive is an explicit construction of the primitive that is correct and secure as long as the primitive exists. It is known that a universal construction for a primitive can be constructed from a robust combiner for the primitive in many cases. Although robust combiners and universal constructions for classical cryptography are widely studied, robust combiners and universal constructions for quantum cryptography have not been explored so far. In this work, we define robust combiners and universal constructions for several quantum cryptographic primitives including one-way state generators, public-key quantum money, quantum bit commitments, and unclonable encryption, and provide constructions of them. On a different note, it was an open problem how to expand the plaintext length of unclonable encryption. In one of our universal constructions for unclonable encryption, we can expand the plaintext length, which resolves the open problem.
Open AccessRobust Combiners and Universal Constructions for Quantum Cryptography
A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of the original candidates satisfies correctness and security. A universal construction is a closely related notion to a robust combiner. A universal construction for a primitive is an explicit construction of the primitive that is correct and secure as long as the primitive exists. It is known that a universal construction for a primitive can be constructed from a robust combiner for the primitive in many cases. Although robust combiners and universal constructions for classical cryptography are widely studied, robust combiners and universal constructions for quantum cryptography have not been explored so far. In this work, we define robust combiners and universal constructions for several quantum cryptographic primitives including one-way state generators, public-key quantum money, quantum bit commitments, and unclonable encryption, and provide constructions of them. On a different note, it was an open problem how to expand the plaintext length of unclonable encryption. In one of our universal constructions for unclonable encryption, we can expand the plaintext length, which resolves the open problem.
- 12 October 2022
- Published by Springer Nature
- p. 239-268
Certified Everlasting Zero-Knowledge Proof for QMA
- 12 October 2022
- Published by Springer Nature
- p. 239-268
Certified Everlasting Zero-Knowledge Proof for QMA
- 1 December 2021
- Published by Springer Nature
- p. 606-636
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication
- 1 December 2021
- Published by Springer Nature
- p. 606-636
Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication