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

AIP conference proceedings

Gradient ascent pulse engineering approach to CNOT gates in donor electron spin quantum computing

Dung-Bang Tsai, Hsi‐Sheng Goan, Hsi‐Sheng Goan, Yueh-Nan Chen

Published Jan 1, 2008• 4 citations
Publisher

Abstract

In this paper, we demonstrate how gradient ascent pulse engineering (GRAPE) optimal control methods can be implemented on donor electron spin qubits in semiconductors with an architecture complementary to the original Kane’s proposal. We focus on the high fidelity controlled‐NOT (CNOT) gate and we explicitly find the digitized control sequences for a controlled‐NOT gate by optimizing its fidelity using the effective, reduced donor electron spin Hamiltonian with external controls over the hyperfine A and exchange J interactions. We then simulate the CNOT‐gate sequence with the full spin Hamiltonian and find that it has an error of 10−6 that is below the error threshold of 10−4 required for fault‐tolerant quantum computation. Also the CNOT gate operation time of 100 ns is 3 times faster than 297 ns of the proposed global control scheme.

DOI
10.1063/1.3037136

Related papers

Optimal control of the silicon-based donor-electron-spin quantum computing

Dong-Bang Tsai, Po‐Wen Chen, Hsi‐Sheng Goan

We demonstrate how gradient ascent pulse engineering optimal control methods can be implemented on donor-electron-spin qubits in Si semiconductors with an architecture complementary to the original Kane's proposal. We focus on the high-fidelity-controlled-NOT (CNOT) gate and explicitly find its digitized control sequences by optimizing its fidelity over the external controls of the hyperfine $A$ and exchange $J$ interactions. This high-fidelity-CNOT gate has an error of about ${10}^{\ensuremath{-}6}$, below the error threshold required for fault-tolerant quantum computation, and its operation time of 100 ns is about three times faster than 297 ns of the proposed global control scheme. It also relaxes significantly the stringent distance constraint of two neighboring donor atoms of 10--20 nm as reported in the original Kane's proposal to about 30 nm in which surface $A$ and $J$ gates may be built with current fabrication technology. The effects of the control voltage fluctuations, the dipole-dipole interaction, and the electron-spin decoherence on the CNOT gate fidelity are also discussed.

arXiv:0906.0729•Physical Review A•Jun 17, 2009•17 citations

量子邏輯閘 (CNOT) 之時間最佳化研究

蔡東邦

We investigate how pulse-sequences and operation times of elementary quantum gates can be optimized for silicon-based donor electron spin quantum computer architecture, complementary to the original Kane's nuclear spin proposal. This gate-sequence-optimal or time-optimal quantum gate control in a quantum circuit is in addition to the more conventional concept of optimality in terms of the number of elementary gates needed in a quantum transformation. The optimal control method we use is the so-called gradient ascent pulse engineering (GRAPE) scheme. We focus on the high fidelity controlled-NOT (CNOT) gate and explicitly find the digitized control sequences by optimizing the effective, reduced donor electron spin Hamiltonian, with external controls over the hyperfine A and exchange J interactions. We first try different piecewise constant control steps and numerically calculate the fidelity (error) against the time needed to implement a CNOT gate with stopping criteria of error in the optimizer set to 〖10〗^(-9) in order to economize the simulation time. Here, the error is defined as 1-F, where F is fidelity. The error is less than 〖10〗^(-8) for times longer than 100ns, and it is found that 30 piecewise constant control steps for the CNOT gate operation will be sufficient to meet the required fidelity (error), and the performance would not be improved further with more steps. With operation time t=100ns and stopping criteria of error set to 〖10〗^(-16), we can find that the near time-optimal, high-fidelity CNOT gate control sequence has an error of 〖1.11×10〗^(-16). We then simulate the control sequences of the CNOT gate, obtained from reduced Hamiltonian simulations, with the full spin Hamiltonian. We find the error of about 〖10〗^(-6) which is below the error threshold required for fault-tolerant (〖10〗^(-4)) quantum computation. The CNOT gate operation time of 100ns is 3 times faster than the globally controlled electron spin scheme of 297ns. One of the great advantages of this near optimal-time high fidelity CNOT gate is that the exchange interaction is not required to be strong (the maximum value is J/h=20MHz compared to the typical value of 10.2GHz. This relaxes significantly the stringent distance constraint of two neighboring donor atoms of about 10nm as reported in the original Kane's proposal to be about 30nm which is within the reach of the current fabrication technology.

臺灣大學物理研究所學位論文•Jan 1, 2008•0 citations

Robust optimization of two-qubit gates using the GRAPE algorithm in nitrogen−vacancy centers

Jun-Tong Ding, Xinyu Zhao, Ye‐Hong Chen +2 more

We propose a scheme for optimizing two-qubit gate operations in a decoherence-free subspace (DFS) using the gradient ascent pulse engineering (GRAPE) algorithm, where the system consists of nitrogen-vacancy (NV) centers in diamond coupled to a whispering-gallery-mode microresonator. The logical qubits in this scheme are encoded in the DFS, which effectively avoids collective decoherence and provides a long coherence time for high-fidelity quantum operations. The GRAPE algorithm is used to design and optimize the control pulse sequences required for the target operation, thereby compensating for common errors and ensuring that the quantum gate maintains high fidelity under non-ideal conditions. As examples, we successfully implement high-fidelity and robust controlled-phase and SWAP gates. Numerical simulations demonstrate the effectiveness and superiority of the proposed scheme. The strategy of combining encoding protection with optimal control shown in this work can be extended to implement universal quantum gates in complex quantum systems.

Frontiers of Physics•Jan 1, 2026•0 citations

Global control and fast solid-state donor electron spin quantum computing

Charles D. Hill, Lloyd C. L. Hollenberg, Austin G. Fowler +3 more

We propose a scheme for quantum information processing based on donor electron spins in semiconductors, with an architecture complementary to the original Kane proposal. We show that a na\"{\i}ve implementation of electron spin qubits provides only modest improvement over the Kane scheme, however through the introduction of global gate control we are able to take full advantage of the fast electron evolution timescales. We estimate that the latent clock speed is 100--1000 times that of the nuclear spin quantum computer with the ratio ${T}_{2}∕{T}_{\mathrm{ops}}$ approaching the ${10}^{6}$ level.

arXiv:quant-ph/0411104•Physical Review B•Jul 22, 2005•84 citations

Pulse engineering via projection of response functions

Nicolas Heimann, Lukas Broers, Ludwig Mathey

We present an iterative optimal control method of quantum systems, aimed at an implementation of a desired operation with optimal fidelity. The update step of the method is based on the linear response of the fidelity to the control operators, and its projection onto the mode functions of the corresponding operator. Our method extends methods such as gradient-ascent pulse engineering (GRAPE) and variational quantum algorithms, by determining the fidelity gradient in a hyperparameter-free manner, and using it for a multiparameter update, capitalizing on the multimode overlap of the perturbation and the mode functions. This directly reduces the number of dynamical trajectories that need to be evaluated in order to update a set of parameters. We demonstrate this approach, and compare it to the standard GRAPE algorithm, for the example of a quantum gate on two qubits, demonstrating a clear improvement in convergence and optimal fidelity of the generated protocol.

arXiv:2404.10462•Physical Review Research•Jan 27, 2025•0 citations

Numerical Optimization of Microwave and Radio Frequency Control Pulses for the Nitrogen-Vacancy Electron-Nuclear Spin Register

Mark IJspeert

Numerical optimizations of the microwave and radio frequency control pulses for the nitrogen vacancy electron-nuclear spin register were performed by means of a gradient ascent pulse engineering method (GRAPE). Three examples of spin control — specific quantum state preparation and the implementation of a controlled-NOT and unconditional - gate have been optimized through parallel computation. The optimized control pulses reach fidelities of F = 0:99944, F = 0:77929 and F = 0:99143 respectively, whereas simulation of Rabi oscillation based control yields corresponding results of F = 0:96325, F = 0:21884 and F = 0:42702. The fixed step size in the GRAPE algorithm imposes a tradeoff between monotone and fast convergence of optimized control pulses and the unspecific performance function may lead to erroneous optimizations. These complications require future research to be resolved. Furthermore, implementing the effect of decoherence yields no significant average fidelity improvement, but has a positive effect on reducing the spread of final density states for the case of quantum state preparation.

•Feb 26, 2015•0 citations
In this paper, we demonstrate how gradient ascent pulse engineering (GRAPE) optimal control methods can be implemented on donor electron spin qubits in semiconductors with an architecture complementary to the original Kane’s proposal. We focus on the high fidelity controlled‐NOT (CNOT) gate and we explicitly find the digitized control sequences for a controlled‐NOT gate by optimizing its fidelity using the effective, reduced donor electron spin Hamiltonian with external controls over the hyperfine A and exchange J interactions. We then simulate the CNOT‐gate sequence with the full spin Hamiltonian and find that it has an error of 10−6 that is below the error threshold of 10−4 required for fault‐tolerant quantum computation. Also the CNOT gate operation time of 100 ns is 3 times faster than 297 ns of the proposed global control scheme.
We demonstrate how gradient ascent pulse engineering optimal control methods can be implemented on donor-electron-spin qubits in Si semiconductors with an architecture complementary to the original Kane's proposal. We focus on the high-fidelity-controlled-NOT (CNOT) gate and explicitly find its digitized control sequences by optimizing its fidelity over the external controls of the hyperfine AAA and exchange JJJ interactions. This high-fidelity-CNOT gate has an error of about ${10}^{\ensuremath{-}6}$, below the error threshold required for fault-tolerant quantum computation, and its operation time of 100 ns is about three times faster than 297 ns of the proposed global control scheme. It also relaxes significantly the stringent distance constraint of two neighboring donor atoms of 10--20 nm as reported in the original Kane's proposal to about 30 nm in which surface AAA and JJJ gates may be built with current fabrication technology. The effects of the control voltage fluctuations, the dipole-dipole interaction, and the electron-spin decoherence on the CNOT gate fidelity are also discussed.
We investigate how pulse-sequences and operation times of elementary quantum gates can be optimized for silicon-based donor electron spin quantum computer architecture, complementary to the original Kane's nuclear spin proposal. This gate-sequence-optimal or time-optimal quantum gate control in a quantum circuit is in addition to the more conventional concept of optimality in terms of the number of elementary gates needed in a quantum transformation. The optimal control method we use is the so-called gradient ascent pulse engineering (GRAPE) scheme. We focus on the high fidelity controlled-NOT (CNOT) gate and explicitly find the digitized control sequences by optimizing the effective, reduced donor electron spin Hamiltonian, with external controls over the hyperfine A and exchange J interactions. We first try different piecewise constant control steps and numerically calculate the fidelity (error) against the time needed to implement a CNOT gate with stopping criteria of error in the optimizer set to 〖10〗^(-9) in order to economize the simulation time. Here, the error is defined as 1-F, where F is fidelity. The error is less than 〖10〗^(-8) for times longer than 100ns, and it is found that 30 piecewise constant control steps for the CNOT gate operation will be sufficient to meet the required fidelity (error), and the performance would not be improved further with more steps. With operation time t=100ns and stopping criteria of error set to 〖10〗^(-16), we can find that the near time-optimal, high-fidelity CNOT gate control sequence has an error of 〖1.11×10〗^(-16). We then simulate the control sequences of the CNOT gate, obtained from reduced Hamiltonian simulations, with the full spin Hamiltonian. We find the error of about 〖10〗^(-6) which is below the error threshold required for fault-tolerant (〖10〗^(-4)) quantum computation. The CNOT gate operation time of 100ns is 3 times faster than the globally controlled electron spin scheme of 297ns. One of the great advantages of this near optimal-time high fidelity CNOT gate is that the exchange interaction is not required to be strong (the maximum value is J/h=20MHz compared to the typical value of 10.2GHz. This relaxes significantly the stringent distance constraint of two neighboring donor atoms of about 10nm as reported in the original Kane's proposal to be about 30nm which is within the reach of the current fabrication technology.
We propose a scheme for optimizing two-qubit gate operations in a decoherence-free subspace (DFS) using the gradient ascent pulse engineering (GRAPE) algorithm, where the system consists of nitrogen-vacancy (NV) centers in diamond coupled to a whispering-gallery-mode microresonator. The logical qubits in this scheme are encoded in the DFS, which effectively avoids collective decoherence and provides a long coherence time for high-fidelity quantum operations. The GRAPE algorithm is used to design and optimize the control pulse sequences required for the target operation, thereby compensating for common errors and ensuring that the quantum gate maintains high fidelity under non-ideal conditions. As examples, we successfully implement high-fidelity and robust controlled-phase and SWAP gates. Numerical simulations demonstrate the effectiveness and superiority of the proposed scheme. The strategy of combining encoding protection with optimal control shown in this work can be extended to implement universal quantum gates in complex quantum systems.
We propose a scheme for quantum information processing based on donor electron spins in semiconductors, with an architecture complementary to the original Kane proposal. We show that a na\"{\i}ve implementation of electron spin qubits provides only modest improvement over the Kane scheme, however through the introduction of global gate control we are able to take full advantage of the fast electron evolution timescales. We estimate that the latent clock speed is 100--1000 times that of the nuclear spin quantum computer with the ratio T2∕Tops{T}_{2}∕{T}_{\mathrm{ops}}T2​∕Tops​ approaching the 106{10}^{6}106 level.
We present an iterative optimal control method of quantum systems, aimed at an implementation of a desired operation with optimal fidelity. The update step of the method is based on the linear response of the fidelity to the control operators, and its projection onto the mode functions of the corresponding operator. Our method extends methods such as gradient-ascent pulse engineering (GRAPE) and variational quantum algorithms, by determining the fidelity gradient in a hyperparameter-free manner, and using it for a multiparameter update, capitalizing on the multimode overlap of the perturbation and the mode functions. This directly reduces the number of dynamical trajectories that need to be evaluated in order to update a set of parameters. We demonstrate this approach, and compare it to the standard GRAPE algorithm, for the example of a quantum gate on two qubits, demonstrating a clear improvement in convergence and optimal fidelity of the generated protocol.
Numerical optimizations of the microwave and radio frequency control pulses for the nitrogen vacancy electron-nuclear spin register were performed by means of a gradient ascent pulse engineering method (GRAPE). Three examples of spin control — specific quantum state preparation and the implementation of a controlled-NOT and unconditional - gate have been optimized through parallel computation. The optimized control pulses reach fidelities of F = 0:99944, F = 0:77929 and F = 0:99143 respectively, whereas simulation of Rabi oscillation based control yields corresponding results of F = 0:96325, F = 0:21884 and F = 0:42702. The fixed step size in the GRAPE algorithm imposes a tradeoff between monotone and fast convergence of optimized control pulses and the unspecific performance function may lead to erroneous optimizations. These complications require future research to be resolved. Furthermore, implementing the effect of decoherence yields no significant average fidelity improvement, but has a positive effect on reducing the spread of final density states for the case of quantum state preparation.