Physics – Quantum Physics
Scientific paper
2002-02-28
Phys. Rev. A66, 022303 (2002).
Physics
Quantum Physics
11 pages, RevTeX, 3 figures
Scientific paper
10.1103/PhysRevA.66.022303
Suppose that three kinds of quantum systems are given in some unknown states $\ket f^{\otimes N}$, $\ket{g_1}^{\otimes K}$, and $\ket{g_2}^{\otimes K}$, and we want to decide which \textit{template} state $\ket{g_1}$ or $\ket{g_2}$, each representing the feature of the pattern class ${\cal C}_1$ or ${\cal C}_2$, respectively, is closest to the input \textit{feature} state $\ket f$. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first is a semiclassical strategy which is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (\textit{learning} process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement which we might call as the {\it universal quantum matching machine}. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure which is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process.
Carlini Alberto
Sasaki Masahide
No associations
LandOfFree
Quantum learning and universal quantum matching machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum learning and universal quantum matching machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum learning and universal quantum matching machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-328937