Theses most similar to Lower bounds on the classical simulation of quantum circuits for quantum supremacy (Dalzell, Alexander M; 2017) read it

Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness

Bazzi, Louay Mohamad Jamil, 1974- (2003)

  • Advisors: Daniel A. Spielman; Sanjoy K. Mitter
  • Department of Electrical Engineering and Computer Science
Read it

Relativization of the theory of computational complexity.

Lynch, Nancy A. (Nancy Ann), 1948- (1972)

  • Advisor: Albert Meyer
  • Department of Mathematics
Read it

Robust PCPs of proximity and shorter PCPs

Harsha, Prahladh, 1976- (2004)

  • Advisor: Madhu Sudan
  • Department of Electrical Engineering and Computer Science
Read it

Fine-grained fault-tolerance : reliability as a fungible resource

Impens, François, 1977- (2004)

  • Advisor: Isaac L. Chuang
  • Department of Electrical Engineering and Computer Science
Read it

Order computations in generic groups

Sutherland, Andrew V (2007)

  • Advisor: Michael F. Sipser
  • Department of Mathematics
Read it

Local Hamiltonians in quantum computation

Nagaj, Daniel (2008)

  • Advisor: Edward H. Farhi
  • Department of Physics
Read it

Quantum computation beyond the circuit model

Jordan, Stephen Paul (2008)

  • Advisor: Edward H. Farhi
  • Department of Physics
Read it

Alternative models for quantum computation/

Lin, Cedric Yen-Yu (2015)

  • Advisor: Edward H. Farhi
  • Department of Physics
Read it

Structure vs. hardness through the obfuscation lens

Degwekar, Akshay (Akshay Dhananjai) (2016)

  • Advisor: Vinod Vaikuntanathan
  • Department of Electrical Engineering and Computer Science
Read it

Entangled protocols and non-local games for testing quantum systems.

Coudron., Matthew Ryan (2017)

  • Advisor: Peter W. Shor
  • Department of Electrical Engineering and Computer Science
Read it