Sciweavers

2479 search results - page 49 / 496
» Quantum complexity theory
Sort
View
TIT
2002
63views more  TIT 2002»
13 years 9 months ago
Compressing quantum mixed-state sources by sending classical information
Abstract--We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob ...
Emina Soljanin
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
14 years 10 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 5 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
14 years 3 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker