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

Fast Non-Adiabatic Gates and Quantum Algorithms on the Kane Quantum Computer in the Presence of Dephasing

Charles D. Hill

Published Jan 1, 2004• 0 citations
Publisher

Abstract

We propose and find pulse sequences for non‐adiabatic two‐qubit gates (CNOT, swap and controlled Z gates) for the Kane silicon‐based electron mediated nuclear spin quantum computer architecture. These quantum gates are simpler, with higher fidelity and faster than existing proposals. Any two qubit gate may be implemented using similar pulse sequences. In this paper, we investigate the effect of decoherence on the operation of these quantum gates and some simple algorithms for a variety of dephasing rates. Our model shows that conservative estimates of the dephasing rates in the Kane architecture give gate fidelities comparable to that required for fault tolerant quantum computing.

DOI
10.1063/1.1834407

Related papers

Gates for the Kane quantum computer in the presence of dephasing

Charles D. Hill, Hsi‐Sheng Goan

In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a controlled-NOT gate is $8.3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}5}$. We also compute the fidelities of $Z$, $X$, swap, and controlled $Z$ operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.

arXiv:quant-ph/0405042•Physical Review A•Aug 1, 2004•14 citations

Fast nonadiabatic two-qubit gates for the Kane quantum computer

Charles D. Hill, Hsi‐Sheng Goan

In this paper, we apply the canonical decomposition of two-qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the controlled-NOT, swap, square root of swap, and controlled Z rotations. We analyze the speed and fidelity of these gates, both of which compare favorably to existing schemes. The pulse sequences presented in this paper are theoretically faster, with higher fidelity, and simpler. Any two-qubit gate may be easily found and implemented using similar pulse sequences. Numerical simulation is used to verify the accuracy of each pulse scheme.

arXiv:quant-ph/0305040•Physical Review A•Jul 22, 2003•27 citations

Fast donor-based electron spin quantum computing

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

We propose a scheme for electron spin quantum computing based on electron spin in semiconductors. This scheme shares many similarities with the existing Kane nuclear spin proposal. We show how quantum computation may be carried out in this proposal, including single qubit rotations and CNOT gate. We show how this control can potentially lead to gate speeds 100-1000 times faster than the existing nuclear spin proposal, and up to 106 times faster than a typical electron spin dephasing time, T2(e).

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 23, 2005•0 citations

Error rate of the Kane quantum computer controlled-NOT gate in the presence of dephasing

Austin G. Fowler, Cameron J. Wellard, Lloyd C. L. Hollenberg

We study the error rate of controlled-NOT (CNOT) operations in the Kane solid-state quantum computer architecture [B. Kane, Nature 393, 133 (1998)]. A spin Hamiltonian is used to describe the system. Dephasing is included as exponential decay of the off-diagonal elements of the system's density matrix. Using available spin-echo decay data, the CNOT error rate is estimated at $\ensuremath{\approx}{10}^{\ensuremath{-}3}.$

arXiv:quant-ph/0207103•Physical Review A•Jan 3, 2003•17 citations

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

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
We propose and find pulse sequences for non‐adiabatic two‐qubit gates (CNOT, swap and controlled Z gates) for the Kane silicon‐based electron mediated nuclear spin quantum computer architecture. These quantum gates are simpler, with higher fidelity and faster than existing proposals. Any two qubit gate may be implemented using similar pulse sequences. In this paper, we investigate the effect of decoherence on the operation of these quantum gates and some simple algorithms for a variety of dephasing rates. Our model shows that conservative estimates of the dephasing rates in the Kane architecture give gate fidelities comparable to that required for fault tolerant quantum computing.
In this paper we investigate the effect of dephasing on proposed quantum gates for the solid-state Kane quantum computing architecture. Using a simple model of the decoherence, we find that the typical error in a controlled-NOT gate is $8.3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}5}$. We also compute the fidelities of ZZZ, XXX, swap, and controlled ZZZ operations under a variety of dephasing rates. We show that these numerical results are comparable with the error threshold required for fault tolerant quantum computation.
In this paper, we apply the canonical decomposition of two-qubit unitaries to find pulse schemes to control the proposed Kane quantum computer. We explicitly find pulse sequences for the controlled-NOT, swap, square root of swap, and controlled Z rotations. We analyze the speed and fidelity of these gates, both of which compare favorably to existing schemes. The pulse sequences presented in this paper are theoretically faster, with higher fidelity, and simpler. Any two-qubit gate may be easily found and implemented using similar pulse sequences. Numerical simulation is used to verify the accuracy of each pulse 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 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.