Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.15375 · Physical review. E

Preparing spin squeezed states via adaptive genetic algorithm

Y. M. Zhao, L. B. Chen, W. Z. Zhang, Y. Wang, H. Y. Ma, X. L. Zhao

Published Dec 8, 2025• 0 citations
arXivHTMLPDF

Abstract

We introduce a strategy employing an adaptive genetic algorithm (GA) for iterative optimization of control sequences to generate quantum nonclassical states. Its efficacy is demonstrated by preparing spin squeezed states in an open collective spin model governed by a linear control field. Inspired by Darwinian evolution, the algorithm iteratively refines control sequences using crossover, mutation, and elimination strategies, starting from a coherent spin state within a dissipative and dephasing environment. We rigorously benchmark our method against constant control protocols and reinforcement learning, demonstrating competitive and robust performance. Furthermore, we showcase the GA's versatility by directly optimizing for metrologically relevant squeezing, achieving scalable performance, even in the presence of dissipation and thermal noise. The proposed strategy demonstrates a high state-preparation fidelity, exceeding 0.99, and provides a long time window for maintaining the spin squeezed state, even under dissipative conditions. We discuss feasible experimental implementations and potential extensions to alternative quantum systems, and the adaptability of the GA module. This research establishes the foundation for utilizing GA-like strategies in controlling quantum systems and achieving desired nonclassical states.

DOI
10.1103/grts-pv61

Related papers

A Strategy for Preparing Quantum Squeezed States Using Reinforcement Learning

Xiaolong Zhao, Yiming Zhao, Ming Li +4 more

Abstract A scheme leveraging reinforcement learning to engineer control fields for generating non‐classical states is proposed. It is exemplified by the application to prepare spin‐squeezed states for an open collective spin model where a linear control field is designed to govern the dynamics. The reinforcement learning agent determines the temporal sequence of control pulses, commencing from a coherent spin state in an environment characterized by dissipation and dephasing. Compared to the constant control scenario, this approach provides various control sequences maintaining collective spin squeezing and entanglement. It is observed that denser application of the control pulses enhances the performance of the outcomes. However, there is a minor enhancement in the performance by adding control actions. The proposed strategy demonstrates increased effectiveness for larger systems. Thermal excitations of the reservoir are detrimental to the control outcomes. Feasible experiments are suggested to implement this control proposal based on the comparison with the others. The extensions to continuous control problems and another quantum system are discussed. The replaceability of the reinforcement learning module is also emphasized. This research paves the way for its application in manipulating other quantum systems.

arXiv:2401.16320•Annalen der Physik•Jun 17, 2024•5 citations

Based on Genetic Algorithm for Quantum Circuit Optimization

Jincheng Zhang

This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---

•Sep 5, 2026•0 citations

Genetic AI Algorithms for Multi-Objective Optimization in Quantum Systems

Dr Chethan H N

Multi‐objective optimization in quantum systems poses formidable challenges stemming from the high dimensionality, complex constraints, and conflicting performance metrics inherent to quantum control tasks and circuit synthesis. This study presents a comprehensive exploration of genetic AI algorithms—evolutionary strategies inspired by natural selection—tailored specifically for multi‐objective optimization in quantum computing contexts. We propose a hybrid framework that synergistically combines the elitist, Pareto‐based selection mechanics of NSGA-II with quantum‐inspired crossover and mutation operators designed to preserve entanglement structures and exploit hardware‐specific gate sets. In this framework, candidate solutions encoding circuit topologies or control‐pulse parameters undergo iterative evolution, guided by fitness vectors that balance gate fidelity, circuit depth, and resource overhead. To benchmark performance, we apply the algorithm to canonical quantum computing problems: Fourier transform circuits, QAOA ansätze for MaxCut instances, and random Clifford+T circuits. Through extensive simulation on noise-modelled quantum devices, we evaluate Pareto front coverage, convergence speed, diversity maintenance, and robustness under decoherence. Our results demonstrate that the proposed genetic AI algorithm outperforms classical single‐objective genetic methods and established multi‐objective evolutionary algorithms (e.g., SPEA2) by achieving broader Pareto fronts and faster convergence rates, while maintaining solution diversity. Furthermore, noise-resilience experiments show graceful degradation, indicating practical applicability on near-term quantum hardware. These findings substantiate the potential of evolutionary computation paradigms—augmented with quantum‐inspired operators—to address the intricate trade-off surfaces that define NISQ-era optimization problems, paving the way toward automated quantum circuit design and control parameter tuning for real-world quantum computing applications.

World Journal of Future Technologies in Computer Science and Engineering•Jul 3, 2026•0 citations

Digital Quantum Algorithms for Generating and Utilizing Spin Squeezed States

Mingru Yang, Ruby Wei, Chao Yin

Spin squeezed states (SSSs) are conventionally viewed as analog resources for quantum metrology. Here we develop algorithms to efficiently generate and exploit SSSs on a digital quantum computer. We introduce an adaptive local-circuit protocol that prepares SSSs with squeezing parameter $ξ$ in depth $\mathrm{O}\left(\log{1/ξ}\right)$, yielding an exponential improvement over non-adaptive approaches. We prove that this depth is optimal for permutation symmetric SSSs by deriving a matching lower bound on entanglement entropy. We further leverage the squeezing paradigm to deterministically prepare the Dicke states using asymptotically fewer resources than prior methods. Remarkably, classical simulations of our preparation protocols under realistic noise models predicts a metrological gain of 4.2 dB beyond the standard quantum limit with 55 superconducting qubits in total including ancillae. Our work paves the way for performing quantum metrology on near-term digital quantum devices.

quant-pharXiv:2609.36004•Sep 30, 2026•0 citations

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

Jyoti Chaturvedi

The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.

International Journal of Computer Applications•Dec 18, 2014•3 citations

Generation and storage of spin squeezing via learning-assisted optimal control

Qing-Shou Tan, Mao Zhang, Yu Chen +2 more

The generation and storage of spin squeezing is an attractive topic in quantum metrology and the foundation of quantum mechanics. The major models to realize the spin squeezing are the one- and two-axis twisting models. Here, we consider a collective spin system coupled to a bosonic field, and show that proper constant-value controls in this model can simulate the dynamical behavior of these two models. More interestingly, a better performance of squeezing can be obtained when the control is time varying, which is generated via a reinforcement learning algorithm. However, this advantage becomes limited if the collective noise is involved. To deal with this, we propose a four-step strategy for the construction of a type of combined controls, which include both constant-value and time-varying controls, but performed at different time intervals. Compared to the full time-varying controls, the combined controls not only give a comparable minimum value of the squeezing parameter over time, but also provide a better lifetime and larger full amount of squeezing. Moreover, the amplitude form of a combined control is simpler and more stable than the full time-varying control. Therefore, our scheme is very promising to be applied in practice to improve the generation and storage performance of squeezing.

arXiv:2010.13444•Physical Review A•Mar 3, 2021•15 citations
We introduce a strategy employing an adaptive genetic algorithm (GA) for iterative optimization of control sequences to generate quantum nonclassical states. Its efficacy is demonstrated by preparing spin squeezed states in an open collective spin model governed by a linear control field. Inspired by Darwinian evolution, the algorithm iteratively refines control sequences using crossover, mutation, and elimination strategies, starting from a coherent spin state within a dissipative and dephasing environment. We rigorously benchmark our method against constant control protocols and reinforcement learning, demonstrating competitive and robust performance. Furthermore, we showcase the GA's versatility by directly optimizing for metrologically relevant squeezing, achieving scalable performance, even in the presence of dissipation and thermal noise. The proposed strategy demonstrates a high state-preparation fidelity, exceeding 0.99, and provides a long time window for maintaining the spin squeezed state, even under dissipative conditions. We discuss feasible experimental implementations and potential extensions to alternative quantum systems, and the adaptability of the GA module. This research establishes the foundation for utilizing GA-like strategies in controlling quantum systems and achieving desired nonclassical states.
Abstract A scheme leveraging reinforcement learning to engineer control fields for generating non‐classical states is proposed. It is exemplified by the application to prepare spin‐squeezed states for an open collective spin model where a linear control field is designed to govern the dynamics. The reinforcement learning agent determines the temporal sequence of control pulses, commencing from a coherent spin state in an environment characterized by dissipation and dephasing. Compared to the constant control scenario, this approach provides various control sequences maintaining collective spin squeezing and entanglement. It is observed that denser application of the control pulses enhances the performance of the outcomes. However, there is a minor enhancement in the performance by adding control actions. The proposed strategy demonstrates increased effectiveness for larger systems. Thermal excitations of the reservoir are detrimental to the control outcomes. Feasible experiments are suggested to implement this control proposal based on the comparison with the others. The extensions to continuous control problems and another quantum system are discussed. The replaceability of the reinforcement learning module is also emphasized. This research paves the way for its application in manipulating other quantum systems.
This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---
Multi‐objective optimization in quantum systems poses formidable challenges stemming from the high dimensionality, complex constraints, and conflicting performance metrics inherent to quantum control tasks and circuit synthesis. This study presents a comprehensive exploration of genetic AI algorithms—evolutionary strategies inspired by natural selection—tailored specifically for multi‐objective optimization in quantum computing contexts. We propose a hybrid framework that synergistically combines the elitist, Pareto‐based selection mechanics of NSGA-II with quantum‐inspired crossover and mutation operators designed to preserve entanglement structures and exploit hardware‐specific gate sets. In this framework, candidate solutions encoding circuit topologies or control‐pulse parameters undergo iterative evolution, guided by fitness vectors that balance gate fidelity, circuit depth, and resource overhead. To benchmark performance, we apply the algorithm to canonical quantum computing problems: Fourier transform circuits, QAOA ansätze for MaxCut instances, and random Clifford+T circuits. Through extensive simulation on noise-modelled quantum devices, we evaluate Pareto front coverage, convergence speed, diversity maintenance, and robustness under decoherence. Our results demonstrate that the proposed genetic AI algorithm outperforms classical single‐objective genetic methods and established multi‐objective evolutionary algorithms (e.g., SPEA2) by achieving broader Pareto fronts and faster convergence rates, while maintaining solution diversity. Furthermore, noise-resilience experiments show graceful degradation, indicating practical applicability on near-term quantum hardware. These findings substantiate the potential of evolutionary computation paradigms—augmented with quantum‐inspired operators—to address the intricate trade-off surfaces that define NISQ-era optimization problems, paving the way toward automated quantum circuit design and control parameter tuning for real-world quantum computing applications.
Spin squeezed states (SSSs) are conventionally viewed as analog resources for quantum metrology. Here we develop algorithms to efficiently generate and exploit SSSs on a digital quantum computer. We introduce an adaptive local-circuit protocol that prepares SSSs with squeezing parameter ξξξ in depth O(log⁡1/ξ)\mathrm{O}\left(\log{1/ξ}\right)O(log1/ξ), yielding an exponential improvement over non-adaptive approaches. We prove that this depth is optimal for permutation symmetric SSSs by deriving a matching lower bound on entanglement entropy. We further leverage the squeezing paradigm to deterministically prepare the Dicke states using asymptotically fewer resources than prior methods. Remarkably, classical simulations of our preparation protocols under realistic noise models predicts a metrological gain of 4.2 dB beyond the standard quantum limit with 55 superconducting qubits in total including ancillae. Our work paves the way for performing quantum metrology on near-term digital quantum devices.
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.
The generation and storage of spin squeezing is an attractive topic in quantum metrology and the foundation of quantum mechanics. The major models to realize the spin squeezing are the one- and two-axis twisting models. Here, we consider a collective spin system coupled to a bosonic field, and show that proper constant-value controls in this model can simulate the dynamical behavior of these two models. More interestingly, a better performance of squeezing can be obtained when the control is time varying, which is generated via a reinforcement learning algorithm. However, this advantage becomes limited if the collective noise is involved. To deal with this, we propose a four-step strategy for the construction of a type of combined controls, which include both constant-value and time-varying controls, but performed at different time intervals. Compared to the full time-varying controls, the combined controls not only give a comparable minimum value of the squeezing parameter over time, but also provide a better lifetime and larger full amount of squeezing. Moreover, the amplitude form of a combined control is simpler and more stable than the full time-varying control. Therefore, our scheme is very promising to be applied in practice to improve the generation and storage performance of squeezing.