Jop Briët

QuSoft — Netherlands

Computer Science · Physical Sciences

13h-index655citations73works0.22yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(25), Complexity and Algorithms in Graphs(21), Quantum Information and Cryptography(13), Coding theory and cryptography(13), Mathematical Approximation and Integration(11)

Publications73 total

A near-optimal quadratic Goldreich-Levin algorithm (extended abstract)
Society for Industrial and Applied Mathematics eBooks·2026
Clifford testing: algorithms and lower bounds
arXiv (Cornell University)·2025Open Access
A near-optimal Quadratic Goldreich-Levin algorithm
arXiv (Cornell University)·2025Open Access
Grothendieck inequalities characterize converses to the polynomial method
Quantum·2024Open Access
On the Threshold for Szemerédi's Theorem with Random Differences
The Electronic Journal of Combinatorics·2024Open Access
Discreteness of Asymptotic Tensor Ranks (Extended Abstract)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2024· 1 citedOpen Access
Orthogonal schedules in single round robin tournaments
Operations Research Letters·2023· 1 citedOpen Access
Discreteness of Asymptotic Tensor Ranks (Extended Abstract)
arXiv (Cornell University)·2023· 1 citedOpen Access
On the threshold for Szemerédi's theorem with random differences
arXiv (Cornell University)·2023Open Access
Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract)
arXiv (Cornell University)·2023· 3 citedOpen Access
Raising the roof on the threshold for Szemerédi's theorem with random differences
2023· 2 citedOpen Access
Random restrictions of high-rank tensors and polynomial maps
2023· 3 citedOpen Access
Random restrictions of high-rank tensors and polynomial maps
arXiv (Cornell University)·2022Open Access
Grothendieck inequalities characterize converses to the polynomial method
arXiv (Cornell University)·2022Open Access
On Converses to the Polynomial Method
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022· 2 citedOpen Access
Subspaces of tensors with high analytic rank
Online Journal of Analytic Combinatorics·2021· 4 citedOpen Access
Multiple correlation sequences not approximable by nilsequences
Ergodic Theory and Dynamical Systems·2021· 3 citedOpen Access
High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract)
arXiv (Cornell University)·2021· 1 citedOpen Access
High-entropy dual functions over finite fields and locally decodable codes
Forum of Mathematics Sigma·2021Open Access
High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021Open Access
page 1 of 4Next →

Frequent Co-authors

Harry Buhrman(11), Thomas Vidick(4), Jeroen Zuiddam(4), Daniel Dadush(3), Sebastian Pokutta(3), Troy Lee(3), Sivakanth Gopi(3), Teresa Piovesan(3), Zeev Dvir(3), Davi Castro-Silva(3), David García-Soriano(2), Ben Toner(2), Fernando Mário de Oliveira Filho(2), Frank Vallentin(2), Srinivasan Arunachalam(2), Carlos Palazuelos(2), Dion Gijswijt(2), Oded Regev(2), Assaf Naor(2), Oded Regev(2)