Quantum Science and Technology · 2023 · 31 citations · 21 references
ComputingComputer ScienceMachine LearningQuantum ComputingTheory Of ComputationGenerative ModelingQuantum BitsQuantum CircuitsQuantum ComputationQuantum Machine LearningCircuit Depth OptimizationModel Performance AnalysisQuantum Circuit LearningQuantum Generative ModelsResource Requirements Assessment
Abstract In recent proposals of quantum circuit models for generative tasks, the discussion about their performance has been limited to their ability to reproduce a known target distribution. For example, expressive model families such as quantum circuit Born machines (QCBMs) have been almost entirely evaluated on their capability to learn a given target distribution with high accuracy. While this aspect may be ideal for some tasks, it limits the scope of a generative model’s assessment to its ability to memorize data rather than generalize . As a result, there has been little understanding of a model’s generalization performance and the relation between such capability and the resource requirements, e.g. the circuit depth and the amount of training data. In this work, we leverage upon a recently proposed generalization evaluation framework to begin addressing this knowledge gap. We first investigate the QCBM’s learning process of a cardinality-constrained distribution and see an increase in generalization performance while increasing the circuit depth. In the 12-qubit example presented here, we observe that with as few as <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mn>30</mml:mn> <mml:mi mathvariant="normal">%</mml:mi> </mml:math> of the valid data in the training set, the QCBM exhibits the best generalization performance toward generating unseen and valid data. Lastly, we assess the QCBM’s ability to generalize not only to valid samples, but to high-quality bitstrings distributed according to an adequately re-weighted distribution. We see that the QCBM is able to effectively learn the reweighted dataset and generate unseen samples with higher quality than those in the training set. To the best of our knowledge, this is the first work in the literature that presents the QCBM’s generalization performance as an integral evaluation metric for quantum generative models, and demonstrates the QCBM’s ability to generalize to high-quality, desired novel samples.
21
Barren plateaus in quantum neural network training landscapes
Jarrod R. McClean, Sergio Boixo, Vadim Smelyanskiy et al. · Nature Communications · 2018 · 2.1K citations · Full text
Computing, Computer Science, Physics +17
Cost function dependent barren plateaus in shallow parametrized quantum circuits
M. Cerezo, Akira Sone, Tyler Volkoff et al. · Nature Communications · 2021 · 1.1K citations · Full text
Computing, Computer Science, Physics +13
Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus
Zoë Holmes, Kunal Sharma, M. Cerezo et al. · PRX Quantum · 2022 · 582 citations · Full text
Computing, Computer Science, Physics +11
Generalization in quantum machine learning from few training data
Hsin-Yuan Huang, M. Cerezo, Kunal Sharma et al. · Nature Communications · 2022 · 443 citations · Full text
Computing, Computer Science, Physics +17