Tag Archives: Alex Arkhipov

Aaronson and Arkhipov’s Result on Hierarchy Collapse

Posted on November 17, 2010 by Gil Kalai

Scott Aaronson gave a thought-provoking lecture in our Theory seminar three weeks ago. (Actually, this was eleven months ago.) The slides are here . The lecture discussed two results regarding the computational power of quantum computers. One result from this paper gives an … Continue reading →

Posted in Computer Science and Optimization, Physics | Tagged Alex Arkhipov, Computational complexity, Polynomial hierarchy, Quantum computation, Quantum computers, Scott Aaronson | 4 Comments

	vznvzn on Why is mathematics possib…
	Dmitry on Why is mathematics possib…
	Joshua Zelinsky on Why is mathematics possib…
	Joshua Zelinsky on Why is mathematics possib…
	modelpractice on Why is mathematics possib…
	Andriy on Around Borsuk’s Conjectu…
	Gil Kalai on Around Borsuk’s Conjectu…
	Sergei Yakovenko on Dan Mostow on Haaretz and Othe…
	Andriy on Around Borsuk’s Conjectu…
	Local Limits \| Event… on New Ramanujan Graphs!
	Another Interesting… on Taking balls away: Oz’…
	Weekly links for May… on Taking balls away: Oz’…

Tag Archives: Alex Arkhipov

Aaronson and Arkhipov’s Result on Hierarchy Collapse

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Tags

Follow “Combinatorics and more”