
Lower Bounds for Induced Cycle Detection in Distributed Computing
The distributed subgraph detection asks, for a fixed graph H, whether th...
read it

Test of Quantumness with SmallDepth Quantum Circuits
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018)...
read it

Quantum Logarithmic Space and Postselection
Postselection, the power of discarding all runs of a computation in whi...
read it

Quantum Advantage with Shallow Circuits under Arbitrary Corruption
Recent works by Bravyi, Gosset and König (Science 2018), Bene Watts et a...
read it

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
In this paper we give fast distributed graph algorithms for detecting an...
read it

Tight Distributed Listing of Cliques
Much progress has recently been made in understanding the complexity lan...
read it

Quantum Meets Finegrained Complexity: Sublinear Time Quantum Algorithms for String Problems
Longest common substring (LCS), longest palindrome substring (LPS), and ...
read it

On Distributed Listing of Cliques
We show an Õ(n^p/(p+2))round algorithm in the model for listing of K_p ...
read it

Quantum Communication Complexity of Distribution Testing
The classical communication complexity of testing closeness of discrete ...
read it

Barriers for rectangular matrix multiplication
We study the algorithmic problem of multiplying large matrices that are ...
read it

Distributed Quantum Proofs for Replicated Data
The paper tackles the issue of checking that all copies of a large data ...
read it

QuantumInspired Classical Algorithms for Singular Value Transformation
A recent breakthrough by Tang (STOC 2019) showed how to "dequantize" the...
read it

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
This paper considers the triangle finding problem in the CONGEST model o...
read it

Quantum Distributed Algorithm for the AllPairs Shortest Path Problem in the CONGESTCLIQUE Model
The AllPairs Shortest Path problem (APSP) is one of the most central pr...
read it

AverageCase Quantum Advantage with Shallow Circuits
Recently Bravyi, Gosset and König (Science 2018) proved an unconditional...
read it

Quantum Advantage for the LOCAL Model in Distributed Computing
There are two central models considered in (faultfree synchronous) dist...
read it

Interactive Proofs with PolynomialTime Quantum Prover for Computing the Order of Solvable Groups
In this paper we consider what can be computed by a user interacting wit...
read it

SublinearTime Quantum Computation of the Diameter in CONGEST Networks
The computation of the diameter is one of the most central problems in d...
read it

Improved Rectangular Matrix Multiplication using Powers of the CoppersmithWinograd Tensor
In the past few years, successive improvements of the asymptotic complex...
read it
François Le Gall
is this you? claim profile