66 citations · 215 across the 34 of their papers we have counts for
36 papers
Parameterized Quantum Query Algorithms for Graph Problems
Tatsuya Terao, Ryuhei Mori
In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for -vertex cover and -matching pro…
Complexity of graph-state preparation by Clifford circuits
Soh Kumabe, Ryuhei Mori, Yusei Yoshimura
In this work, we study the complexity of graph-state preparation in a general model of quantum algorithms that allows measurements in the computational basis, single-qubit Clifford…
Quantum Algorithm for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection
Masaya Norimoto, Ryuhei Mori, Naoki Ishikawa
In this paper, we propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization (HUBO) problem. This algorithm is based on the Grover adapt…
Lower bounds on the error probability of multiple quantum channel discrimination by the Bures angle and the trace distance
Ryo Ito, Ryuhei Mori
Quantum channel discrimination is a fundamental problem in quantum information science. In this study, we consider general quantum channel discrimination problems, and derive the l…
Quantum speedups for dynamic programming on -dimensional lattice graphs
Adam Glos, Martins Kokainis, Ryuhei Mori +1
Motivated by the quantum speedup for dynamic programming on the Boolean hypercube by Ambainis et al. (2019), we investigate which graphs admit a similar quantum advantage. In this…
Quantum supremacy and hardness of estimating output probabilities of quantum circuits
Yasuhiro Kondo, Ryuhei Mori, Ramis Movassagh
Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove un…