| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2024-05-08 14:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Physical Bucket Sort on Two Kind of Items Hitomi Kozaki, Atsuki Nagao (Ochanomizu Univ.) |
(To be available after the conference date) [more] | |
| QIT (2nd) |
2022-12-08 14:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Note on Quantum Divide and Conquer for Minimal String Rotation Qisheng Wang (NU) |
Lexicographically minimal string rotation is a fundamental problem on string processing that has recently attracted a lo... [more] | |
| QIT (2nd) |
2021-05-24 12:10 |
Online | Online | Tighter lower bounds of the error probability of multiple quantum channel discrimination Ryo Ito, Ryuhei Mori (Tokyo Tech) |
We give lower bounds of the error probability of general multiple quantum channel discrimination problem for a given num... [more] | |
| QIT (2nd) |
2021-05-25 10:30 |
Online | Online | On Efficiencies of Two TPCP maps Discrimination using Quantum Queries Takehisa Iwakoshi (Mie Univ.) |
This study analyses the efficiency of three strategies to discriminate two Trace-Preserving Completely Positive maps (TP... [more] | |
| QIT (2nd) |
2021-05-24 13:30 |
Online | Online | [Poster Presentation]
Poster Presentation: Adversary Bound for Inverting Permutations via Representation Theory Francois Le Gall, Ansis Rosmanis (Nagoya University) |
We study adversary lower bounds on the quantum query complexity of the problem of inverting a permutation. An adversary ... [more] | |
| QIT (2nd) |
2013-11-18 11:40 |
Tokyo | Waseda Univ. | Quantum algorithms for finding constant-sized sub-hypergraphs over 3-uniform hypergraphs Francois Le Gall (Tokyo Univ.), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT) |
We develop a framework based on nested quantum walks for finding a constant-sized sub-hypergraph in a $3$-uniform hyper... [more] | |
| COMP, IPSJ-AL | 2013-05-17 13:35 |
Hokkaido | Otaru University of Commerce | Query Complexity of Witness Finding Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.)  COMP2013-11 |
For any polynomial-time relation L subset_of {0,1}^m x {0,1}^n where n = m^{O(1)}, the classic search-to-decision reduct... [more] | COMP2013-11 pp.39-46 |
| QIT (2nd) |
2012-11-27 - 2012-11-28 |
Kanagawa | Keio Univ. Hiyoshi Campus | [Poster Presentation]
Quantum Query Complexity on Enumerating Collisions Masahide Yamato (Osaka Pref Univ.), Harumichi Nishimura (Nagoya Univ.) |
A collision of a function $f$ (i.e. a pair $(x,y)$ such that $f(x)=f(y)$) is one of the basic concepts on a function. Th... [more] | |
| COMP | 2012-04-27 10:35 |
Osaka | Osaka Prefecture University | Reconstructing Strings from Substrings with Quantum Queries Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) COMP2012-2 |
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string fro... [more] |
COMP2012-2 pp.7-14 |
| COMP | 2008-03-10 09:55 |
Kanagawa | Unbounded-Error Quantum Query Complexity Ashley Montanaro (Univ. of Bristol), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (IBM) COMP2007-56 |
This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only requ... [more] | COMP2007-56 pp.9-14 |
|
[Return to Top Page]