Pith. sign in

REVIEW 6 cited by

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 1804.04168 v1 pith:MVGOP73W submitted 2018-04-11 quant-ph cs.LGstat.ML

Differentiable Learning of Quantum Circuit Born Machine

classification quant-ph cs.LGstat.ML
keywords quantumgenerativecircuitcircuitslearningalgorithmbornclassical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. One can efficiently draw samples from the quantum circuits via projective measurements on qubits. However, similar to the leading implicit generative models in deep learning, such as the generative adversarial networks, the quantum circuits cannot provide the likelihood of the generated samples, which poses a challenge to the training. We devise an efficient gradient-based learning algorithm for the quantum circuit Born machine by minimizing the kerneled maximum mean discrepancy loss. We simulated generative modeling of the Bars-and-Stripes dataset and Gaussian mixture distributions using deep quantum circuits. Our experiments show the importance of circuit depth and gradient-based optimization algorithm. The proposed learning algorithm is runnable on near-term quantum device and can exhibit quantum advantages for generative modeling.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Genuine Global Kochen-Specker Contextuality as Classical Coordination Cost

    quant-ph 2026-06 unverdicted novelty 7.0

    Genuine global KS contextuality is framed as the classical coordination cost needed to maintain a global noncontextual explanation from locally available information in multipartite systems.

  2. QnRL: Quantum-Native Reinforcement Learning

    quant-ph 2026-06 unverdicted novelty 6.0

    QnRL is a distributional quantum RL framework that distills conditional action policies from moments of quantum generative models in Hilbert space via the QuAK algorithm, reporting higher scores and fewer parameters t...

  3. PennyLane: Automatic differentiation of hybrid quantum-classical computations

    quant-ph 2018-11 accept novelty 6.0

    PennyLane is a software library extending automatic differentiation to hybrid quantum-classical systems for variational quantum algorithms.

  4. Evaluating quantum circuits in the reservoir computing paradigm

    quant-ph 2026-05 unverdicted novelty 5.0

    Brickwall quantum circuits with Haar-random, dual-unitary, and solvable two-qubit gates serve as effective reservoirs for temporal processing tasks, with performance correlated to circuit dynamics and validated on syn...

  5. Evaluating quantum circuits in the reservoir computing paradigm

    quant-ph 2026-05 unverdicted novelty 5.0

    Brickwall circuits from Haar-random, dual-unitary, and solvable two-qubit gates are tested as quantum reservoirs, showing effective fading memory and prediction accuracy on synthetic time-series data.

  6. Quantum generative modeling for financial time series with temporal correlations

    quant-ph 2025-07 unverdicted novelty 5.0

    QGANs with quantum generators and classical discriminators generate financial time series matching target distributions and desired temporal correlations, with quality varying by circuit depth, bond dimension, and sim...