Results from the 2022 Developer Survey are now available
Theoretical Computer Science
user avatar
user avatar
user avatar
Adam Bouland
  • Member for 9 years, 4 months
  • Last seen more than a month ago
Profile Activity
Stats
743
reputation
4k
reached
5
answers
1
question
Communities
About

I am an Assistant Professor of Computer Science at Stanford. I study quantum complexity theory and connections with physics.

Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
10
bronze badges
Top tags
View all tags
35
Score
4
Posts
67
Posts %
24
Score
1
Posts
17
Posts %
24
Score
1
Posts
17
Posts %
12
Score
3
Posts
50
Posts %
8
Score
1
Posts
17
Posts %
8
Score
1
Posts
17
Posts %
Top posts
All Questions Answers
Score Newest
answer
24
Books/Lecture Notes on Parametrized Complexity
May 22, 2013
answer
8
theorems for universal set of quantum gates for SU(d)
May 11, 2016
answer
6
FPT algorithm for Partial k-tree Isomorphism
Nov 7, 2013
answer
5
Geometric Interpretation of Computation
Sep 30, 2013
answer
4
Clarification for argument in proof of search in N^1/3 queries with hidden variables/non-collapsing measurements
Feb 20, 2015
question
4
Techniques for lower bounding spectral gaps in the quantum adiabatic algorithm
Nov 19, 2013
Top network posts
View all network posts
8
Do rotations about any three non-collinear axes generate $SO(3)$?
6
Polynomials with $S_n \times \mathbb{Z}_2$ symmetry

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.