Sciweavers

2661 search results - page 31 / 533
» Quantum Complexity Classes
Sort
View
92
Voted
DCC
2008
IEEE
16 years 7 days ago
From graph states to two-graph states
The name `graph state' is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computin...
Constanza Riera, Stéphane Jacob, Matthew G. Parke...
105
Voted
TIT
2008
140views more  TIT 2008»
15 years 16 days ago
A Resource Framework for Quantum Shannon Theory
Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distilla...
Igor Devetak, Aram Wettroth Harrow, Andreas J. Win...
ML
2000
ACM
244views Machine Learning» more  ML 2000»
15 years 13 days ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
93
Voted
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 28 days ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
102
Voted
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 14 days ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman