Quantum-state preparation with universal gate decompositions

Result code in 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>

Result on the web

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

Result language

angličtina

Original language name

Quantum-state preparation with universal gate decompositions

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BD - Information theory

OECD FORD branch

—

Project

<a href="/en/project/LA09016" target="_blank" >LA09016: Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>

Continuities

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

Publication year

2011

Confidentiality

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

Name of the periodical

Physical Review A

ISSN

1050-2947

e-ISSN

—

Volume of the periodical

83

Issue of the periodical within the volume

3

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

5

Pages from-to

"nestránkováno"

UT code for WoS article

000287960200002

EID of the result in the Scopus database

—