Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Mori, Ryuhei"'
Autor:
Terao, Tatsuya, Mori, Ryuhei
In this paper, we consider the parameterized quantum query complexity for graph problems. We design parameterized quantum query algorithms for $k$-vertex cover and $k$-matching problems, and present lower bounds on the parameterized quantum query com
Externí odkaz:
http://arxiv.org/abs/2408.03864
In this work, we study a complexity of graph-state preparation. We consider general quantum algorithms consisting of the Clifford operations on at most two qubits for graph-state preparations. We define the CZ-complexity of graph state $|G\rangle$ as
Externí odkaz:
http://arxiv.org/abs/2402.05874
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 adaptive search that originally supported HUBO with integer coefficients. N
Externí odkaz:
http://arxiv.org/abs/2205.15478
Autor:
Ito, Ryo, Mori, Ryuhei
Quantum channel discrimination is a fundamental problem in quantum information science. In this study, we consider general quantum channel discrimination problems, and derive the lower bounds of the error probability. Our lower bounds are based on th
Externí odkaz:
http://arxiv.org/abs/2107.03948
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 paper, we examine a generalization of the Boolean hypercube graph, the
Externí odkaz:
http://arxiv.org/abs/2104.14384
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
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 under the complexity theoretical assumption of the non-collapse of the p
Externí odkaz:
http://arxiv.org/abs/2102.01960
Autor:
Bostan, Alin, Mori, Ryuhei
We present a simple and fast algorithm for computing the $N$-th term of a given linearly recurrent sequence. Our new algorithm uses $O(\mathsf{M}(d) \log N)$ arithmetic operations, where $d$ is the order of the recurrence, and $\mathsf{M}(d)$ denotes
Externí odkaz:
http://arxiv.org/abs/2008.08822
Autor:
Shimizu, Kazuya, Mori, Ryuhei
The fastest known classical algorithm deciding the $k$-colorability of $n$-vertex graph requires running time $\Omega(2^n)$ for $k\ge 5$. In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time
Externí odkaz:
http://arxiv.org/abs/1907.00529
Autor:
Mori, Ryuhei
In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the periodic F
Externí odkaz:
http://arxiv.org/abs/1803.09947
Autor:
Mori, Ryuhei
We study the number of cycles and their average length in $L\times N$ lattice by using classical method of transfer matrix. In this work, we derive a bivariate generating function $G_3(y, z)$ in which a coefficient of $y^i z^j$ is the number of cycle
Externí odkaz:
http://arxiv.org/abs/1706.05184