164 search results - page 10 / 33 » The Learnability of Quantum States |
STOC
2009
ACM
16 years 10 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
102
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
110
click to vote
ICGI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
ASIACRYPT
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Spector et al. have shown [1],[2],[3] that genetic programming can be used to evolve quantum circuits. In this paper, we present new results in this field, introducing p...