Driven by exploring the power of quantum computation with a limited numb...
We give an almost complete characterization of the hardness of c-colorin...
Duan, Wu and Zhou (FOCS 2023) recently obtained the improved upper bound...
Several quantum algorithms for linear algebra problems, and in particula...
Complexity theory typically focuses on the difficulty of solving
computa...
We consider the LOCAL model of distributed computing, where in a single ...
The study of distributed interactive proofs was initiated by Kol, Oshman...
The generation and verification of quantum states are fundamental tasks ...
Estimating the ground state energy of a local Hamiltonian is a central
p...
Recently, Chia, Chung and Lai (STOC 2020) and Coudron and Menda (STOC 20...
In this paper we show how to generalize the quantum approximate counting...
The possibilities offered by quantum computing have drawn attention in t...
The Quantum Singular Value Transformation (QSVT) is a recent technique t...
The distributed subgraph detection asks, for a fixed graph H, whether th...
Recently Brakerski, Christiano, Mahadev, Vazirani and Vidick (FOCS 2018)...
Post-selection, the power of discarding all runs of a computation in whi...
Recent works by Bravyi, Gosset and König (Science 2018), Bene Watts et a...
In this paper we give fast distributed graph algorithms for detecting an...
Much progress has recently been made in understanding the complexity
lan...
Longest common substring (LCS), longest palindrome substring (LPS), and ...
We show an Õ(n^p/(p+2))-round algorithm in the model for
listing of K_p ...
The classical communication complexity of testing closeness of discrete
...
We study the algorithmic problem of multiplying large matrices that are
...
The paper tackles the issue of checking that all copies of a large
data ...
A recent breakthrough by Tang (STOC 2019) showed how to "dequantize" the...
This paper considers the triangle finding problem in the CONGEST model o...
The All-Pairs Shortest Path problem (APSP) is one of the most central
pr...
Recently Bravyi, Gosset and König (Science 2018) proved an unconditional...
There are two central models considered in (fault-free synchronous)
dist...
In this paper we consider what can be computed by a user interacting wit...
The computation of the diameter is one of the most central problems in
d...
In the past few years, successive improvements of the asymptotic complex...