Niel de Beaudrap

less info

2,599 reputation

630

bio	website
	location	Cambridge, United Kingdom
	age
visits	member for	1 year, 9 months
	seen	2 hours ago
stats	profile views	337

Researcher in quantum information --- involving algebras over finite dimensional Hilbert spaces, graphs and combinatorics, and vector spaces over ℤ/pℤ.

I habitually edit and re-edit anything I write, as long as I have the time, interest, and ability. I should probably apologize for this tendency, but you will probably have to be satisfied with being warned about it instead.

	2,599 reputation	bio	website		visits	member for	1 year, 9 months
630 badges		location	Cambridge, United Kingdom		seen	2 hours ago

summary answers questions tags badges favorites bounties reputation activity

19 Answers

votes activity newest

27	Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
20	What is the quantum computational model?
15	A possibly new representation of DAGs
13	Computation beyond unitary matrices
12	Consequences of $SAT \in BQP$

2,599 Reputation

+10	Quantum Computation - Postulates of QM
+5	Non-tomographical certification of projectors, using product states?
+10	Quantum Computation - Postulates of QM
+5	Adiabatic quantum computing with level crossings

15 Questions

votes activity newest

19	What are the consequences of Parity-L = P?
15	What is the counting complexity of random 2-SAT?
14	Is solving systems of equations modulo $k$ in $\mathsf{coMod}_k\mathsf L$ for $k$ composite?
13	Adiabatic quantum computing with level crossings
13	Finding odd holes in circulant Paley graphs

37 Tags

83 quantum-computing × 13	16 graph-theory × 4
63 cc.complexity-theory × 10	15 directed-acyclic-graph
47 big-picture × 2	15 ds.data-structures
27 np-hardness	12 conditional-results × 2
20 complexity-classes × 5	12 physics