Quantum-state preparation with universal gate decompositions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F11%3A00053115" target="_blank" >RIV/00216224:14330/11:00053115 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Quantum-state preparation with universal gate decompositions

Popis výsledku v původním jazyce

In quantum computation every unitary operation can be decomposed into quantum circuits, a series of single qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparationof arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces thetotal number of cnot gates from 2n to 23/242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits.

Název v anglickém jazyce

Quantum-state preparation with universal gate decompositions

Popis výsledku anglicky

In quantum computation every unitary operation can be decomposed into quantum circuits, a series of single qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparationof arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces thetotal number of cnot gates from 2n to 23/242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits.

Druh

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

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/LA09016" target="_blank" >LA09016: Účast ČR v European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2011

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

83

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

5

Strana od-do

"nestránkováno"

Kód UT WoS článku

000287960200002

EID výsledku v databázi Scopus

—