Sciweavers

2479 search results - page 47 / 496
» Quantum complexity theory
Sort
View
ECIR
2010
Springer
13 years 11 months ago
Using the Quantum Probability Ranking Principle to Rank Interdependent Documents
A known limitation of the Probability Ranking Principle (PRP) is that it does not cater for dependence between documents. Recently, the Quantum Probability Ranking Principle (QPRP)...
Guido Zuccon, Leif Azzopardi
TIT
2010
129views Education» more  TIT 2010»
13 years 4 months ago
Channel-optimized quantum error correction
We develop a theory for finding quantum error correction (QEC) procedures which are optimized for given noise channels. Our theory accounts for uncertainties in the noise channel, ...
Soraya Taghavi, Robert L. Kosut, Daniel A. Lidar
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 10 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
ENTCS
2008
109views more  ENTCS 2008»
13 years 10 months ago
Axiomatic Description of Mixed States From Selinger's CPM-construction
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...
Bob Coecke
CPHYSICS
2006
57views more  CPHYSICS 2006»
13 years 10 months ago
Generation of Clebsch-Gordan coefficients for the point and double groups
The theory of the point and double groups has been widely used in quantum physics to understand the structure and dynamical properties of molecules and solids. In order to constru...
K. Rykhlinskaya, S. Fritzsche