Implementation of quantum compression on IBM quantum computers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14610%2F22%3A00125784" target="_blank" >RIV/00216224:14610/22:00125784 - isvavai.cz</a>
Result on the web
<a href="https://www.nature.com/articles/s41598-022-09881-8" target="_blank" >https://www.nature.com/articles/s41598-022-09881-8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1038/s41598-022-09881-8" target="_blank" >10.1038/s41598-022-09881-8</a>
Alternative languages
Result language
angličtina
Original language name
Implementation of quantum compression on IBM quantum computers
Original language description
Advances in development of quantum computing processors brought ample opportunities to test the performance of various quantum algorithms with practical implementations. In this paper we report on implementations of quantum compression algorithm that can efficiently compress unknown quantum information. We restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors. We implemented the algorithm on IBM quantum processors with two different topological layouts - a fully connected triangle processor and a partially connected line processor. It turns out that the incomplete connectivity of the line processor affects the performance only minimally. On the other hand, it turns out that the transpilation, i.e. compilation of the circuit into gates physically available to the quantum processor, crucially influences the result. We also have seen that the compression followed by immediate decompression is, even for such a simple case, on the edge or even beyond the capabilities of currently available quantum processors.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Nature Scientific Reports
ISSN
2045-2322
e-ISSN
2045-2322
Volume of the periodical
12
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
5841
UT code for WoS article
000779768200001
EID of the result in the Scopus database
2-s2.0-85127730435