Niel de Beaudrap
  • Member for 11 years, 5 months
  • Last seen more than a month ago
  • Oxford, United Kingdom
2 answers
29 votes
1k views
8 bookmarks
What are the consequences of Parity-L = P?
0 answers
28 votes
483 views
6 bookmarks
Adiabatic quantum computing with level crossings
2 answers
20 votes
867 views
3 bookmarks
A good reference for complexity class operators?
1 answers
19 votes
852 views
5 bookmarks
Is solving systems of equations modulo $k$ in $\mathsf{coMod}_k\mathsf L$ for $k$ composite?
1 answers
19 votes
536 views
5 bookmarks
What is the counting complexity of random 2-SAT?
1 answers
18 votes
2k views
7 bookmarks
What are the #P-complete subfamilies of #2-SAT?
1 answers
18 votes
735 views
4 bookmarks
Best known joint containments for/by NP and Parity-P?
2 answers
16 votes
359 views
1 bookmarks
Finding small sets of integers in which every element is a sum of two others
1 answers
15 votes
292 views
1 bookmarks
Does requiring uniqueness of valid answers for Merlin limit the power of Arthur-Merlin protocols?
1 answers
15 votes
691 views
2 bookmarks
How powerful is exact "quantum" computing if you suspend unitarity?
0 answers
15 votes
1k views
2 bookmarks
Reference request: a more complete "faster factorization into coprimes"
1 answers
15 votes
538 views
6 bookmarks
Log-space reduction from Parity-L to CNOT circuits?
1 answers
13 votes
340 views
5 bookmarks
Reference request: number-theory-free proof that maximal stabilizer groups determine unique states
1 answers
13 votes
659 views
8 bookmarks
Circuits with oracles vs. Turing Machines with oracles
1 answers
13 votes
343 views
1 bookmarks
Finding odd holes in circulant Paley graphs
1 answers
12 votes
411 views
6 bookmarks
Efficient algorithm for near-optimal edge-colourings of hypergraphs
1 answers
11 votes
169 views
3 bookmarks
Is there a finite unitary gate set which can exactly realise all QFTs of order $2^n$?
0 answers
10 votes
186 views
2 bookmarks
Wide and shallow circuits for $\mathrm P$
3 answers
9 votes
579 views
Submitting other people's work to the arXiv
0 answers
9 votes
115 views
1 bookmarks
Non-tomographical certification of projectors, using product states?
1 answers
7 votes
268 views
1 bookmarks
What complexity issues are there in considering quantum algorithms with infinite gate-sets?
0 answers
7 votes
132 views
1 bookmarks
Reference request: reducing rank computations to characteristic polynomials over arbitrary rings
2 answers
5 votes
195 views
Minimising the root-set of a spanning hyperforest of a hypergraph