Sciweavers

2479 search results - page 48 / 496
» Quantum complexity theory
Sort
View
IPL
2000
77views more  IPL 2000»
13 years 10 months ago
Simplified proof of the Fourier Sampling Theorem
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
Peter Høyer
TIT
1998
127views more  TIT 1998»
13 years 9 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 4 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
COGSR
2010
74views more  COGSR 2010»
13 years 5 months ago
Two qubits for C.G. Jung's theory of personality
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
Reinhard Blutner, Elena Hochnadel
CPHYSICS
2006
95views more  CPHYSICS 2006»
13 years 10 months ago
Efficient data processing and quantum phenomena: Single-particle systems
We study the relation between the acquisition and analysis of data and quantum theory using a probabilistic and deterministic model for photon polarizers. We introduce criteria fo...
H. De Raedt, Koen De Raedt, K. Michielsen, S. Miya...