1 citations · 1 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2026★ 1 cited
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…
quant-ph2024
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…