1
|
Wang Y, Xue S, Wang Y, Liu Y, Ding J, Shi W, Wang D, Liu Y, Fu X, Huang G, Huang A, Deng M, Wu J. Quantum generative adversarial learning in photonics. OPTICS LETTERS 2023; 48:5197-5200. [PMID: 37831826 DOI: 10.1364/ol.505084] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 09/08/2023] [Accepted: 09/18/2023] [Indexed: 10/15/2023]
Abstract
Quantum generative adversarial networks (QGANs), an intersection of quantum computing and machine learning, have attracted widespread attention due to their potential advantages over classical analogs. However, in the current era of noisy intermediate-scale quantum (NISQ) computing, it is essential to investigate whether QGANs can perform learning tasks on near-term quantum devices usually affected by noise and even defects. In this Letter, using a programmable silicon quantum photonic chip, we experimentally demonstrate the QGAN model in photonics for the first time to our knowledge and investigate the effects of noise and defects on its performance. Our results show that QGANs can generate high-quality quantum data with a fidelity higher than 90%, even under conditions where up to half of the generator's phase shifters are damaged, or all of the generator and discriminator's phase shifters are subjected to phase noise up to 0.04π. Our work sheds light on the feasibility of implementing QGANs on the NISQ-era quantum hardware.
Collapse
|
2
|
Tian J, Sun X, Du Y, Zhao S, Liu Q, Zhang K, Yi W, Huang W, Wang C, Wu X, Hsieh MH, Liu T, Yang W, Tao D. Recent Advances for Quantum Neural Networks in Generative Learning. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2023; 45:12321-12340. [PMID: 37126624 DOI: 10.1109/tpami.2023.3272029] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/03/2023]
Abstract
Quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit Born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum variational autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relations and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs.
Collapse
|
3
|
Zhu X, Hou X. Quantum architecture search via truly proximal policy optimization. Sci Rep 2023; 13:5157. [PMID: 36991061 DOI: 10.1038/s41598-023-32349-2] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/23/2022] [Accepted: 03/26/2023] [Indexed: 03/31/2023] Open
Abstract
Quantum Architecture Search (QAS) is a process of voluntarily designing quantum circuit architectures using intelligent algorithms. Recently, Kuo et al. (Quantum architecture search via deep reinforcement learning. arXiv preprint arXiv:2104.07715, 2021) proposed a deep reinforcement learning-based QAS (QAS-PPO) method, which used the Proximal Policy Optimization (PPO) algorithm to automatically generate the quantum circuit without any expert knowledge in physics. However, QAS-PPO can neither strictly limit the probability ratio between old and new policies nor enforce well-defined trust domain constraints, resulting in poor performance. In this paper, we present a new deep reinforcement learning-based QAS method, called Trust Region-based PPO with Rollback for QAS (QAS-TR-PPO-RB), to automatically build the quantum gates sequence from the density matrix only. Specifically, inspired by the research work of Wang, we employ an improved clipping function to implement the rollback behavior to limit the probability ratio between the new strategy and the old strategy. In addition, we use the triggering condition of the clipping based on the trust domain to optimize the policy by restricting the policy within the trust domain, which leads to guaranteed monotone improvement. Experiments on several multi-qubit circuits demonstrate that our presented method achieves better policy performance and lower algorithm running time than the original deep reinforcement learning-based QAS method.
Collapse
Affiliation(s)
- Xianchao Zhu
- School of Artificial Intelligence and Big Data, Henan University of Technology, Zhengzhou, 450001, China.
| | - Xiaokai Hou
- Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu, China
| |
Collapse
|
4
|
Quantum machine learning with differential privacy. Sci Rep 2023; 13:2453. [PMID: 36774365 PMCID: PMC9922308 DOI: 10.1038/s41598-022-24082-z] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/01/2021] [Accepted: 11/09/2022] [Indexed: 02/13/2023] Open
Abstract
Quantum machine learning (QML) can complement the growing trend of using learned models for a myriad of classification tasks, from image recognition to natural speech processing. There exists the potential for a quantum advantage due to the intractability of quantum operations on a classical computer. Many datasets used in machine learning are crowd sourced or contain some private information, but to the best of our knowledge, no current QML models are equipped with privacy-preserving features. This raises concerns as it is paramount that models do not expose sensitive information. Thus, privacy-preserving algorithms need to be implemented with QML. One solution is to make the machine learning algorithm differentially private, meaning the effect of a single data point on the training dataset is minimized. Differentially private machine learning models have been investigated, but differential privacy has not been thoroughly studied in the context of QML. In this study, we develop a hybrid quantum-classical model that is trained to preserve privacy using differentially private optimization algorithm. This marks the first proof-of-principle demonstration of privacy-preserving QML. The experiments demonstrate that differentially private QML can protect user-sensitive information without signficiantly diminishing model accuracy. Although the quantum model is simulated and tested on a classical computer, it demonstrates potential to be efficiently implemented on near-term quantum devices [noisy intermediate-scale quantum (NISQ)]. The approach's success is illustrated via the classification of spatially classed two-dimensional datasets and a binary MNIST classification. This implementation of privacy-preserving QML will ensure confidentiality and accurate learning on NISQ technology.
Collapse
|
5
|
Zeguendry A, Jarir Z, Quafafou M. Quantum Machine Learning: A Review and Case Studies. ENTROPY (BASEL, SWITZERLAND) 2023; 25:287. [PMID: 36832654 PMCID: PMC9955545 DOI: 10.3390/e25020287] [Citation(s) in RCA: 8] [Impact Index Per Article: 8.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 12/30/2022] [Revised: 01/31/2023] [Accepted: 02/01/2023] [Indexed: 06/18/2023]
Abstract
Despite its undeniable success, classical machine learning remains a resource-intensive process. Practical computational efforts for training state-of-the-art models can now only be handled by high speed computer hardware. As this trend is expected to continue, it should come as no surprise that an increasing number of machine learning researchers are investigating the possible advantages of quantum computing. The scientific literature on Quantum Machine Learning is now enormous, and a review of its current state that can be comprehended without a physics background is necessary. The objective of this study is to present a review of Quantum Machine Learning from the perspective of conventional techniques. Departing from giving a research path from fundamental quantum theory through Quantum Machine Learning algorithms from a computer scientist's perspective, we discuss a set of basic algorithms for Quantum Machine Learning, which are the fundamental components for Quantum Machine Learning algorithms. We implement the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance to that of its classical counterpart, the Convolutional Neural Networks (CNNs). Additionally, we implement the QSVM on the breast cancer dataset and compare it to the classical SVM. Finally, we implement the Variational Quantum Classifier (VQC) and many classical classifiers on the Iris dataset to compare their accuracies.
Collapse
Affiliation(s)
- Amine Zeguendry
- Laboratoire d’Ingénierie des Systèmes d’Information, Faculty of Sciences, Cadi Ayyad University, Marrakech 40000, Morocco
| | - Zahi Jarir
- Laboratoire d’Ingénierie des Systèmes d’Information, Faculty of Sciences, Cadi Ayyad University, Marrakech 40000, Morocco
| | - Mohamed Quafafou
- Laboratoire des Sciences de l’Information et des Systèmes, Unité Mixte de Recherche 7296, Aix-Marseille University, 13007 Marseille, France
| |
Collapse
|
6
|
de Carvalho JH, de Souza LS, de Paula Neto FM, Ferreira TA. On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2022.11.142] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/11/2022]
|
7
|
Niu MY, Zlokapa A, Broughton M, Boixo S, Mohseni M, Smelyanskyi V, Neven H. Entangling Quantum Generative Adversarial Networks. PHYSICAL REVIEW LETTERS 2022; 128:220505. [PMID: 35714256 DOI: 10.1103/physrevlett.128.220505] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 07/23/2021] [Revised: 03/21/2022] [Accepted: 05/12/2022] [Indexed: 06/15/2023]
Abstract
Generative adversarial networks (GANs) are one of the most widely adopted machine learning methods for data generation. In this work, we propose a new type of architecture for quantum generative adversarial networks (an entangling quantum GAN, EQ-GAN) that overcomes limitations of previously proposed quantum GANs. Leveraging the entangling power of quantum circuits, the EQ-GAN converges to the Nash equilibrium by performing entangling operations between both the generator output and true quantum data. In the first multiqubit experimental demonstration of a fully quantum GAN with a provably optimal Nash equilibrium, we use the EQ-GAN on a Google Sycamore superconducting quantum processor to mitigate uncharacterized errors, and we numerically confirm successful error mitigation with simulations up to 18 qubits. Finally, we present an application of the EQ-GAN to prepare an approximate quantum random access memory and for the training of quantum neural networks via variational datasets.
Collapse
Affiliation(s)
| | - Alexander Zlokapa
- Google AI Quantum, Venice, California 90291, USA
- Division of Physics, Mathematics and Astronomy, Caltech, Pasadena, California 91125, USA
- Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA
| | | | - Sergio Boixo
- Google AI Quantum, Venice, California 90291, USA
| | | | | | | |
Collapse
|
8
|
|
9
|
Xianduo S, Xin W, Yuyuan S, Xianglin Z, Ying W. Hierarchical recurrent neural networks for graph generation. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2021.12.073] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
10
|
Nakaji K, Yamamoto N. Quantum semi-supervised generative adversarial network for enhanced data classification. Sci Rep 2021; 11:19649. [PMID: 34608219 PMCID: PMC8490428 DOI: 10.1038/s41598-021-98933-6] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/06/2021] [Accepted: 09/16/2021] [Indexed: 11/09/2022] Open
Abstract
In this paper, we propose the quantum semi-supervised generative adversarial network (qSGAN). The system is composed of a quantum generator and a classical discriminator/classifier (D/C). The goal is to train both the generator and the D/C, so that the latter may get a high classification accuracy for a given dataset. Hence the qSGAN needs neither any data loading nor to generate a pure quantum state, implying that qSGAN is much easier to implement than many existing quantum algorithms. Also the generator can serve as a stronger adversary than a classical one thanks to its rich expressibility, and it is expected to be robust against noise. These advantages are demonstrated in a numerical simulation.
Collapse
Affiliation(s)
- Kouhei Nakaji
- Department of Applied Physics and Physico-Informatics and Quantum Computing Center, Keio University, Hiyoshi 3-14-1, Kohoku, Yokohama, 223-8522, Japan.
| | - Naoki Yamamoto
- Department of Applied Physics and Physico-Informatics and Quantum Computing Center, Keio University, Hiyoshi 3-14-1, Kohoku, Yokohama, 223-8522, Japan
| |
Collapse
|
11
|
Acampora G, Vitiello A. Implementing evolutionary optimization on actual quantum processors. Inf Sci (N Y) 2021. [DOI: 10.1016/j.ins.2021.06.049] [Citation(s) in RCA: 9] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
|
12
|
Leadbeater C, Sharrock L, Coyle B, Benedetti M. F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits. ENTROPY (BASEL, SWITZERLAND) 2021; 23:1281. [PMID: 34682005 PMCID: PMC8534817 DOI: 10.3390/e23101281] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 09/07/2021] [Revised: 09/27/2021] [Accepted: 09/28/2021] [Indexed: 11/16/2022]
Abstract
Generative modelling is an important unsupervised task in machine learning. In this work, we study a hybrid quantum-classical approach to this task, based on the use of a quantum circuit born machine. In particular, we consider training a quantum circuit born machine using f-divergences. We first discuss the adversarial framework for generative modelling, which enables the estimation of any f-divergence in the near term. Based on this capability, we introduce two heuristics which demonstrably improve the training of the born machine. The first is based on f-divergence switching during training. The second introduces locality to the divergence, a strategy which has proved important in similar applications in terms of mitigating barren plateaus. Finally, we discuss the long-term implications of quantum devices for computing f-divergences, including algorithms which provide quadratic speedups to their estimation. In particular, we generalise existing algorithms for estimating the Kullback-Leibler divergence and the total variation distance to obtain a fault-tolerant quantum algorithm for estimating another f-divergence, namely, the Pearson divergence.
Collapse
Affiliation(s)
- Chiara Leadbeater
- Cambridge Quantum Computing Limited, London SW1E 6DR, UK; (C.L.); (L.S.); (B.C.)
| | - Louis Sharrock
- Cambridge Quantum Computing Limited, London SW1E 6DR, UK; (C.L.); (L.S.); (B.C.)
- Department of Mathematics, Imperial College London, London SW7 2AZ, UK
| | - Brian Coyle
- Cambridge Quantum Computing Limited, London SW1E 6DR, UK; (C.L.); (L.S.); (B.C.)
- School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, UK
| | - Marcello Benedetti
- Cambridge Quantum Computing Limited, London SW1E 6DR, UK; (C.L.); (L.S.); (B.C.)
| |
Collapse
|
13
|
Chang SY, Herbert S, Vallecorsa S, Combarro EF, Duncan R. Dual-Parameterized Quantum Circuit GAN Model in High Energy Physics. EPJ WEB OF CONFERENCES 2021. [DOI: 10.1051/epjconf/202125103050] [Citation(s) in RCA: 8] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/14/2022] Open
Abstract
Generative models, and Generative Adversarial Networks (GAN) in particular, are being studied as possible alternatives to Monte Carlo simulations. It has been proposed that, in certain circumstances, simulation using GANs can be sped-up by using quantum GANs (qGANs).
We present a new design of qGAN, the dual-Parameterized Quantum Circuit (PQC) GAN, which consists of a classical discriminator and two quantum generators which take the form of PQCs. The first PQC learns a probability distribution over N-pixel images, while the second generates normalized pixel intensities of an individual image for each PQC input.
With a view to HEP applications, we evaluated the dual-PQC architecture on the task of imitating calorimeter outputs, translated into pixelated images. The results demonstrate that the model can reproduce a fixed number of images with a reduced size as well as their probability distribution and we anticipate it should allow us to scale up to real calorimeter outputs.
Collapse
|