default search action
François Le Gall
Francois Le Gall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j25]Hugo Delavenne, François Le Gall:
Quantum state synthesis: relation with decision complexity classes and impossibility of error reduction. Quantum Inf. Comput. 24(9&10): 754-765 (2024) - [c59]François Le Gall:
Faster Rectangular Matrix Multiplication by Combination Loss Analysis. SODA 2024: 3765-3791 - [c58]Xavier Coiteux-Roy
, Francesco D'Amore
No Distributed Quantum Advantage for Approximate Graph Coloring. STOC 2024: 1901-1910 - [i72]Amirreza Akbari, Xavier Coiteux-Roy
Online Locality Meets Distributed Quantum Computing. CoRR abs/2403.01903 (2024) - [i71]Hugo Delavenne, François Le Gall:
Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction. CoRR abs/2407.02907 (2024) - [i70]Harry Buhrman, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert Schuch, Suguru Tamaki:
Beating Grover search for low-energy estimation and state preparation. CoRR abs/2407.03073 (2024) - [i69]François Le Gall, Yupan Liu, Harumichi Nishimura, Qisheng Wang:
Space-bounded quantum interactive proof systems. Electron. Colloquium Comput. Complex. TR24: TR24-167 (2024) - 2023
- [j24]François Le Gall, Saeed Seddighin:
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. Algorithmica 85(5): 1251-1286 (2023) - [j23]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. SIAM J. Comput. 52(4): 1009-1038 (2023) - [c57]Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans:
Improved Hardness Results for the Guided Local Hamiltonian Problem. ICALP 2023: 32:1-32:19 - [c56]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. MFCS 2023: 63:1-63:15 - [c55]François Le Gall:
Quantum Distributed Computing: Potential and Limitations (Invited Talk). OPODIS 2023: 2:1-2:1 - [c54]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Quantum Interactive Proofs. STACS 2023: 42:1-42:21 - [i68]Hugo Delavenne, François Le Gall, Yupan Liu
Quantum Merlin-Arthur proof systems for synthesizing quantum states. CoRR abs/2303.01877 (2023) - [i67]François Le Gall:
Robust Dequantization of the Quantum Singular value Transformation and Quantum Machine Learning Algorithms. CoRR abs/2304.04932 (2023) - [i66]François Le Gall:
Faster Rectangular Matrix Multiplication by Combination Loss Analysis. CoRR abs/2307.06535 (2023) - [i65]Xavier Coiteux-Roy
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - [i64]François Le Gall, Yupan Liu
Space-bounded quantum state testing via space-efficient quantum singular value transformation. CoRR abs/2308.05079 (2023) - [i63]François Le Gall, Yupan Liu, Qisheng Wang:
Space-bounded quantum state testing via space-efficient quantum singular value transformation. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j22]Francois Le Gall, Iu-Iong Ng:
Quantum approximate counting for Markov chains and collision counting. Quantum Inf. Comput. 22(15&16): 1261-1279 (2022) - [c53]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. ITCS 2022: 35:1-35:25 - [c52]François Le Gall, Saeed Seddighin:
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. ITCS 2022: 97:1-97:23 - [c51]Atsuya Hasegawa, François Le Gall:
An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. ISAAC 2022: 6:1-6:14 - [c50]François Le Gall
Bounds on Oblivious Multiparty Quantum Communication Complexity. LATIN 2022: 641-657 - [c49]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. STOC 2022: 19-32 - [c48]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Brief Announcement: Distributed Quantum Interactive Proofs. DISC 2022: 48:1-48:3 - [e1]François Le Gall, Tomoyuki Morimae:
17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA. LIPIcs 232, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-237-2 [contents] - [i62]Keren Censor-Hillel, Orr Fischer, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Quantum Distributed Algorithms for Detection of Cliques. CoRR abs/2201.03000 (2022) - [i61]François Le Gall, Iu-Iong Ng:
Quantum Approximate Counting for Markov Chains and Application to Collision Counting. CoRR abs/2204.02552 (2022) - [i60]Atsuya Hasegawa, François Le Gall:
An optimal oracle separation of classical and quantum hybrid schemes. CoRR abs/2205.04633 (2022) - [i59]Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae:
Improved Hardness Results for the Guided Local Hamiltonian Problem. CoRR abs/2207.10250 (2022) - [i58]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. CoRR abs/2210.01389 (2022) - [i57]François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Quantum Interactive Proofs. CoRR abs/2210.01390 (2022) - [i56]François Le Gall, Ansis Rosmanis:
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model. CoRR abs/2212.02768 (2022) - 2021
- [j21]Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum communication complexity of distribution testing. Quantum Inf. Comput. 21(15&16): 1261-1273 (2021) - [c47]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura
Distributed Quantum Proofs for Replicated Data. ITCS 2021: 28:1-28:20 - [c46]François Le Gall, Masayuki Miyamoto:
Lower Bounds for Induced Cycle Detection in Distributed Computing. ISAAC 2021: 58:1-58:19 - [c45]Atsuya Hasegawa, François Le Gall:
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. ISAAC 2021: 74:1-74:16 - [c44]Shuichi Hirahara, François Le Gall:
Test of Quantumness with Small-Depth Quantum Circuits. MFCS 2021: 59:1-59:15 - [c43]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. SODA 2021: 2878-2891 - [c42]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-Selection. TQC 2021: 10:1-10:17 - [i55]Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman:
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. CoRR abs/2101.07590 (2021) - [i54]Atsuya Hasegawa, François Le Gall:
Quantum Advantage with Shallow Circuits under Arbitrary Corruption. CoRR abs/2105.00603 (2021) - [i53]François Le Gall, Harumichi Nishimura, Abuzer Yakaryilmaz:
Quantum Logarithmic Space and Post-selection. CoRR abs/2105.02681 (2021) - [i52]Shuichi Hirahara, François Le Gall:
Test of Quantumness with Small-Depth Quantum Circuits. CoRR abs/2105.05500 (2021) - [i51]François Le Gall, Masayuki Miyamoto:
Lower Bounds for Induced Cycle Detection in Distributed Computing. CoRR abs/2110.00741 (2021) - [i50]Sevag Gharibian, François Le Gall:
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture. CoRR abs/2111.09079 (2021) - 2020
- [c41]Masayuki Miyamoto, Masakazu Iwamura
Quantum Speedup for the Minimum Steiner Tree Problem. COCOON 2020: 234-245 - [c40]Dhawal Jethwani, François Le Gall, Sanjay Kumar Singh
Quantum-Inspired Classical Algorithms for Singular Value Transformation. MFCS 2020: 53:1-53:14 - [c39]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. PODC 2020: 474-482 - [c38]Taisuke Izumi, François Le Gall, Frédéric Magniez
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS 2020: 23:1-23:13 - [c37]Keren Censor-Hillel
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. DISC 2020: 33:1-33:17 - [c36]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3 - [i49]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. CoRR abs/2002.10018 (2020) - [i48]Matthias Christandl, François Le Gall, Vladimir Lysikov
Barriers for rectangular matrix multiplication. CoRR abs/2003.03019 (2020) - [i47]Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum Communication Complexity of Distribution Testing. CoRR abs/2006.14870 (2020) - [i46]Keren Censor-Hillel, François Le Gall, Dean Leitersdorf:
On Distributed Listing of Cliques. CoRR abs/2007.05316 (2020) - [i45]François Le Gall, Saeed Seddighin:
Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems. CoRR abs/2010.12122 (2020) - [i44]Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf:
Tight Distributed Listing of Cliques. CoRR abs/2011.07405 (2020) - [i43]Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam:
Barriers for Rectangular Matrix Multiplication. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j20]Akinori Kawachi, Kenichi Kawano, Francois Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. IEICE Trans. Inf. Syst. 102-D(3): 483-491 (2019) - [j19]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Generalized Quantum Arthur-Merlin Games. SIAM J. Comput. 48(3): 865-902 (2019) - [c35]François Le Gall:
Average-Case Quantum Advantage with Shallow Circuits. CCC 2019: 21:1-21:20 - [c34]Taisuke Izumi, François Le Gall:
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. PODC 2019: 84-93 - [c33]François Le Gall, Harumichi Nishimura
Quantum Advantage for the LOCAL Model in Distributed Computing. STACS 2019: 49:1-49:14 - [i42]Taisuke Izumi, François Le Gall:
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. CoRR abs/1906.02456 (2019) - [i41]Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. CoRR abs/1908.11488 (2019) - [i40]Dhawal Jethwani, François Le Gall, Sanjay Kumar Singh:
Quantum-Inspired Classical Algorithms for Singular Value Transformation. CoRR abs/1910.05699 (2019) - 2018
- [c32]François Le Gall, Tomoyuki Morimae, Harumichi Nishimura
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. MFCS 2018: 26:1-26:13 - [c31]François Le Gall, Frédéric Magniez:
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. PODC 2018: 337-346 - [c30]Francois Le Gall, Florent Urrutia:
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor. SODA 2018: 1029-1046 - [i39]François Le Gall, Frédéric Magniez:
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. CoRR abs/1804.02917 (2018) - [i38]François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi:
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. CoRR abs/1805.03385 (2018) - [i37]François Le Gall, Harumichi Nishimura, Ansis Rosmanis:
Quantum Advantage for the LOCAL Model in Distributed Computing. CoRR abs/1810.10838 (2018) - [i36]François Le Gall:
Average-Case Quantum Advantage with Shallow Circuits. CoRR abs/1810.12792 (2018) - 2017
- [j18]François Le Gall, Shogo Nakajima
Quantum Algorithm for Triangle Finding in Sparse Graphs. Algorithmica 79(3): 941-959 (2017) - [j17]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. Chic. J. Theor. Comput. Sci. 2017 (2017) - [j16]Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall:
Modified Group Non-Membership is in Promise-AWPP relative to group oracles. Quantum Inf. Comput. 17(3&4): 242-250 (2017) - [c29]Dean Doron
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. APPROX-RANDOM 2017: 41:1-41:20 - [c28]Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki:
Quantum Query Complexity of Unitary Operator Discrimination. COCOON 2017: 309-320 - [c27]Taisuke Izumi, François Le Gall:
Triangle Finding and Listing in CONGEST Networks. PODC 2017: 381-389 - [c26]François Le Gall, Shogo Nakajima:
Multiparty Quantum Communication Complexity of Triangle Finding. TQC 2017: 6:1-6:11 - [i35]Taisuke Izumi, François Le Gall:
Triangle Finding and Listing in CONGEST Networks. CoRR abs/1705.09061 (2017) - [i34]François Le Gall, Florent Urrutia:
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor. CoRR abs/1708.05622 (2017) - [i33]Dean Doron, Francois Le Gall, Amnon Ta-Shma:
Probabilistic logarithmic-space algorithms for Laplacian solvers. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j15]Stacey Jeffery, Robin Kothari
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica 76(1): 1-16 (2016) - [j14]Iordanis Kerenidis, Mathieu Laurière, Francois Le Gall, Mathys Rennela:
Information cost of quantum communication protocols. Quantum Inf. Comput. 16(3&4): 181-196 (2016) - [j13]François Le Gall, Harumichi Nishimura
Quantum algorithms for finding constant-sized sub-hypergraphs. Theor. Comput. Sci. 609: 569-582 (2016) - [c25]Stacey Jeffery, François Le Gall:
Quantum Communication Complexity of Distributed Set Joins. MFCS 2016: 54:1-54:13 - [c24]François Le Gall:
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. DISC 2016: 57-70 - [i32]Tomoyuki Morimae, Harumichi Nishimura, Francois Le Gall:
Modified group non-membership is in AWPP. CoRR abs/1602.06073 (2016) - [i31]François Le Gall:
Solving Laplacian Systems in Logarithmic Space. CoRR abs/1608.01426 (2016) - [i30]François Le Gall:
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. CoRR abs/1608.02674 (2016) - [i29]Stacey Jeffery, François Le Gall:
Quantum Communication Complexity of Distributed Set Joins. CoRR abs/1608.06617 (2016) - [i28]François Le Gall, David J. Rosenbaum:
On the Group and Color Isomorphism Problems. CoRR abs/1609.08253 (2016) - 2015
- [j12]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. SIAM J. Comput. 44(2): 243-289 (2015) - [c23]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CCC 2015: 488-511 - [c22]François Le Gall, Shogo Nakajima:
Quantum Algorithm for Triangle Finding in Sparse Graphs. ISAAC 2015: 590-600 - [c21]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. STOC 2015: 585-593 - [i27]François Le Gall, Shogo Nakajima:
Quantum Algorithm for Triangle Finding in Sparse Graphs. CoRR abs/1507.06878 (2015) - 2014
- [c20]François Le Gall:
Quantum Complexity of Boolean Matrix Multiplication and Related Problems. Computing with New Resources 2014: 176-191 - [c19]François Le Gall, Harumichi Nishimura, Seiichiro Tani
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. COCOON 2014: 429-440 - [c18]François Le Gall:
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments. FOCS 2014: 216-225 - [c17]François Le Gall:
Algebraic complexity theory and matrix multiplication. ISSAC 2014: 23 - [c16]François Le Gall:
Powers of tensors and fast matrix multiplication. ISSAC 2014: 296-303 - [c15]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. SWAT 2014: 331-343 - [i26]François Le Gall:
Powers of Tensors and Fast Matrix Multiplication. CoRR abs/1401.7714 (2014) - [i25]François Le Gall:
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments. CoRR abs/1407.0085 (2014) - [i24]Iordanis Kerenidis, Mathieu Laurière, François Le Gall, Mathys Rennela:
Privacy in Quantum Communication Complexity. CoRR abs/1409.8488 (2014) - [i23]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Laser Method. CoRR abs/1411.5414 (2014) - [i22]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Laser Method. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j11]François Le Gall, Yuichi Yoshida:
Property testing for cyclic groups and beyond. J. Comb. Optim. 26(4): 636-654 (2013) - [j10]François Le Gall:
Quantum weakly nondeterministic communication complexity. Theor. Comput. Sci. 486: 43-49 (2013) - [c14]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger methods of making quantum interactive proofs perfectly complete. ITCS 2013: 329-352 - [i21]François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. CoRR abs/1310.3898 (2013) - [i20]François Le Gall, Harumichi Nishimura, Seiichiro Tani:
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs. CoRR abs/1310.4127 (2013) - [i19]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Generalized Quantum Arthur-Merlin Games. CoRR abs/1312.4673 (2013) - 2012
- [j9]Gábor Ivanyos
On the distance between non-isomorphic groups. Eur. J. Comb. 33(4): 474-476 (2012) - [j8]François Le Gall, Shota Nakagawa, Harumichi Nishimura:
On QMA protocols with two short quantum proofs. Quantum Inf. Comput. 12(7-8): 589-600 (2012) - [j7]François Le Gall:
Quantum Private Information Retrieval with Sublinear Communication Complexity. Theory Comput. 8(1): 369-374 (2012) - [c13]François Le Gall:
Faster Algorithms for Rectangular Matrix Multiplication. FOCS 2012: 514-523 - [c12]François Le Gall:
A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. ISAAC 2012: 639-648 - [c11]François Le Gall:
Improved output-sensitive quantum algorithms for Boolean matrix multiplication. SODA 2012: 1464-1476 - [c10]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [i18]François Le Gall:
Improved Time-Efficient Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication. CoRR abs/1201.6174 (2012) - [i17]François Le Gall:
Faster Algorithms for Rectangular Matrix Multiplication. CoRR abs/1204.1111 (2012) - [i16]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - [i15]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura:
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete. CoRR abs/1210.1290 (2012) - 2011
- [j6]Yoshifumi Inui, François Le Gall:
Quantum Property Testing of Group Solvability. Algorithmica 59(1): 35-47 (2011) - [j5]Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Subgroup Membership. Chic. J. Theor. Comput. Sci. 2011 (2011) - [c9]François Le Gall, Yuichi Yoshida:
Property Testing for Cyclic Groups and Beyond. COCOON 2011: 432-443 - [c8]Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler:
Constructing quantum network coding schemes from classical nonlinear protocols. ISIT 2011: 109-113 - [i14]François Le Gall, Yuichi Yoshida:
Property Testing for Cyclic Groups and Beyond. CoRR abs/1105.1842 (2011) - [i13]Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. CoRR abs/1107.0133 (2011) - [i12]François Le Gall:
Quantum Private Information Retrieval with Sublinear Communication Complexity. CoRR abs/1107.5881 (2011) - [i11]François Le Gall, Shota Nakagawa, Harumichi Nishimura:
On QMA Protocols with Two Short Quantum Proofs. CoRR abs/1108.4306 (2011) - 2010
- [j4]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. Quantum Inf. Comput. 10(3&4): 181-189 (2010) - [c7]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect quantum network communication protocol based on classical network coding. ISIT 2010: 2686-2690 - [c6]François Le Gall:
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. STACS 2010: 549-560 - [i10]François Le Gall:
An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem. CoRR abs/1001.0608 (2010) - [i9]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Roetteler:
Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols. CoRR abs/1012.4583 (2010)
2000 – 2009
- 2009
- [j3]François Le Gall:
Exponential Separation of Quantum and Classical Online Space Complexity. Theory Comput. Syst. 45(2): 188-202 (2009) - [c5]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. ICALP (1) 2009: 622-633 - [c4]François Le Gall:
Efficient Isomorphism Testing for a Class of Group Extensions. STACS 2009: 625-636 - [i8]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
Perfect Quantum Network Communication Protocol Based on Classical Network Coding. CoRR abs/0902.1299 (2009) - [i7]Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Group Membership. CoRR abs/0902.3175 (2009) - [i6]Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani:
The quantum query complexity of certification. CoRR abs/0903.1291 (2009) - [i5]Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler
General Scheme for Perfect Quantum Network Coding with Free Classical Communication. CoRR abs/0908.1457 (2009) - 2008
- [c3]Yoshifumi Inui, François Le Gall:
Quantum Property Testing of Group Solvability. LATIN 2008: 772-783 - [i4]François Le Gall:
Efficient Isomorphism Testing for a Class of Group Extensions. CoRR abs/0812.2298 (2008) - 2007
- [j2]Yoshifumi Inui, François Le Gall:
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups. Quantum Inf. Comput. 7(5): 559-570 (2007) - [i3]Yoshifumi Inui, Francois Le Gall:
Quantum Property Testing of Group Solvability. CoRR abs/0712.3829 (2007) - 2006
- [j1]Hirotada Kobayashi, François Le Gall:
Dihedral Hidden Subgroup Problem: A Survey. Inf. Media Technol. 1(1): 178-185 (2006) - [c2]François Le Gall:
Quantum Weakly Nondeterministic Communication Complexity. MFCS 2006: 658-669 - [c1]François Le Gall:
Exponential separation of quantum and classical online space complexity. SPAA 2006: 67-73 - [i2]François Le Gall:
Exponential Separation of Quantum and Classical Online Space Complexity. CoRR abs/quant-ph/0606066 (2006) - 2005
- [i1]François Le Gall:
Quantum Weakly Nondeterministic Communication Complexity. CoRR abs/quant-ph/0511025 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: