research
∙
11/21/2022
Sample-optimal classical shadows for pure states
We consider the classical shadows task for pure states in the setting of...
share
research
∙
02/16/2021
Decidability for Sturmian words
We show that the first-order theory of Sturmian words over Presburger ar...
research
∙
02/13/2021
Interactive quantum advantage with noisy, shallow Clifford circuits
Recent work by Bravyi et al. constructs a relation problem that a noisy ...
research
∙
12/12/2020
String Attractors for Automatic Sequences
We show that it is decidable, given an automatic sequence s and a consta...
research
∙
09/07/2020
Fast simulation of planar Clifford circuits
A general quantum circuit can be simulated in exponential time on a clas...
research
∙
11/06/2019
Interactive shallow Clifford circuits: quantum advantage against NC^1 and beyond
Recent work of Bravyi et al. and follow-up work by Bene Watts et al. dem...
research
∙
06/20/2019
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
Recently, Bravyi, Gosset, and König (Science, 2018) exhibited a search p...
research
∙
12/11/2018
