Optimization and experimental realization of the quantum permutation algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F17%3A00319118" target="_blank" >RIV/68407700:21340/17:00319118 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization and experimental realization of the quantum permutation algorithm

Popis výsledku v původním jazyce

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n-qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n-qubit case that the algorithm can be simplified so that it requires only O(n) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

Název v anglickém jazyce

Optimization and experimental realization of the quantum permutation algorithm

Popis výsledku anglicky

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its n-qubit implementations, the number of required quantum gates scales quadratically with n due to the quantum Fourier transforms included. We show here for the n-qubit case that the algorithm can be simplified so that it requires only O(n) quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

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

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2017

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

96

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

9

Strana od-do

1-9

Kód UT WoS článku

000418910400008

EID výsledku v databázi Scopus

—