Theoretical Computer Science
Meta user
Network profile
703
reputation
4
10

Adam Bouland

I am a Postdoc in the theory of computation group at UC Berkeley. I study quantum complexity theory and connections with theoretical physics.

5
answers
1
question
~3k
people reached
  • Berkeley, CA, USA
  • adambouland.com
  • Member for 6 years, 11 months
  • 55 profile views
  • Last seen Aug 14 '19 at 0:56

Communities (4)

Top network posts

Top tags (9)

Score 34
Posts 4
Posts % 67
Score 23
Posts 1
Score 23
Posts 1
Score 9
Posts 3
Score 6
Posts 1
Score 5
Posts 1
View all tags →

Top posts (6) All Questions Answers | Votes Newest

23 Books/Lecture Notes on Parametrized Complexity May 22 '13
6 FPT algorithm for Partial k-tree Isomorphism Nov 7 '13
5 Geometric Interpretation of Computation Sep 30 '13
5 theorems for universal set of quantum gates for SU(d) May 11 '16
4 Techniques for lower bounding spectral gaps in the quantum adiabatic algorithm Nov 19 '13
4 Clarification for argument in proof of search in N^1/3 queries with hidden variables/non-collapsing measurements Feb 20 '15

Badges (14)

Gold

—

Silver

4

Rarest

Bronze

10

Rarest

View all badges →