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:2108.03351 · Quantum Science and Technology

Universal quantum state preparation via revised greedy algorithm

Run-Hong He, Hai-Da Liu, Shengbin Wang, Jing Wu, Shen-Shuang Nie, Zhao-Ming Wang

Published Aug 16, 2021• 8 citations
arXivHTMLPDF

Abstract

Abstract Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum state. However, the standard greedy (SG) algorithm, in general, cannot take the global maxima and instead becomes stuck on a local maxima. Based on the SG algorithm, in this paper we propose a revised version to design dynamic pulses to realize universal quantum state preparation, i.e. preparing an arbitrary state from another arbitrary one. As applications, we implement this scheme to the universal preparation of single- and two-qubit state in the context of semiconductor quantum dots and superconducting circuits. Evaluation results show that our scheme outperforms the alternative numerical optimizations with higher preparation quality while possesses the comparable high efficiency. Compared with the emerging machine learning, it shows better accessibility and does not require any training. Moreover, the numerical results show that the pulse sequences generated by our scheme are robust against various errors and noises. Our scheme opens a new avenue of optimization in few-level system and limited action space quantum control problems.

DOI
10.1088/2058-9565/ac1dfe

Related papers

Deep reinforcement learning for universal quantum state preparation via dynamic pulse control

Run-Hong He, Rui Wang, Shen-Shuang Nie +3 more

Abstract Accurate and efficient preparation of quantum state is a core issue in building a quantum computer. In this paper, we investigate how to prepare a certain single- or two-qubit target state from arbitrary initial states in semiconductor double quantum dots with only a few discrete control pulses by leveraging the deep reinforcement learning. Our method is based on the training of the network over numerous preparing tasks. The results show that once the network is well trained, it works for any initial states in the continuous Hilbert space. Thus repeated training for new preparation tasks is avoided. Our scheme outperforms the traditional optimization approaches based on gradient with both the higher efficiency and the preparation quality in discrete control space. Moreover, we find that the control trajectories designed by our scheme are robust against stochastic fluctuations within certain thresholds, such as the charge and nuclear noises.

arXiv:2012.00326•EPJ Quantum Technology•Dec 1, 2021•31 citations

Enhanced quantum state preparation via stochastic predictions of neural networks

Chaochao Li, Run-Hong He, Zhao-Ming Wang

In pursuit of enhancing the prediction capabilities of neural networks, it has been a longstanding objective to create datasets encompassing a diverse array of samples. The purpose is to broaden the horizons of the neural network and continually strive for improved prediction accuracy during the training process, which serves as the ultimate evaluation metric. However, in this paper, we explore an intriguing avenue for enhancing algorithm effectiveness through exploiting the knowledge blindness of the neural network. Our approach centers around a machine learning algorithm utilized for preparing arbitrary quantum states in a semiconductor double quantum dot system, a system characterized by highly constrained control degrees of freedom. We artificially define the characteristics of local optima in the state preparation task. When the optimization falls into a local optimum, disturbances are introduced through stochastic prediction, which gives a chance to escape from the local optimum. Notably, unlike previous methodologies that employ reinforcement learning to identify pulse patterns, we adopt a training approach akin to supervised learning, using it to dynamically design the pulse sequence. This approach has broad applicability and improves the efficiency of the algorithm.

arXiv:2307.14715•Physical Review A•Nov 17, 2023•9 citations

Arbitrary quantum states preparation aided by deep reinforcement learning

Zhaowei Wang, Zhao-Ming Wang

Abstract The preparation of quantum states is essential in the realm of quantum information processing, and the development of efficient methodologies can significantly alleviate the strain on quantum resources. Under the framework of deep reinforcement learning (DRL), we integrate the initial and the target state information within the state preparation task together, so as to realize the control trajectory design between two arbitrary quantum states. Taking a semiconductor double quantum dots (DQDs) model as an example, our results demonstrate that the resulting control trajectories can effectively achieve arbitrary quantum state preparation (AQSP) for both single-qubit and two-qubit systems, with average fidelities of 0.9868 and 0.9556 for the test sets, respectively. For the DQDs, charge and nuclear noises will exist, thus decreases the average fidelity of AQSP. We have also incorporated noise amplitude as an input feature in the training process, leading to the development of noise-aware models. The control trajectories designed by these models can effectively suppress the influence of noise. Our research validates the effectiveness of DRL in quantum state preparation and offers solutions for multi-initial and multi-objective quantum control tasks, with potential for broader application in quantum control problems.

arXiv:2407.16368•Physica Scripta•Feb 26, 2025•7 citations

Adaptive denoising quantum state preparation in a dynamic environment

Zhao-Ming Wang, Tuo-Zhi Chen

Quantum state preparation (QSP) is an essential step in many quantum information processing tasks and has been deeply studied in a closed system. However, environmental noise inevitably destroys the quantumness of the system, resulting in decreased fidelity. In this work, we investigate the enhancement of fidelity by pulse control for arbitrary single or two-qubit QSP in a noisy environment. The control pulses are designed by leveraging supervised learning. The environment is modeled as a collection of bosons, and we use the quantum state diffusion equation technique to deal with the dynamics of the system. We consider two types of noise: quasistatic noise and dynamic noise. We propose active and adaptive denoising schemes for the quasistatic and dynamic noise, respectively. The environmental parameters are required to construct the dataset when training the neural network (NN) in adaptive denoising, while they are not needed in active denoising. The adaptive denoising scheme is universal in that it can be effectively applied to both quasistatic and dynamic noises. High-fidelity QSP has been obtained by the well-trained NN. Our work demonstrates that machine learning has great potential in optimal pulse design in a dynamic environment. Published by the American Physical Society 2024

Physical Review Research•Nov 25, 2024•5 citations

A Quantum States Preparation Method Based on Difference-Driven Reinforcement Learning

Wenjie Liu, Jing Xu, Bosi Wang

Due to the large state space of the two-qubit system, and the adoption of ladder reward function in the existing quantum state preparation methods, the convergence speed is slow and it is difficult to prepare the desired target quantum state with high fidelity under limited conditions. To solve the above problems, a difference-driven reinforcement learning (RL) algorithm for quantum state preparation of two-qubit system is proposed by improving the reward function and action selection strategy. Firstly, a model is constructed for the problem of preparing quantum states of a two-qubit system, with restrictions on the type of quantum gates and the time for quantum state evolution. In the preparation process, a weighted differential dynamic reward function is designed to assist the algorithm quickly obtain the maximum expected cumulative reward. Then, an adaptive [Formula: see text]-greedy action selection strategy is adopted to achieve a balance between exploration and utilization to a certain extent, thereby improving the fidelity of the final quantum state. The simulation results show that the proposed algorithm can prepare quantum state with high fidelity under limited conditions. Compared with other algorithms, it has different degrees of improvement in convergence speed and fidelity of the final quantum state.

arXiv:2309.16972•SPIN•May 19, 2023•5 citations

Machine Learning for Designing Fast Quantum Gates

Ehsan Zahedinejad

Fault-tolerant quantum computing requires encoding the quantum information into logical qubits and performing the quantum information processing in a code-space. Quantum error correction codes, then, can be employed to diagnose and remove the possible errors in the quantum information, thereby avoiding the loss of information. Although a series of single- and two-qubit gates can be employed to construct a quantum error correcting circuit, however this decomposition approach is not practically desirable because it leads to circuits with long operation times. An alternative approach to designing a fast quantum circuit is to design quantum gates that act on a multi-qubit gate. Here I devise quantum control schemes to design high-fidelity single-shot multi-qubit (up to three) quantum gates. Quantum control task is to steer quantum dynamics towards closely realizing specific quantum operation by varying the external control parameters (external field) such that the resultant evolution closely approximates the desired evolution. A set of instructions that determines the control parameters, and hence the effectiveness of the control scheme, is called a policy. Machine learning algorithms can be employed to find successful policies for designing quantum gates. In particular, we employ supervised machine learning techniques to generate these successful policies. Finding successful policies is a feasibility problem for which optimization algorithms can be employed. Greedy algorithms are at the heart of machine learning techniques. They converge faster onto a successful policy and require less-computational resource than non-greedy algorithms. However, there is no guarantee that greedy algorithms succeed to a feasible solution when there exist constraints on i) gate operation time ii) computational resources, and iii) experimental resources. Our results show the failure of standard greedy machine learning algorithms and the superiority of non-greedy machine learning algorithms over greedy ones for designing quantum logic gates, when there exist constraints on the quantum system. We have also observed the failure of existing greedy and non-greedy techniques for designing high-fidelity three-qubit gates. Hence, we devised our machine learning technique called Subspace-Selective Self-adaptive Differential Evolution (SuSSADE). Each three-qubit gate designed by SuSSADE operates as fast as an entangling two-qubit gate under the same experimental constraints.

•Jan 1, 2016•0 citations
Abstract Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum state. However, the standard greedy (SG) algorithm, in general, cannot take the global maxima and instead becomes stuck on a local maxima. Based on the SG algorithm, in this paper we propose a revised version to design dynamic pulses to realize universal quantum state preparation, i.e. preparing an arbitrary state from another arbitrary one. As applications, we implement this scheme to the universal preparation of single- and two-qubit state in the context of semiconductor quantum dots and superconducting circuits. Evaluation results show that our scheme outperforms the alternative numerical optimizations with higher preparation quality while possesses the comparable high efficiency. Compared with the emerging machine learning, it shows better accessibility and does not require any training. Moreover, the numerical results show that the pulse sequences generated by our scheme are robust against various errors and noises. Our scheme opens a new avenue of optimization in few-level system and limited action space quantum control problems.
Abstract Accurate and efficient preparation of quantum state is a core issue in building a quantum computer. In this paper, we investigate how to prepare a certain single- or two-qubit target state from arbitrary initial states in semiconductor double quantum dots with only a few discrete control pulses by leveraging the deep reinforcement learning. Our method is based on the training of the network over numerous preparing tasks. The results show that once the network is well trained, it works for any initial states in the continuous Hilbert space. Thus repeated training for new preparation tasks is avoided. Our scheme outperforms the traditional optimization approaches based on gradient with both the higher efficiency and the preparation quality in discrete control space. Moreover, we find that the control trajectories designed by our scheme are robust against stochastic fluctuations within certain thresholds, such as the charge and nuclear noises.
In pursuit of enhancing the prediction capabilities of neural networks, it has been a longstanding objective to create datasets encompassing a diverse array of samples. The purpose is to broaden the horizons of the neural network and continually strive for improved prediction accuracy during the training process, which serves as the ultimate evaluation metric. However, in this paper, we explore an intriguing avenue for enhancing algorithm effectiveness through exploiting the knowledge blindness of the neural network. Our approach centers around a machine learning algorithm utilized for preparing arbitrary quantum states in a semiconductor double quantum dot system, a system characterized by highly constrained control degrees of freedom. We artificially define the characteristics of local optima in the state preparation task. When the optimization falls into a local optimum, disturbances are introduced through stochastic prediction, which gives a chance to escape from the local optimum. Notably, unlike previous methodologies that employ reinforcement learning to identify pulse patterns, we adopt a training approach akin to supervised learning, using it to dynamically design the pulse sequence. This approach has broad applicability and improves the efficiency of the algorithm.
Abstract The preparation of quantum states is essential in the realm of quantum information processing, and the development of efficient methodologies can significantly alleviate the strain on quantum resources. Under the framework of deep reinforcement learning (DRL), we integrate the initial and the target state information within the state preparation task together, so as to realize the control trajectory design between two arbitrary quantum states. Taking a semiconductor double quantum dots (DQDs) model as an example, our results demonstrate that the resulting control trajectories can effectively achieve arbitrary quantum state preparation (AQSP) for both single-qubit and two-qubit systems, with average fidelities of 0.9868 and 0.9556 for the test sets, respectively. For the DQDs, charge and nuclear noises will exist, thus decreases the average fidelity of AQSP. We have also incorporated noise amplitude as an input feature in the training process, leading to the development of noise-aware models. The control trajectories designed by these models can effectively suppress the influence of noise. Our research validates the effectiveness of DRL in quantum state preparation and offers solutions for multi-initial and multi-objective quantum control tasks, with potential for broader application in quantum control problems.
Quantum state preparation (QSP) is an essential step in many quantum information processing tasks and has been deeply studied in a closed system. However, environmental noise inevitably destroys the quantumness of the system, resulting in decreased fidelity. In this work, we investigate the enhancement of fidelity by pulse control for arbitrary single or two-qubit QSP in a noisy environment. The control pulses are designed by leveraging supervised learning. The environment is modeled as a collection of bosons, and we use the quantum state diffusion equation technique to deal with the dynamics of the system. We consider two types of noise: quasistatic noise and dynamic noise. We propose active and adaptive denoising schemes for the quasistatic and dynamic noise, respectively. The environmental parameters are required to construct the dataset when training the neural network (NN) in adaptive denoising, while they are not needed in active denoising. The adaptive denoising scheme is universal in that it can be effectively applied to both quasistatic and dynamic noises. High-fidelity QSP has been obtained by the well-trained NN. Our work demonstrates that machine learning has great potential in optimal pulse design in a dynamic environment. Published by the American Physical Society 2024
Due to the large state space of the two-qubit system, and the adoption of ladder reward function in the existing quantum state preparation methods, the convergence speed is slow and it is difficult to prepare the desired target quantum state with high fidelity under limited conditions. To solve the above problems, a difference-driven reinforcement learning (RL) algorithm for quantum state preparation of two-qubit system is proposed by improving the reward function and action selection strategy. Firstly, a model is constructed for the problem of preparing quantum states of a two-qubit system, with restrictions on the type of quantum gates and the time for quantum state evolution. In the preparation process, a weighted differential dynamic reward function is designed to assist the algorithm quickly obtain the maximum expected cumulative reward. Then, an adaptive [Formula: see text]-greedy action selection strategy is adopted to achieve a balance between exploration and utilization to a certain extent, thereby improving the fidelity of the final quantum state. The simulation results show that the proposed algorithm can prepare quantum state with high fidelity under limited conditions. Compared with other algorithms, it has different degrees of improvement in convergence speed and fidelity of the final quantum state.
Fault-tolerant quantum computing requires encoding the quantum information into logical qubits and performing the quantum information processing in a code-space. Quantum error correction codes, then, can be employed to diagnose and remove the possible errors in the quantum information, thereby avoiding the loss of information. Although a series of single- and two-qubit gates can be employed to construct a quantum error correcting circuit, however this decomposition approach is not practically desirable because it leads to circuits with long operation times. An alternative approach to designing a fast quantum circuit is to design quantum gates that act on a multi-qubit gate. Here I devise quantum control schemes to design high-fidelity single-shot multi-qubit (up to three) quantum gates. Quantum control task is to steer quantum dynamics towards closely realizing specific quantum operation by varying the external control parameters (external field) such that the resultant evolution closely approximates the desired evolution. A set of instructions that determines the control parameters, and hence the effectiveness of the control scheme, is called a policy. Machine learning algorithms can be employed to find successful policies for designing quantum gates. In particular, we employ supervised machine learning techniques to generate these successful policies. Finding successful policies is a feasibility problem for which optimization algorithms can be employed. Greedy algorithms are at the heart of machine learning techniques. They converge faster onto a successful policy and require less-computational resource than non-greedy algorithms. However, there is no guarantee that greedy algorithms succeed to a feasible solution when there exist constraints on i) gate operation time ii) computational resources, and iii) experimental resources. Our results show the failure of standard greedy machine learning algorithms and the superiority of non-greedy machine learning algorithms over greedy ones for designing quantum logic gates, when there exist constraints on the quantum system. We have also observed the failure of existing greedy and non-greedy techniques for designing high-fidelity three-qubit gates. Hence, we devised our machine learning technique called Subspace-Selective Self-adaptive Differential Evolution (SuSSADE). Each three-qubit gate designed by SuSSADE operates as fast as an entangling two-qubit gate under the same experimental constraints.