164 search results - page 18 / 33 » The Learnability of Quantum States |
ENTCS
2008
14 years 11 months ago
2008
We recast Selinger's CPM-construction of completely positive maps [11] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of compl...
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
144
click to vote
TCS
2012
13 years 7 months ago
2012
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
111
click to vote
TARK
2009
Springer
15 years 6 months ago
2009
Springer
Kolmogorov’s setting for probability theory is given an original generalization to account for probabilities arising from Quantum Mechanics. The sample space has a central role ...
BIOSYSTEMS
2007
14 years 12 months ago
2007
The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...