Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Ryuhei Mori"'
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::987779dabad6e3d8d2b5f249adcdc6f8
http://arxiv.org/abs/2205.15478
http://arxiv.org/abs/2205.15478
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70eeb5ce42388a2f7c24f233d7bd662f
http://arxiv.org/abs/2102.01960
http://arxiv.org/abs/2102.01960
Autor:
Kazuya Shimizu, Ryuhei Mori
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
LATIN
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3742c85e88c911bcf709a8ee342c53c8
https://doi.org/10.1007/978-3-030-61792-9_31
https://doi.org/10.1007/978-3-030-61792-9_31
Autor:
Ryuhei Mori, Nobutaka Shimizu
Publikováno v:
NOCS
A network topology with low average shortest path length (ASPL) provides efficient data transmission while the number of nodes and the number of links incident to each node are often limited due to physical constraints. In this paper, we consider the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c403b0455ac04dcb88cee2c1c265a6bb
http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100740886
http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100740886
Autor:
Ryuhei Mori
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49e3cc491014f6349a28ce582b1bfd60
http://arxiv.org/abs/1803.09947
http://arxiv.org/abs/1803.09947
Publikováno v:
STOC
Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen literals.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b8aa35734b81fb54f054969460e8a14
Autor:
Ryuhei Mori, Toshiyuki Tanaka
Publikováno v:
IEEE Transactions on Information Theory. 60:2720-2736
Polarization phenomenon over any finite field Fq with size q being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arikan for the binary field, as well as its extension to a prime
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ca8216f6fb9131a368eb431193e6d66
https://doi.org/10.1109/tit.2014.2312181
https://doi.org/10.1109/tit.2014.2312181
Publikováno v:
IEEE Transactions on Information Theory. 59(No. 1):238-253
We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as blocklength tends to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a295aabaf48c1c952c836166690e09ed
http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100803851
http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100803851
Autor:
Ryuhei Mori
Publikováno v:
Physical Review A. 94
Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)] showed that shared nonlocal boxes with the CHSH probability greater than $\frac{3+\sqrt{6}}6$ yields trivial communication complexity. There still exists the gap with the maximum CHSH probability $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8657eeef9b88cd9b0c78a4b7d633f605
https://doi.org/10.1103/physreva.94.052130
https://doi.org/10.1103/physreva.94.052130