Network profile

Dan Stahlke

Reputation

493

2018
2019
2020
2021

Top tag

quantum-computing

Next privilege

500 Rep.

Access review queues

Badges

Newest

Next badge

0/1

Impact

0 posts edited

0 helpful flags

12 votes cast

14 Bookmarks

Votes Activity Newest Views Added

368

votes

answers

110k

views

Algorithms from the Book.

Jan 5 '19 at 10:30 Community♦ 1

votes

answers

14k

views

Powerful Algorithms too complex to implement

ds.algorithms ds.data-structures big-list implementation

Jul 24 '18 at 17:51 Kevin A. Wortman 383

votes

answers

views

Communication Complexity …Classes?

cc.complexity-theory complexity-classes big-picture communication-complexity

Mar 27 '14 at 14:52 Joshua Grochow 33.7k

votes

answers

964

views

$\ell_p$-norm preserving Turing machines

cc.complexity-theory quantum-computing computability turing-machines norms

Mar 5 '14 at 17:23 Community♦ 1

votes

answers

411

views

On Lovasz theta function

graph-theory

Aug 17 '13 at 22:26 1.. 11.3k

votes

answers

259

views

What are the most recent developments in small-depth quantum circuits?

cc.complexity-theory reference-request quantum-computing open-problem

Mar 1 '13 at 0:44 xsi 101

votes

answer

402

views

Can quantum algorithms with exponential speed-up be rederived using span-programs?

cc.complexity-theory quantum-computing query-complexity

Sep 14 '12 at 2:39 Robin Kothari 13.1k

votes

answer

views

Clifford group quantum operations and classical computation

quantum-computing

Sep 11 '12 at 0:00 Tyson Williams 4,228

votes

answer

132

views

Known properties of a specific class of quantum states

reference-request quantum-computing quantum-information

Jun 8 '12 at 15:02 Alessandro Cosentino 3,740

votes

answers

539

views

Nonlocal Games and Quantum Communication

reference-request quantum-computing communication-complexity quantum-information

May 7 '12 at 14:31 Juan Bermejo Vega 1,345

votes

answers

350

views

Descriptive complexity of communication complexity classes

cc.complexity-theory lo.logic communication-complexity

Nov 19 '11 at 22:15 Marcin Kotowski 2,766

votes

answer

815

views

Reading up on $BQP = BPP^{BQNC}$

cc.complexity-theory reference-request quantum-computing

Jul 5 '11 at 13:53 Joshua Herman 1,611

votes

answers

383

views

Relativization with Respect to Non-Recursive Oracles

cc.complexity-theory computability oracles relativization

Nov 4 '10 at 16:47 Community♦ 1

votes

answers

732

views

Is there an equivalent to derandomization for quantum algorithms?

derandomization quantum-computing

Aug 24 '10 at 9:33 Ashley Montanaro 1,973

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

14 Bookmarks

Algorithms from the Book.

Powerful Algorithms too complex to implement

Communication Complexity …Classes?

$\ell_p$-norm preserving Turing machines

On Lovasz theta function

What are the most recent developments in small-depth quantum circuits?

Can quantum algorithms with exponential speed-up be rederived using span-programs?

Clifford group quantum operations and classical computation

Known properties of a specific class of quantum states

Nonlocal Games and Quantum Communication

Descriptive complexity of communication complexity classes

Reading up on $BQP = BPP^{BQNC}$

Relativization with Respect to Non-Recursive Oracles

Is there an equivalent to derandomization for quantum algorithms?