We show that the Quantum Generative Adversarial Network (QGAN) paradigm can be employed by an adversary to learn generating data that deceives the monitoring of a Cyber- Physical System (CPS) and to perpetrate a covert attack. As a test case, the ideas are elaborated considering the navigation data of a Micro Aerial Vehicle (MAV). A concrete QGAN design is proposed to generate fake MAV navigation data. Initially, the adversary is entirely ignorant about the dynamics of the CPS, the strength of the approach from the point of view of the bad guy. A design is also proposed to discriminate between genuine and fake MAV navigation data. The designs combine classical optimization, qubit quantum computing and photonic quantum computing. Using the PennyLane software simulation, they are evaluated over a classical computing platform. We assess the learning time and accuracy of the navigation data generator and discriminator versus space complexity, i.e., the amount of quantum memory needed to solve the problem.
We show that the Quantum Generative Adversarial Network (QGAN) paradigm can be employed by an adversary to learn generating data that deceives the monitoring of a Cyber- Physical System (CPS) and to perpetrate a covert attack. As a test case, the ideas are elaborated considering the navigation data of a Micro Aerial Vehicle (MAV). A concrete QGAN design is proposed to generate fake MAV navigation data. Initially, the adversary is entirely ignorant about the dynamics of the CPS, the strength of the approach from the point of view of the bad guy. A design is also proposed to discriminate between genuine and fake MAV navigation data. The designs combine classical optimization, qubit quantum computing and photonic quantum computing. Using the PennyLane software simulation, they are evaluated over a classical computing platform. We assess the learning time and accuracy of the navigation data generator and discriminator versus space complexity, i.e., the amount of quantum memory needed to solve the problem.
Generative adversarial networks represent a powerful tool for classical machine learning: a generator tries to create statistics for data that mimics those of a true data set, while a discriminator tries to discriminate between the true and fake data. The learning process for generator and discriminator can be thought of as an adversarial game, and under reasonable assumptions, the game converges to the point where the generator generates the same statistics as the true data and the discriminator is unable to discriminate between the true and the generated data. This Letter introduces the notion of quantum generative adversarial networks, where the data consist either of quantum states or of classical data, and the generator and discriminator are equipped with quantum information processors. We show that the unique fixed point of the quantum adversarial game also occurs when the generator produces the same statistics as the data. Neither the generator nor the discriminator perform quantum tomography; linear programing drives them to the optimal. Since quantum systems are intrinsically probabilistic, the proof of the quantum case is different from-and simpler than-the classical case. We show that, when the data consist of samples of measurements made on high-dimensional spaces, quantum adversarial networks may exhibit an exponential advantage over classical adversarial networks.
Quantum Generative Adversarial Network (qGAN) intends to incorporate all the core developing quantum computing ideas into a quantum-classical hybrid architecture. With an idea of constructing a qGAN, the whole process uses parameterized quantum circuits as generators and classical neural networks as discriminators to learn complex probability distributions from data, in high-dimensional again for examples in housing data or physics simulations. The generator makes use of quantum states to encode the data samples facilitating exploration optimally through phenomenona, such as entanglement and superposition, with, for instance, possible combinations of housing states replicating the underlying statistics of high-dimensional data sets, such the ones present in housing data or physics simulations, while for the discriminator estimating validity for samples generated by the generator. Herewith adversarial training, the parameters of the generator will tend to be adapted iteratively producing data that does not differ in any way from actual samples in obtaining models made of superposition and extension entanglement. The method combines quantum toolkits such as Qiskit with classical technologies like PyTorch to investigate whether there is any benefit with respect to quantum capabilities for generative modeling tasks. In spite of the other difficulties such as limited hardware and the complication of gradient computations, these qGANs are expected to improve generative models for applications from generating synthetic data to simulating high-energy physics.
Quantum computing changes the way computational problems can be solved by taking advantage of special qubit features such as superposition and entanglement. Owing to these features, a quantum computer can efficiently search through a large amount of solution space and therefore tackle problems that are otherwise too hard for classical computers. In the field of quantum machine learning (QML), Quantum Generative Adversarial Networks (QGANs) are coming to the forefront as a very productive area. QGANs are based on the experimentally successful classical Generative Adversarial Networks (GANs) and, therefore, utilize an adversarial approach, where a generator competes with a discriminator. The data-synthesizing unit called the generator tries to generate data samples that are statistically similar to the actual data, while the discriminator tries to tell the real data apart from any artificially created data samples. Such layers of adversarial-tuned feedback culminate in the improvement of the generator in making realistic simulated data. Even though a considerable amount of research is already published that substantiates the numerous prospects of quantum computing but still the practical implementation of it seems hypothetical. Even so, QGANs are likely to revolutionize many fields by making it possible to synthesize new and fascinating complex realistic data. This review work aims to serve as a valuable resource for researchers and practitioners interested in understanding the exciting field of QGANs and their potential contributions to the broader landscape of quantum machine learning.
Adversarial learning represents a powerful technique for generating data statistics. Its successful implementation in quantum computational platforms is not straightforward due to limitations in connectivity, quantum operation fidelity, and limited access to the quantum processor for statistically relevant results. Constraining the number of quantum operations and providing a design with a low compilation cost, we propose a quantum generative adversarial network design that uses real Hilbert spaces as the framework for the generative model and a novel strategy to encode classical information into the quantum framework. We consider quantum generator and discriminator architectures based on a variational quantum circuit. We encode classical information by the stereographic projection, which allows us to use the entire classical domain without normalization procedures. For low-depth ansätze designs, we consider the real Hilbert space as the working space for the quantum adversarial game. This architecture improves state-of-the-art quantum generative adversarial performance while maintaining a shallow-depth quantum circuit and a reduced parameter set. We tested our design in a low resource regime, generating handwritten digits with the MNIST as the reference dataset. We could generate undetected data (digits) with just 15 epochs working in the real Hilbert space of 2, 3, and 4 qubits. Our design uses native quantum operations established in superconducting-based quantum processors and is compatible with ion-trapped-based architectures.
Abstract Quantum generative adversarial networks (QGANs) have been studied in the context of quantum machine learning for several years, but there has not been yet a proposal for a fully QGAN with both, a quantum generator and discriminator. We introduce a fully QGAN intended for use with binary data. The architecture incorporates several features found in other classical and quantum machine learning models, which up to this point had not been used in conjunction. In particular, we incorporate classical noise reuploading in the generator, auxiliary qubits in the discriminator to enhance expressivity, and a direct connection between the generator and discriminator circuits, obviating the need to access the generator’s probability distribution. We show that, as separate components, the generator and discriminator perform as desired. We empirically demonstrate the expressive power of our model on both synthetic data as well as low energy states of an Ising model. Our demonstrations suggest that the model is not only capable of reproducing discrete training data, but also of potentially generalizing from it.
This paper investigates the application of Quantum Generative Adversarial Networks (QGANs) to data augmentation for machine learning. Traditional Generative Adversarial Networks (GANs) rely on classical neural networks, while this research explores leveraging quantum circuits as generators within a QGAN architecture. The core idea is to train a quantum generator to produce synthetic data samples, supplementing existing datasets with novel instances. The discriminator remains a classical neural network, tasked with distinguishing between real and generated data. We present a theoretical framework for this approach, outlining the mathematical formulation and key components. Specifically, we introduce the notation (x, s_1, s_2, ..., s_K) to represent data samples, generator states, and relevant parameters. The objective function for the QGAN is defined as minimizing the Jensen-Shannon divergence between the real and generated data distributions. The effectiveness of this approach is discussed, highlighting potential advantages and challenges. This work contributes to the emerging field of quantum machine learning and offers a novel strategy for improving the performance of machine learning models, particularly in scenarios with limited training data.