Sciweavers

14783 search results - page 14 / 2957
» Quantum Information Processing
Sort
View
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 4 months ago
The physical Church-Turing thesis and the principles of quantum theory
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
Pablo Arrighi, Gilles Dowek
FOCS
2009
IEEE
15 years 1 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
15 years 10 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
82
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 4 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker