29 citations · 47 across the 7 of their papers we have counts for
10 papers
Classical Hardness of Learning Functions of Hamiltonians
Sota Hashimoto, Akinori Kawachi
Morohoshi, Nakayama, Manabe, and Mitarai proposed a physically motivated quantum machine learning problem in which the goal is to predict quantities of the form $\operatorname{Tr}[…
Quantum Query Complexity for List Search
Niranka Banerjee, Akinori Kawachi
Searching in a linked list is one of the most basic problems in classical algorithms. Although the nodes of the list come with memory addresses, classically those addresses play no…
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher
Akinori Kawachi, Yuki Naito
The Even-Mansour (EM) cipher is one of the famous constructions for a block cipher. Kuwakado and Morii demonstrated that a quantum adversary can recover its -bit secret keys onl…
Communication Complexity of Private Simultaneous Quantum Messages Protocols
Akinori Kawachi, Harumichi Nishimura
The private simultaneous messages model is a non-interactive version of the multiparty secure computation, which has been intensively studied to examine the communication cost of t…
On the Power of Quantum Encryption Keys
Akinori Kawachi, Christopher Portmann
The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message c…
Quantum Measurements for Hidden Subgroup Problems with Optimal Sample Complexity
Masahito Hayashi, Akinori Kawachi, Hirotada Kobayashi
One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve…