5 citations · 10 across the 13 of their papers we have counts for
15 papers
Dequantizing Short-Path Quantum Algorithms
François Le Gall, Suguru Tamaki
The short-path quantum algorithm introduced by Hastings (Quantum 2018, 2019) is a variant of adiabatic quantum algorithms that enables an easier worst-case analysis by avoiding the…
A slightly improved upper bound for quantum statistical zero-knowledge
François Le Gall, Yupan Liu, Qisheng Wang
The complexity class Quantum Statistical Zero-Knowledge (), introduced by Watrous (FOCS 2002) and later refined in Watrous (SICOMP, 2009), has the best known upper b…
Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
François Le Gall, Maël Luce, Joseph Marchand +1
We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication u…
Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
Atsuya Hasegawa, François Le Gall, Augusto Modanese
We present relation problems whose input size is such that they can be solved with no communication for entanglement-assisted quantum communication models, but require q…
Does there exist a quantum fingerprinting protocol without coherent measurements?
Atsuya Hasegawa, Srijita Kundu, François Le Gall +2
Buhrman, Cleve, Watrous, and de Wolf (PRL 2001) discovered the quantum fingerprinting protocol, which is the quantum SMP protocol with qubits communication for the equa…
Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries
François Le Gall, Oran Nadler, Harumichi Nishimura +1
In this paper we study a quantum version of the multiparty simultaneous message-passing (SMP) model, and we show that in some cases, quantum communication can replace public random…