Niel de Beaudrap

Member for 13 years, 3 months
Last seen more than a month ago

Oxford, United Kingdom

Summary

Reputation

8,821

8.9k
8.7k
8.5k

2020
2021
2022
2023

Top tag

quantum-computing

Next privilege

10,000 Rep.

Access moderator tools

Badges

31

69

Newest

Yearling

Next badge

21/30

Inquisitive

Answers

View all 55 answers

Score Activity Newest

37

Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?

Mar 7, 2011

28

Consequences of NP=PSPACE

Feb 13, 2014

24

What is the quantum computational model?

Aug 24, 2010

20

Consequences of $SAT \in BQP$

Apr 18, 2011

19

A Notion of Monotone Quantum Circuits

Sep 18, 2012

Questions

View all 23 questions

Score Activity Newest Views

29

What are the consequences of Parity-L = P?

Aug 17, 2010

28

Adiabatic quantum computing with level crossings

Feb 11, 2012

21

What are the #P-complete subfamilies of #2-SAT?

Nov 29, 2012

20

A good reference for complexity class operators?

Mar 18, 2014

19

What is the counting complexity of random 2-SAT?

Mar 16, 2012

Tags

View all 68 tags

quantum-computing

220

Score

32

posts

cc.complexity-theory

209

Score

31

posts

complexity-classes

90

Score

12

posts

big-picture

64

Score

4

posts

conditional-results

48

Score

3

posts

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

31

silver badges

Beta

Sep 10, 2010
Taxonomist

Mar 22, 2014
Pundit

Aug 10, 2012

69

bronze badges

quantum-computing

Dec 12, 2014
cc.complexity-theory

Apr 18, 2015
Cleanup

Apr 28, 2014

Accounts

View all 13 accounts

14.1k
5
46
61

Quantum Computing

11.8k
1
29
68

9,960
4
32
52

Theoretical Computer Science

8,821
31
69

5,988
1
26
38

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

414

upvotes

80

downvotes

258

question votes

236

answer votes