Cited by 97Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Experimental Realization of a Quantum Autoencoder: The Compression of Qutrits via Machine Learning

Open access
Pepper, Alex, Tischler, Nora, Pryde, Geoff J.·2019·Physical Review Letters

Abstract

With quantum resources a precious commodity, their efficient use is highly desirable. Quantum autoencoders have been proposed as a way to reduce quantum memory requirements. Generally, an autoencoder is a device that uses machine learning to compress inputs, that is, to represent the input data in a lower-dimensional space. Here, we experimentally realize a quantum autoencoder, which learns how to compress quantum data using a classical optimization routine. We demonstrate that when the inherent structure of the dataset allows lossless compression, our autoencoder reduces qutrits to qubits with low error levels. We also show that the device is able to perform with minimal prior information about the quantum data or physical system and is robust to perturbations during its optimization routine.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.122.060501

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • A local version of the autoencoder cost function was proposed and shown to train well for large-scale problems.

    “Recently, a local version of this cost function was also proposed and was shown to train well for large-scale problems [166].”

    From Variational quantum algorithms (2021) · cites this paper as [166]

    The supplied passage labeled Abstract describes a different autoencoder cost function based on junk-mode occupation, and another reports training a device with that function. The experiment compressed qutrits to qubits; our copy does not show that this cost function was proposed as a local version or trained well on large-scale problems. (LLM, conf=0.85)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. G. R. Steinbrecher, J. P. Olson, D. Englund, and J. Carolan, arXiv:1808.10047. · arXiv
  2. Y. Ding, L. Lamata, M. Sanz, X. Chen, and E. Solano, arXiv:1807.10643. · arXiv
  3. See Supplemental Material at http://link.aps.org/ supplemental/10.1103/PhysRevLett.122.060501 for further details.
  4. M. Krenn, M. Malik, T. Scheidl, R. Ursin, and A. Zeilinger, in Optics in Our Time, edited by M. D. Al-Amri, M. El-Gomati, and M. S. Zubairy (Springer International Pub- lishing, Cham, 2016), pp. 455-482.
  5. S. Yu, F. Albarrán-Arriagada, J. C. Retamal, Y.-T. Wang, W. Liu, Z.-J. Ke, Y. Meng, Z.-P. Li, J.-S. Tang, E. Solano, L. Lamata, C.-F. Li, and G.-C. Guo, arXiv:1808.09241. · arXiv
  6. A. Laing, Quantum photonic circuits and high dimensional systems, Ph.D. thesis, University of Bristol, 2011.
  7. E. Martín-López, Photonic quantum information processing with the complex Hadamard operator, Ph. D. thesis, Uni- versity of Bristol, 2014.

Cited by

Sorted by citations

Authors
Pepper, A., Tischler, N., & Pryde, G. J.
Affiliations
Griffith University (AU)
Venue
Physical Review Letters
Published
2019-02-11
Volume
122
Issue
6
Pages
060501-060501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2952384119
Cited by
97
References
26
Citations by year
2026: 1 · 2025: 15 · 2024: 16 · 2023: 16 · 2022: 17 · 2021: 20 · 2020: 8 · 2019: 4
FWCI
5.59
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Figshare (submittedVersion, cc-by)
  • Griffith Research Online (submittedVersion)
  • arXiv (Cornell University)
Funders
Australian Research Council (DP160101911)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum autoencoders, quantum data compression, lossless compression, robustness to disturbances

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review