Network profile

hadsed

Reputation

441

2018
2019
2020
2021

Top tag

quantum-computing

Next privilege

500 Rep.

Access review queues

Badges

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

1 helpful flag

30 votes cast

17 Bookmarks

Votes Activity Newest Views Added

474

votes

answers

170k

views

What papers should everyone read?

big-list soft-question

Feb 15 '20 at 16:45 gadmm 55

371

votes

answers

111k

views

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list

Jan 5 '19 at 10:30 Community♦ 1

251

votes

answers

97k

views

What is the enlightenment I'm supposed to attain after studying finite automata?

fl.formal-languages automata-theory big-picture teaching dfa

Jan 14 '16 at 11:00 Aryeh 8,931

248

votes

answers

121k

views

What Books Should Everyone Read?

reference-request soft-question big-list books

Aug 14 at 19:16 M.S. Dousti 16.1k

226

votes

answers

91k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 '20 at 13:30 Community♦ 1

115

votes

answers

17k

views

What Lecture Notes Should Everyone Read?

reference-request soft-question big-list

Jan 23 '17 at 4:51 Community♦ 1

101

votes

answers

14k

views

What are the recent TCS books whose drafts are available online?

reference-request big-list books

Dec 25 '18 at 5:55 kauray 125

votes

answers

16k

views

What would it mean to disprove Church-Turing thesis?

computability proofs hypercomputation

Jul 10 at 23:58 Abraham Lim Ken Zhi 1

votes

answers

462

views

Adiabatic quantum computing with level crossings

quantum-computing machine-models adiabatic

Oct 1 '15 at 23:20 Kaveh 21k

votes

answers

views

Justifying asymptotic worst-case analysis to scientists

cc.complexity-theory reference-request big-picture application-of-theory worst-case

Jan 30 '14 at 21:40 Community♦ 1

votes

answer

282

views

Is there a geometrical picture for adiabatic quantum computation?

reference-request quantum-computing physics topology

Nov 13 '13 at 17:38 vzn 10.7k

votes

answers

views

Is there a formal proof that quantum computing is or will be faster than classical computing?

quantum-computing

Jul 26 '14 at 17:48 Community♦ 1

votes

answers

views

Intractability of NP-complete problems as a principle of physics?

cc.complexity-theory soft-question big-picture experimental

Jul 24 '13 at 0:17 James McIntosh 9

votes

answers

views

Proof of undecidability not by reduction from the halting problem

computability

Apr 5 '14 at 4:41 Joshua Grochow 34.1k

votes

answers

472

views

Can we sort without permutations?

sorting

Apr 3 '14 at 12:43 Yoshio Okamoto 3,716

votes

answer

160

views

What is the underlying physical principle behind quantum fault tolerance in quantum computation?

quantum-computing

Dec 11 '13 at 16:02 Niel de Beaudrap 8,709

votes

answer

192

views

Techniques for lower bounding spectral gaps in the quantum adiabatic algorithm

reference-request quantum-computing

Dec 21 '13 at 19:03 user20801 41

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

17 Bookmarks

What papers should everyone read?

Algorithms from the Book.

What is the enlightenment I'm supposed to attain after studying finite automata?

What Books Should Everyone Read?

Major unsolved problems in theoretical computer science?

What Lecture Notes Should Everyone Read?

What are the recent TCS books whose drafts are available online?

What would it mean to disprove Church-Turing thesis?

Adiabatic quantum computing with level crossings

Justifying asymptotic worst-case analysis to scientists

Is there a geometrical picture for adiabatic quantum computation?

Is there a formal proof that quantum computing is or will be faster than classical computing?

Intractability of NP-complete problems as a principle of physics?

Proof of undecidability not by reduction from the halting problem

Can we sort without permutations?

What is the underlying physical principle behind quantum fault tolerance in quantum computation?

Techniques for lower bounding spectral gaps in the quantum adiabatic algorithm