Abstract
A full quantum extension of the binary quantum pattern matching problem addressed previously was considered. In such a problem, given unknown template states g1>K and g2>K, and an input feature state f>K, the challenge was to decide to which template the input feature state is closest in the sense of the fidelity criterion. Two kinds of matching strategies, a semiclassical matching strategy based on learning and a universal quantum matching strategy, were outlined.
Lingua originale | Inglese |
---|---|
Numero di articolo | 022303 |
pagine (da-a) | 1-10 |
Numero di pagine | 10 |
Rivista | Physical Review A - Atomic, Molecular, and Optical Physics |
Volume | 66 |
Numero di pubblicazione | 2 |
DOI | |
Stato di pubblicazione | Pubblicato - ago 2002 |
Pubblicato esternamente | Sì |