Programovatelné rozlišovače kvantových stavů s jednoduchými programy

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F06%3A00016173" target="_blank" >RIV/00216224:14330/06:00016173 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Programmable quantum state discriminators with simple programs

Popis výsledku v původním jazyce

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as an input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the knownstate, is fed into the data register. The device will then tell us, again optimally, whether the data state matches the template or is the known state. We determine two types of optimal devices. The first performs discrimination with mini

Název v anglickém jazyce

Programmable quantum state discriminators with simple programs

Popis výsledku anglicky

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as an input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the knownstate, is fed into the data register. The device will then tell us, again optimally, whether the data state matches the template or is the known state. We determine two types of optimal devices. The first performs discrimination with mini

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F04%2F1153" target="_blank" >GA201/04/1153: Kvantové zdroje a primitiva</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2006

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Physical Review A

ISSN

1050-2947

e-ISSN

—

Svazek periodika

Vol. 73

Číslo periodika v rámci svazku

No. 6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

"A062334"

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—