Sciweavers

164 search results - page 5 / 33
» The Learnability of Quantum States
Sort
View
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 7 months 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
DCC
2008
IEEE
14 years 7 months 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...
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 4 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
EUROCRYPT
2005
Springer
14 years 1 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
STACS
2005
Springer
14 years 1 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous