3 citations · 5 across the 10 of their papers we have counts for
15 papers
Testing bosonic and fermionic Gaussian states with a constant number of copies
Jop Briët, Davi Castro-Silva, Michael Walter +1
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of…
On Clifford hierarchy testing and near-extremizers of noncommutative uniformity norms
Zongbo, Bao, Jop Briët +3
We consider the problem of testing whether an unknown unitary is close to a specified level of the Clifford hierarchy. Bu, Gu, and Jaffe proposed a candidate tester for this task b…
An algorithmic Polynomial Freiman-Ruzsa theorem
Davi Castro-Silva, Jop Briët, Srinivasan Arunachalam +2
We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm…
Algorithmic Polynomial Freiman-Ruzsa Theorems
Srinivasan Arunachalam, Davi Castro-Silva, Arkopal Dutt +1
We prove algorithmic versions of the polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Annals of Mathematics, 2025) in additive combinatorics. In particular, we…
A near-optimal Quadratic Goldreich-Levin algorithm
Jop Briët, Davi Castro-Silva
In this paper, we give a quadratic Goldreich-Levin algorithm that is close to optimal in the following ways. Given a bounded function on the Boolean hypercube …
Symmetric quantum computation
Davi Castro-Silva, Tom Gur, Sergii Strelchuk
We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model i…
Quasirandom additive sets and Cayley hypergraphs
Davi Castro-Silva
We study the interplay between notions of quasirandomness for additive sets and for hypergraphs. In particular, we show a strong connection between the notions of Gowers uniformity…
On the threshold for Szemerédi's theorem with random differences
Jop Briët, Davi Castro-Silva
Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemerédi's theorem with random differences is bounded from above by $N^{1-\…
Noisy decoding by shallow circuits with parities: classical and quantum
Jop Briët, Harry Buhrman, Davi Castro-Silva +1
We consider the problem of decoding corrupted error correcting codes with NC circuits in the classical and quantum settings. We show that any such classical circuit can…
Random restrictions of high-rank tensors and polynomial maps
Jop Briët, Davi Castro-Silva
Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, f…
A recursive theta body for hypergraphs
Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot +1
The theta body of a graph, introduced by Grötschel, Lovász, and Schrijver in 1986, is a tractable relaxation of the independent-set polytope derived from the Lovász theta number. I…
Quasirandomness in additive groups and hypergraphs
Davi Castro-Silva
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing…
A recursive Lovász theta number for simplex-avoiding sets
Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot +1
We recursively extend the Lovász theta number to geometric hypergraphs on the unit sphere and on Euclidean space, obtaining an upper bound for the independence ratio of these hyper…
Geometrical sets with forbidden configurations
Davi Castro-Silva
Given finite configurations , let us denote by the maximum density a set $A \subseteq \mathbb{R}^…
A study on load-balanced variants of the bin packing problem
Davi Castro-Silva, Eric Gourdin
We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In th…