Sciweavers

934 search results - page 15 / 187
» Quantum Algorithmic Entropy
Sort
View
TIT
2002
72views more  TIT 2002»
13 years 7 months ago
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
FEGC
2008
84views Biometrics» more  FEGC 2008»
13 years 9 months ago
Structure Inference of Bayesian Networks from Data: A New Approach Based on Generalized Conditional Entropy
We propose a novel algorithm for extracting the structure of a Bayesian network from a dataset. Our approach is based on generalized conditional entropies, a parametric family of e...
Dan A. Simovici, Saaid Baraty
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 8 months ago
Short seed extractors against quantum storage
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
Amnon Ta-Shma
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
14 years 1 months ago
Bounds for Error Reduction with Few Quantum Queries
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...