Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A no-go theorem for derandomized parallel repetition

Govind Ramnarayan

Published Jan 1, 2016• 0 citations
OpenAlex

Abstract

Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.

Related papers

The complexity of sampling from a weak quantum computer

Saeed Adel Mehraban

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019

•Jan 1, 2019•0 citations

Iterative decoding of codes defined on graphs

A. L. Reznik

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

•Jan 1, 1998•7 citations

Second order error correction in quantum computing

Sarah Sheldon

Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Nuclear Science and Engineering, 2008.

•Jan 1, 2008•0 citations

Computationally efficient error-correcting codes and holographic proofs

Daniel Alan Spielman, Michael Sipser

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.

•Jan 1, 1995•51 citations

Quantum query complexity revisited

Daniel Preda

Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.

•Jan 1, 2003•0 citations

A mathematical theory of randomized computation and its mathematical foundations

眞市 山田

•Jan 1, 1988•1 citation