Pith. sign in

REVIEW 2 cited by

Quantum Variational Autoencoder

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1802.05779 v2 pith:I7RMTUFO submitted 2018-02-15 quant-ph cs.LGstat.ML

classification quant-phcs.LGstat.ML
keywords quantumgenerativelatentperformanceqvaesvariationalachieveautoencoder
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximizing a well-defined loss-function: a 'quantum' lower-bound to a variational approximation of the log-likelihood. We use quantum Monte Carlo (QMC) simulations to train and evaluate the performance of QVAEs. To achieve the best performance, we first create a VAE platform with discrete latent space generated by a restricted Boltzmann machine (RBM). Our model achieves state-of-the-art performance on the MNIST dataset when compared against similar approaches that only involve discrete variables in the generative process. We consider QVAEs with a smaller number of latent units to be able to perform QMC simulations, which are computationally expensive. We show that QVAEs can be trained effectively in regimes where quantum effects are relevant despite training via the quantum bound. Our findings open the way to the use of quantum computers to train QVAEs to achieve competitive performance for generative models. Placing a QBM in the latent space of a VAE leverages the full potential of current and next-generation quantum computers as sampling devices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimization by VarQITE on Adaptive Variational Quantum Kolmogorov-Arnold Network

    quant-ph 2025-06 conditional novelty 5.0 of 10

    Using variational quantum imaginary time evolution as a training rule can fit toy functions with a KAN-style quantum circuit, but classification performance remains worse than standard approaches.

  2. The effect of Quantum Time Crystal Computing to Quantum Machine Learning methods

    quant-ph 2025-06 reject novelty 4.0 of 10

    Adding controlled noise from a simulated time crystal improved fitting accuracy for two quantum neural network variants while degrading quantum reservoir computing, in small numerical tests.

Pith tools