Locally Decodable Quantum Codes. - Jop Briët; Ronald de Wolf (STACS, 2009)

The Positive Semidefinite Grothendieck Problem with Rank Constraint. - Jop Briët; Fernando Mário de Oliveira Filho; Frank Vallentin (ICALP (1), 2010)

Monotonicity Testing and Shortest-Path Routing on the Cube. - David García-Soriano; Arie Matsliah; Sourav Chakraborty 001; Jop Briët (Electron. Colloquium Comput. Complex., 2010)

Violating the Shannon capacity of metric graphs with entanglement - Jop Briët; Harry Buhrman; Dion Gijswijt (CoRR, 2012)

Locally decodable codes and the failure of cotype for projective tensor products - Jop Briët; Assaf Naor; Oded Regev 001 (CoRR, 2012)

Multipartite entanglement in XOR games. - Jop Briët; Harry Buhrman; Troy Lee; Thomas Vidick (Quantum Inf. Comput., 2013)

Lower Bounds for Approximate LDC. - Jop Briët; Zeev Dvir; Guangda Hu; Shubhangi Saraf (CoRR, 2014)

Tight Hardness of the Non-commutative Grothendieck Problem. - Jop Briët; Oded Regev 001 (CoRR, 2014)

Lower Bounds for Approximate LDCs. - Jop Briët; Zeev Dvir; Guangda Hu; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2014)

Grothendieck Inequalities for Semidefinite Programs with Rank Constraint. - Jop Briët; Fernando Mário de Oliveira Filho; Frank Vallentin (Theory Comput., 2014)

Round Elimination in Exact Communication Complexity. - Jop Briët; Harry Buhrman; Debbie W. Leung; Teresa Piovesan; Florian Speelman (TQC, 2015)

On Embeddings of ℓ1k from Locally Decodable Codes. - Jop Briët (Electron. Colloquium Comput. Complex., 2015)

On the existence of 0/1 polytopes with high semidefinite extension complexity. - Jop Briët; Daniel Dadush; Sebastian Pokutta (Math. Program., 2015)

Entanglement-Assisted Zero-Error Source-Channel Coding. - Jop Briët; Harry Buhrman; Monique Laurent; Teresa Piovesan; Giannicola Scarpa (IEEE Trans. Inf. Theory, 2015)

Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes. - Divesh Aggarwal; Jop Briët (ISIT, 2016)

Revisiting the Sanders-Freiman-Ruzsa Theorem in $ mathbb{F}_p^n$ and its Application to Non-malleable Codes. - Divesh Aggarwal; Jop Briët (CoRR, 2016)

On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. - Jop Briët; Jeroen Zuiddam (CoRR, 2016)

Gaussian width bounds with applications to arithmetic progressions in random settings. - Jop Briët; Sivakanth Gopi (CoRR, 2017)

Orthogonal rank and impossibility of quantum round elimination. - Jop Briët; Jeroen Zuiddam (Quantum Inf. Comput., 2017)

Tight Hardness of the Non-Commutative Grothendieck Problem. - Jop Briët; Oded Regev 001; Rishi Saket (Theory Comput., 2017)

Quantum Computation and Information - Introduction to the Special Theme. - Jop Briët; Simon Perdrix (ERCIM News, 2018)

Bounding Quantum-Classical Separations for Classes of Nonlocal Games. - Tom Bannink; Jop Briët; Harry Buhrman; Farrokh Labib; Troy Lee (STACS, 2019)

Quantum Query Algorithms Are Completely Bounded Forms. - Srinivasan Arunachalam; Jop Briët; Carlos Palazuelos (SIAM J. Comput., 2019)

Outlaw Distributions and Locally Decodable Codes. - Jop Briët; Zeev Dvir; Sivakanth Gopi (Theory Comput., 2019)

Quasirandom quantum channels. - Tom Bannink; Jop Briët; Farrokh Labib; Hans Maassen (Quantum, 2020)

High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract). - Jop Briët; Farrokh Labib (ITCS, 2021)

On Converses to the Polynomial Method. - Jop Briët; Francisco Escudero Gutiérrez (TQC, 2022)

Noisy decoding by shallow circuits with parities: classical and quantum. - Jop Briët; Harry Buhrman; Davi Castro-Silva; Niels M. P. Neumann (CoRR, 2023)

Discreteness of asymptotic tensor ranks. - Jop Briët; Matthias Christandl; Itai Leigh; Amir Shpilka; Jeroen Zuiddam (CoRR, 2023)

Orthogonal schedules in single round robin tournaments. - Roel Lambers; Jop Briët; Viresh Patel; Frits C. R. Spieksma; Mehmet Akif Yildiz (Oper. Res. Lett., 2023)

Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract). - Jop Briët; Harry Buhrman; Davi Castro-Silva; Niels M. P. Neumann (ITCS, 2024)

Discreteness of Asymptotic Tensor Ranks (Extended Abstract). - Jop Briët; Matthias Christandl; Itai Leigh; Amir Shpilka; Jeroen Zuiddam (ITCS, 2024)

On the Threshold for Szemerédi's Theorem with Random Differences. - Jop Briët; Davi Castro-Silva (Electron. J. Comb., 2024)

Grothendieck inequalities characterize converses to the polynomial method. - Jop Briët; Francisco Escudero Gutiérrez; Sander Gribling (Quantum, 2024)

A near-optimal Quadratic Goldreich-Levin algorithm. - Jop Briët; Davi Castro-Silva (CoRR, 2025)