Sciweavers

164 search results - page 2 / 33
» The Learnability of Quantum States
Sort
View
FCS
2006
13 years 7 months ago
Mixed States in Quantum Cryptography
Ansis Rosmanis, Ilze Dzelme-Berzina
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 25 days ago
Parallel Approximation of Non-interactive Zero-sum Quantum Games
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
Rahul Jain, John Watrous
CORR
2010
Springer
87views Education» more  CORR 2010»
13 years 4 months ago
Quantum money from knots
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
Edward Farhi, David Gosset, Avinatan Hassidim, And...
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
14 years 13 days ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 1 months ago
A short proof of the Quantum Substate Theorem
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen [7] gives us a powerful operational interpretation of the observational divergence of two quantum states, a quanti...
Rahul Jain, Ashwin Nayak