Quantum generative adversarial network for generating discrete distribution
Open accessThe DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
Abstract Quantum machine learning has recently attracted much attention from the community of quantum computing. In this paper, we explore the ability of generative adversarial networks (GANs) based on quantum computing. More specifically, we propose a quantum GAN for generating classical discrete distribution, which has a classical-quantum hybrid architecture and is composed of a parameterized quantum circuit as the generator and a classical neural network as the discriminator. The parameterized quantum circuit only consists of simple one-qubit rotation gates and two-qubit controlled-phase gates that are available in current quantum devices. Our scheme has the following characteristics and potential advantages: (i) It is intrinsically capable of generating discrete data (e.g., text data), while classical GANs are clumsy for this task due to the vanishing gradient problem. (ii) Our scheme avoids the input/output bottlenecks embarrassing most of the existing quantum learning algorithms that either require to encode the classical input data into quantum states, or output a quantum state corresponding to the solution instead of giving the solution itself, which inevitably compromises the speedup of the quantum algorithm. (iii) The probability distribution implicitly given by data samples can be loaded into a quantum state, which may be useful for some further applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Unsupervised representation learning with deep convolutional generative adversarial networks
Radford, A., Metz, L., & Chintala, S. (2015) · arXiv · doi:10.48550/arxiv.1511.06434 · Cited by 12,235 · cited 1×
“GAN as an implicit generative model can be more expressive due to less restrictions in network structures. Many variations of GAN have been proposed including conditional GAN [34], LAPGAN [18], DCGAN [39] and InfoGAN [15]. Apart from images, language data also plays an important role in artificial intelligence. As the…”
BackgroundConditional Generative Adversarial Nets
Mirza, M., & Osindero, S. (2014) · arXiv · doi:10.48550/arxiv.1411.1784 · Cited by 8,863
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“systems. On the other hand, quantum computing promises significant enhancement of some machine learning algorithms, especially in computational complexity. Many theoretical and experimental researches [24, 46, 11, 40, 32, 12, 47, 21, 36, 20, 48, 37, 13] on machines learning problems with the help of quantum computing h…”
BackgroundQuantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639 · cited 2×
“[35] has proved the similar equation ∂P~ θ(x) ∂θ = 1 2 (”
MethodZur Quantenmechanik der Sto�vorg�nge
Born, M. (1926) · Zeitschrift f�r Physik · doi:10.1007/bf01397477 · Cited by 1,623
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385 · cited 1×
“systems. On the other hand, quantum computing promises significant enhancement of some machine learning algorithms, especially in computational complexity. Many theoretical and experimental researches [24, 46, 11, 40, 32, 12, 47, 21, 36, 20, 48, 37, 13] on machines learning problems with the help of quantum computing h…”
BackgroundCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Zhou, N.-R., Zhang, T.-F., Xie, X.-W., & Wu, J.-Y. (2023) · Signal Processing Image Communication · doi:10.1016/j.image.2022.116891 · Cited by 161
Adaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2020) · arXiv · doi:10.48550/arxiv.2010.00629 · Cited by 66
Metadata
- Authors
- Situ, H., He, Z., Wang, Y., Li, L., & Zheng, S.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2020-10
- Volume
- 538
- Pages
- 193-208
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W3034762567
- Cited by
- 162
- References
- 23
- FWCI
- 7.01
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum generative adversarial network for generating discrete distribution. https://app.cochat.ai/papers/10.1016/j.ins.2020.05.127
- The paper
- Situ, H., He, Z., Wang, Y., Li, L., & Zheng, S. (2020). Quantum generative adversarial network for generating discrete distribution. Information Sciences. https://doi.org/10.1016/j.ins.2020.05.127
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.