Quantum compression with classically simulatable circuits

Abhinav Anand, Jakob S. Kottmann, Alán Aspuru-Guzik
7/6/2022
quant-phcs.LGcs.NE

No confident code implementation found for this paper.

Abstract

As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was proposed as a way for the compression of quantum information to reduce resource requirements. Here, we present a strategy to design quantum autoencoders using evolutionary algorithms for transforming quantum information into lower-dimensional representations. We successfully demonstrate the initial applications of the algorithm for compressing different families of quantum states. In particular, we point out that using a restricted gate set in the algorithm allows for efficient simulation of the generated circuits. This approach opens the possibility of using classical logic to find low representations of quantum data, using fewer computational resources.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{anand2022quantum,
  title  = {Quantum compression with classically simulatable circuits},
  author = {Abhinav Anand and Jakob S. Kottmann and Alán Aspuru-Guzik},
  year   = {2022},
  eprint = {2207.02961},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.02961v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.02961.svg)](https://codeofpaper.com/paper/2207.02961)

Discussion