| 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 # | |
| QIT (2nd) |
2022-12-08 16:30 |
Kanagawa | Keio Univ. (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
Bounds on oblivious quantum multiparty communication complexity Francois Le Gall, Daiki Suruga (Nagoya Univ.) |
[more] | |
| QIT (2nd) |
2022-12-08 16:45 |
Kanagawa | Keio Univ. (Kanagawa, Online) (Primary: On-site, Secondary: Online) |
Improved Hardness Results for the Guided Local Hamiltonian Problem Ryu Hayakawa (Kyoto Univ.), Francois Le Gall (Nagoya Univ.), Sevag Gharibian (Paderborn University), Tomoyuki Morimae (Kyoto Univ.) |
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further... [more] | |
| COMP | 2021-12-03 14:20 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Ishikawa, Online) (Primary: On-site, Secondary: Online) |
Computational Power of Shallow Quantum Circuits with Fan-out Gates Ryoga Araki, Akinori Kawachi (Mie Univ.), Francois Le Gall, Ansis Rosmanis (Nagoya Univ.)  COMP2021-26 |
Quantum computers are expected to solve some problems much faster than classical computers. However, today's quantum com... [more] | COMP2021-26 pp.24-29 |
| COMP, IPSJ-AL | 2021-08-25 11:00 |
Online | Online (Online) | Lower Bounds for Induced Cycle Detection in Distributed Computing Francois Le Gall, Masayuki Miyamoto (Nagoya Univ.) COMP2021-9 |
The distributed subgraph detection asks, for a fixed graph $H$, whether the $n$-node input graph contains $H$ as a subgr... [more] | COMP2021-9 pp.1-8 |
| QIT (2nd) |
2021-05-24 13:30 |
Online | 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] | |
| COMP | 2021-03-08 11:30 |
Online | Online (Online) | [Invited Talk]
Tight Distributed Listing of Cliques Keren Censor-Hillel (Technion), Yi-Jun Chang (ETH), François Le Gall (Nagoya Univ.), Dean Leitersdorf (Technion) COMP2020-31 |
Much progress has recently been made in understanding the complexity landscape of subgraph finding problems in the CONGE... [more] | COMP2020-31 p.24 |
| QIT (2nd) |
2019-11-18 13:50 |
Tokyo | Gakushuin University (Tokyo) | [Poster Presentation]
Quantum Communication Complexity of Distribution Testing Aleksandrs Belovs (Univ. of Latvia), Arturo Castellanos (Kyoto Univ.), Francois Le Gall, Guillaume Malod (Nagoya Univ.) |
We study the quantum version of the closeness testing problem in communication complexity, in the case where Alice and B... [more] | |
| QIT (2nd) |
2019-05-20 15:50 |
Fukuoka | Kyushu University, Chikushi Campus (Fukuoka) | Quantum Advantage for the LOCAL Model in Distributed Computing Francois Le Gall (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.), Ansis Rosmanis (CQT) |
[more] | |
| COMP | 2018-09-18 16:00 |
Fukuoka | Kyusyu Institute of Technology (Fukuoka) | NP-hardness of k-modularity maximization on sparse graphs Shunsuke Hirata, Francois Le Gall, Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2018-18 |
[more] | COMP2018-18 pp.63-68 |
| QIT (2nd) |
2018-06-04 11:40 |
Hiroshima | ICCH Ran (Hiroshima) | Sublinear-Time Quantum Computation of the Diameter in Distributed Networks Francois Le Gall (Kyoto Univ.), Frederic Magniez (CNRS) |
[more] | |
| COMP | 2017-10-27 13:30 |
Tokyo | (Tokyo) | Modified group nonmembership is in AWPP Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Francois Le Gall (Kyoto Univ.) |
[more] | |
| COMP | 2016-10-21 10:30 |
Miyagi | Tohoku University (Miyagi) | Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems Francois Le Gall (Kyoto Univ.) COMP2016-24 |
Censor-Hillel et al.~[PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix ... [more] | COMP2016-24 pp.9-15 |
| QIT (2nd) |
2015-11-25 11:10 |
Kanagawa | NTT Atsugi R&D center (Kanagawa) | Quantum Algorithm for Triangle Finding in Sparse Graphs Francois Le Gall, Shogo Nakajima (Univ. Tokyo) |
[more] | |
| COMP | 2015-10-02 11:00 |
Tokyo | (Tokyo) | Quantum Algorithm for Triangle Finding in Sparse Graphs Francois Le Gall, Shogo Nakajima (Univ. of Tokyo) COMP2015-24 |
[more] | COMP2015-24 pp.13-16 |
| QIT (2nd) |
2013-11-18 11:40 |
Tokyo | Waseda Univ. (Tokyo) | 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 | 2013-06-24 15:45 |
Nara | Nara Women's University (Nara) | Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete Hirotada Kobayashi (NII), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.) COMP2013-24 |
This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is prove... [more] | COMP2013-24 pp.31-38 |
| QIT (2nd) |
2013-05-28 09:40 |
Hokkaido | Hokkaido Univ. (Hokkaido) | Quantum Algorithms for Matrix Products over Semirings Francois Le Gall (Tokyo Univ.), Harumichi Nishimura (Nagoya Univ.) |
We construct in this paper quantum algorithms for matrix multiplication over several algebraic structures known as semir... [more] | |
| COMP | 2012-09-03 15:25 |
Tokyo | Hosei University (Tokyo) | Faster Algorithms for Rectangular Matrix Multiplication Francois Le Gall (Univ. of Tokyo) COMP2012-32 |
Let $\alpha$ be the maximal value such that the product of an $n\times n^\alpha$ matrix by an $n^\alpha\times n$ matrix ... [more] | COMP2012-32 pp.41-48 |
| COMP | 2012-04-27 10:35 |
Osaka | Osaka Prefecture University (Osaka) | 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 |
| QIT (2nd) |
2011-11-21 10:40 |
Osaka | Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) (Osaka) | Improved Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication Francois Le Gall (Tokyo Univ.) |
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity... [more] | |
[Return to Top Page]