IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i22p4678-d1282301.html
   My bibliography  Save this article

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Author

Listed:
  • Raja Selvarajan

    (Department of Physics and Astronomy, Purdue University, West Lafayette, IN 47907, USA)

  • Manas Sajjan

    (Department of Chemistry, Purdue University, West Lafayette, IN 47907, USA)

  • Travis S. Humble

    (Oak Ridge National Laboratory (ORNL), Oak Ridge, TN 37830, USA)

  • Sabre Kais

    (Department of Physics and Astronomy, Purdue University, West Lafayette, IN 47907, USA
    Department of Chemistry, Purdue University, West Lafayette, IN 47907, USA
    Purdue Quantum Science and Engineering Institute, West Lafayette, IN 47907, USA)

Abstract

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing T r ( ρ 2 ) . The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

Suggested Citation

  • Raja Selvarajan & Manas Sajjan & Travis S. Humble & Sabre Kais, 2023. "Dimensionality Reduction with Variational Encoders Based on Subsystem Purification," Mathematics, MDPI, vol. 11(22), pages 1-9, November.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:22:p:4678-:d:1282301
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/22/4678/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/22/4678/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:22:p:4678-:d:1282301. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.