Quantum learning and universal quantum matching machine

Masahide Sasaki; Alberto Carlini

doi:10.1103/PhysRevA.66.022303

Quantum learning and universal quantum matching machine

Masahide Sasaki
, Alberto Carlini

Research output: Contribution to journal › Article › peer-review

Abstract

A full quantum extension of the binary quantum pattern matching problem addressed previously was considered. In such a problem, given unknown template states g₁>^K and g₂>^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.

Original language	English
Article number	022303
Pages (from-to)	1-10
Number of pages	10
Journal	Physical Review A - Atomic, Molecular, and Optical Physics
Volume	66
Issue number	2
DOIs	https://doi.org/10.1103/PhysRevA.66.022303
Publication status	Published - Aug 2002
Externally published	Yes

Access to Document

10.1103/PhysRevA.66.022303

Cite this

@article{fd300b47555e4d39bd6461f12858cd8a,

title = "Quantum learning and universal quantum matching machine",

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.",

author = "Masahide Sasaki and Alberto Carlini",

year = "2002",

month = aug,

doi = "10.1103/PhysRevA.66.022303",

language = "English",

volume = "66",

pages = "1--10",

journal = "Physical Review A - Atomic, Molecular, and Optical Physics",

issn = "1050-2947",

publisher = "American Physical Society",

number = "2",

}

TY - JOUR

T1 - Quantum learning and universal quantum matching machine

AU - Sasaki, Masahide

AU - Carlini, Alberto

PY - 2002/8

Y1 - 2002/8

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84983710547

U2 - 10.1103/PhysRevA.66.022303

DO - 10.1103/PhysRevA.66.022303

M3 - Article

SN - 1050-2947

VL - 66

SP - 1

EP - 10

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

IS - 2

M1 - 022303

ER -

Quantum learning and universal quantum matching machine

Abstract

Access to Document

Other files and links

Fingerprint

Cite this