Niel de Beaudrap's user avatar
Niel de Beaudrap's user avatar
Niel de Beaudrap's user avatar
Niel de Beaudrap
  • Member for 12 years, 1 month
  • Last seen more than a week ago
  • Oxford, United Kingdom
29 votes
2 answers
2k views

What are the consequences of Parity-L = P?

28 votes
0 answers
490 views

Adiabatic quantum computing with level crossings

20 votes
2 answers
904 views

A good reference for complexity class operators?

19 votes
1 answer
566 views

What is the counting complexity of random 2-SAT?

19 votes
1 answer
902 views

Is solving systems of equations modulo $k$ in $\mathsf{coMod}_k\mathsf L$ for $k$ composite?

18 votes
1 answer
764 views

Best known joint containments for/by NP and Parity-P?

18 votes
1 answer
2k views

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

16 votes
2 answers
360 views

Finding small sets of integers in which every element is a sum of two others

15 votes
0 answers
1k views

Reference request: a more complete "faster factorization into coprimes"

15 votes
1 answer
295 views

Does requiring uniqueness of valid answers for Merlin limit the power of Arthur-Merlin protocols?

15 votes
1 answer
567 views

Log-space reduction from Parity-L to CNOT circuits?

15 votes
1 answer
708 views

How powerful is exact "quantum" computing if you suspend unitarity?

13 votes
1 answer
345 views

Finding odd holes in circulant Paley graphs

13 votes
1 answer
340 views

Reference request: number-theory-free proof that maximal stabilizer groups determine unique states

13 votes
1 answer
678 views

Circuits with oracles vs. Turing Machines with oracles

12 votes
1 answer
413 views

Efficient algorithm for near-optimal edge-colourings of hypergraphs

11 votes
1 answer
169 views

Is there a finite unitary gate set which can exactly realise all QFTs of order $2^n$?

10 votes
0 answers
191 views

Wide and shallow circuits for $\mathrm P$

9 votes
0 answers
115 views

Non-tomographical certification of projectors, using product states?

9 votes
3 answers
582 views

Submitting other people's work to the arXiv

7 votes
1 answer
285 views

What complexity issues are there in considering quantum algorithms with infinite gate-sets?

7 votes
0 answers
132 views

Reference request: reducing rank computations to characteristic polynomials over arbitrary rings

5 votes
2 answers
198 views

Minimising the root-set of a spanning hyperforest of a hypergraph