Quantum autoencoders using mixed reference states

Abstract One of the fundamental tasks in quantum information theory is quantum data compression, which can be realized via quantum autoencoders that first compress quantum states to low-dimensional ones and then recover to the original ones with a reference state. When taking a pure reference state, there exists an upper bound for the encoding fidelity, which limits the compression of states with high entropy. To overcome the entropy inconsistency, we allow the reference state to be a mixed state and propose a cost function that combines the encoding fidelity and the quantum mutual information. We consider the reference states to be a mixture of maximally mixed states and pure states and propose three strategies for setting the ratio of mixedness. Numerical simulations of different states and experimental implementations on IBM quantum computers illustrate the effectiveness of our approach.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2024-09-13
DOI
https://doi.org/10.1038/s41534-024-00872-3
Citations
5
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum autoencoders using mixed reference states

Daoyi Dong, Lloyd C. L. Hollenberg, Ian R. Petersen, Gary J. Mooney et al.
5 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
1.74
article

Quantum autoencoders using mixed reference states

Daoyi Dong, Lloyd C. L. Hollenberg, Ian R. Petersen, Gary J. Mooney, Hailan Ma
article en
5 citations

Abstract

Abstract One of the fundamental tasks in quantum information theory is quantum data compression, which can be realized via quantum autoencoders that first compress quantum states to low-dimensional ones and then recover to the original ones with a reference state. When taking a pure reference state, there exists an upper bound for the encoding fidelity, which limits the compression of states with high entropy. To overcome the entropy inconsistency, we allow the reference state to be a mixed state and propose a cost function that combines the encoding fidelity and the quantum mutual information. We consider the reference states to be a mixture of maximally mixed states and pure states and propose three strategies for setting the ratio of mixedness. Numerical simulations of different states and experimental implementations on IBM quantum computers illustrate the effectiveness of our approach.

npj Quantum InformationVol. 10(1)
Australian National University (AU), The University of Melbourne (AU), University of Canberra (AU), UNSW Sydney (AU)
Openalex Percentile: Top 13%
Quantum Computing Algorithms and Architecture
1.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantum autoencoders using mixed reference states — Daoyi Dong, Lloyd C. L. Hollenberg, et al. · npj Quantum Information (2024) | TGRS Research Map | TGRS