Quantum-walk-based state-transfer algorithms on the complete M-partite graph

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F21%3A00350096" target="_blank" >RIV/68407700:21340/21:00350096 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1103/PhysRevA.103.042222" target="_blank" >https://doi.org/10.1103/PhysRevA.103.042222</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1103/PhysRevA.103.042222" target="_blank" >10.1103/PhysRevA.103.042222</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Quantum-walk-based state-transfer algorithms on the complete M-partite graph

Popis výsledku v původním jazyce

We investigate coined quantum-walk search and state-transfer algorithms, focusing on the complete M-partite graph with N vertices in each partition. First, it is shown that by adding a loop to each vertex, the search algorithm finds the marked vertex with unit probability in the limit of a large graph. Next, we employ the evolution operator of the search with two marked vertices to perform a state transfer between the sender and the receiver. We show that when the sender and the receiver are in different partitions, the algorithm succeeds with fidelity approaching unity for a large graph. However, when the sender and the receiver are in the same partition, the fidelity does not reach exactly 1. To solve this problem, we propose a state-transfer algorithm with an active switch, whose fidelity can be estimated based on the single vertex search alone.

Název v anglickém jazyce

Quantum-walk-based state-transfer algorithms on the complete M-partite graph

Popis výsledku anglicky

We investigate coined quantum-walk search and state-transfer algorithms, focusing on the complete M-partite graph with N vertices in each partition. First, it is shown that by adding a loop to each vertex, the search algorithm finds the marked vertex with unit probability in the limit of a large graph. Next, we employ the evolution operator of the search with two marked vertices to perform a state transfer between the sender and the receiver. We show that when the sender and the receiver are in different partitions, the algorithm succeeds with fidelity approaching unity for a large graph. However, when the sender and the receiver are in the same partition, the fidelity does not reach exactly 1. To solve this problem, we propose a state-transfer algorithm with an active switch, whose fidelity can be estimated based on the single vertex search alone.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10306 - Optics (including laser optics and quantum optics)

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

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

2469-9926

e-ISSN

2469-9934

Svazek periodika

103

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

16

Strana od-do

"042222-1"-"042222-16"

Kód UT WoS článku

000646167300001

EID výsledku v databázi Scopus

2-s2.0-85105051868