Abstract We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits—encoded in the states of artificial atoms with no direct coupling—interacting via a common single-mode driven microwave resonator. The qubit-resonator couplings are assumed to be in the resonant regime and tunable in time. A genetic algorithm is used in order to find the functional time-dependence of the couplings that optimise the fidelity between the evolved state and a variety of targets, including three-qubit GHZ and Dicke states and four-qubit graph states. We observe high quantum fidelities (above 0.96 in the worst case setting of a system of effective dimension 96), fast preparation times, and resilience to noise, despite the algorithm being trained in the ideal noise-free setting. These results show that the genetic algorithms represent an effective approach to control quantum systems of large dimensions.
Abstract We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits—encoded in the states of artificial atoms with no direct coupling—interacting via a common single-mode driven microwave resonator. The qubit-resonator couplings are assumed to be in the resonant regime and tunable in time. A genetic algorithm is used in order to find the functional time-dependence of the couplings that optimise the fidelity between the evolved state and a variety of targets, including three-qubit GHZ and Dicke states and four-qubit graph states. We observe high quantum fidelities (above 0.96 in the worst case setting of a system of effective dimension 96), fast preparation times, and resilience to noise, despite the algorithm being trained in the ideal noise-free setting. These results show that the genetic algorithms represent an effective approach to control quantum systems of large dimensions.
Abstract The quantum autoencoder is a recent paradigm in the field of quantum machine learning, which may enable an enhanced use of resources in quantum technologies. To this end, quantum neural networks with less nodes in the inner than in the outer layers were considered. Here, we propose a useful connection between quantum autoencoders and quantum adders, which approximately add two unknown quantum states supported in different quantum systems. Specifically, this link allows us to employ optimized approximate quantum adders, obtained with genetic algorithms, for the implementation of quantum autoencoders for a variety of initial states. Furthermore, we can also directly optimize the quantum autoencoders via genetic algorithms. Our approach opens a different path for the design of quantum autoencoders in controllable quantum platforms.
Designing quantum circuits is a major challenge due to their sensitivity to noise and the complexity of quantum logic. This paper presents an evolutionary algorithm that balances multiple design criteria, namely fidelity and circuit depth, by combining them into a single scalarised fitness function. This approach enables efficient optimisation while avoiding the computational cost of fully multi-objective methods. A novel circuit representation and set of noise-aware genetic operators are introduced, and the technique is applied to evolve implementations of the Quantum Fourier Transform (QFT) for two- and three-qubit systems. Experimental results show that evolved circuits match or exceed ideal fidelity and outperform textbook QFT implementations under simulated noise. These findings highlight the potential of hardware-aware evolutionary design for producing circuits that are both accurate and resilient on near-term quantum hardware.
Methods of optimal control are applied to a model system of interacting two-level particles (e.g., spin-half atomic nuclei or electrons or two-level atoms) to produce high-fidelity quantum gates while simultaneously negating the detrimental effect of decoherence. One set of particles functions as the quantum information processor, whose evolution is controlled by a time-dependent external field. The other particles are not directly controlled and serve as an effective environment, coupling to which is the source of decoherence. The control objective is to generate target one- and two-qubit unitary gates in the presence of strong environmentally-induced decoherence and under physically motivated restrictions on the control field. The quantum-gate fidelity, expressed in terms of a novel state-independent distance measure, is maximized with respect to the control field using combined genetic and gradient algorithms. The resulting high-fidelity gates demonstrate the feasibility of precisely guiding the quantum evolution via optimal control, even when the system complexity is exacerbated by environmental coupling. It is found that the gate duration has an important effect on the control mechanism and resulting fidelity. An analysis of the sensitivity of the gate performance to random variations in the system parameters reveals a significant degree of robustness attained by the optimal control solutions.
Abstract We investigate the optimization of graph topologies for quantum sensing networks designed to estimate weak magnetic fields. The sensors are modeled as spin systems governed by a transverse-field Ising Hamiltonian in thermal equilibrium at low temperatures. Using a genetic algorithm (GA), we evolve network topologies to maximize a perturbative spectral sensitivity measure, which serves as the fitness function for the GA. For the best-performing graphs, we compute the corresponding quantum Fisher information (QFI) to assess the ultimate bounds on estimation precision. To enable efficient scaling, we use the GA-generated data to train a deep neural network, allowing extrapolation to larger graph sizes where direct computation becomes prohibitive. Our results show that while both the fitness function and QFI initially increase with system size, the QFI exhibits a clear non-monotonic behavior—saturating and eventually declining beyond a critical graph size. This reflects the loss of superlinear scaling of the QFI, as the narrowing of the energy gap signals a crossover to classical scaling of the QFI with system size. The effect is reminiscent of the microeconomic law of diminishing returns: beyond an optimal graph size, further increases yield reduced sensing performance. This saturation and decline in precision are particularly pronounced under Kac scaling, where both the QFI and spin squeezing plateau or degrade with increasing system size. We also attribute observed even–odd oscillations in the spectral sensitivity measure and QFI to quantum interference effects in spin phase space, as confirmed by our phase-space analysis. These findings highlight the critical role of optimizing interaction topology—rather than simply increasing network size—and demonstrate the potential of hybrid evolutionary and learning-based approaches for designing high-performance quantum sensors.
ABSTRACT This work proposes a Quantum Enhanced Genetic Algorithm (QEGA) that synergistically integrates three quantum‐inspired operators: a Grover adaptive search‐based selection mechanism, a swap test‐guided crossover scheme, and a quantum walk‐driven mutation process. By harnessing quantum amplitude amplification, entanglement recombination, and probabilistic exploration, QEGA pioneers the integration of quantum computational advantages into evolutionary optimization for quantum neural network parameters. The algorithm enhances global search effectiveness while accelerating convergence and exhibiting robust resistance to local optima. Experimental results on three benchmark datasets, i.e., Iris, the plane point set, and MNIST binary classification, demonstrate that QEGA outperforms classical genetic algorithms and quantum optimization algorithms from recent studies by a substantial margin on classification tasks. Specifically, it attains a peak accuracy of 98.67%, 99.16%, and 98.00% on the three datasets, respectively, accompanied by consistently smooth and monotonic convergence behaviors across the evaluated trials. These findings validate QEGA's potential as a versatile optimization framework for quantum neural network training and highlight the broader promise of quantum‐enhanced evolutionary computation in practical machine learning applications.
In recent years, control methods based on different optimization techniques have shed light on the possibilities of processing information in many quantum systems. When exploring the transmission of quantum states, faster transmission times are mandatory to avoid the deleterious effects of multiple sources of decoherence that spoil the transmission process. In particular, using Reinforcement Learning to devise sequences of step-wise external controls provides good transfer policies at short transmission times. We present two approaches to control the transmission of quantum states in qubit chains using external controls to force the dynamical evolution of the chain state. The first approach relies on the well-known Genetic Algorithm to generate a sequence of external controls, while the second approach uses a variant of Reinforcement Learning. The Genetic algorithm achieves excellent transmission fidelity at as short transmission times as Reinforcement Learning, surpassing the fidelities achieved by the latter method. Nevertheless, the Reinforcement Learning method offers robust control policies when the control pulses are noisy enough, owing to an imperfect timing of the pulses, deficient control devices, or other sources of phase decoherence. We present the regime where each method is best suited to control the transmission of arbitrary qubit states.