Open AccessFeature PaperArticle

Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates

College of Physics and Electronic Engineering, Hengyang Normal University, Hengyang 421002, China

College of Physics Science and Technology, Shenyang Normal University, Shenyang 110034, China

Center for Quantum Sciences and School of Physics, Northeast Normal University, Changchun 130024, China

⁴

Center for Advanced Optoelectronic Functional Materials Research, and Key Laboratory for UV Light-Emitting Materials and Technology of Ministry of Education, Northeast Normal University, Changchun 130024, China

Authors to whom correspondence should be addressed.

Entropy 2022, 24(10), 1371; https://doi.org/10.3390/e24101371

Submission received: 1 September 2022 / Revised: 20 September 2022 / Accepted: 21 September 2022 / Published: 27 September 2022

(This article belongs to the Special Issue Quantum Computing for Complex Dynamics)

Download

Browse Figures

Versions Notes

Abstract

Multiqubit CCZ gates form one of the building blocks of quantum algorithms and have been involved in achieving many theoretical and experimental triumphs. Designing a simple and efficient multiqubit gate for quantum algorithms is still by no means trivial as the number of qubits increases. Here, by virtue of the Rydberg blockade effect, we propose a scheme to rapidly implement a three-Rydberg-atom CCZ gate via a single Rydberg pulse, and successfully apply the gate to realize the three-qubit refined Deutsch–Jozsa algorithm and three-qubit Grover search. The logical states of the three-qubit gate are encoded to the same ground states to avoid an adverse effect of the atomic spontaneous emission. Furthermore, there is no requirement for individual addressing of atoms in our protocol.

Keywords:

multiqubit controlled gate; Rydberg blockade; quantum algorithm

1. Introduction

Fault-tolerant quantum computing [1], exploiting quantum mechanical phenomena such as superposition and entanglement, is crucial for solving difficult problems in many-body quantum mechanics and mathematics which lack efficient algorithms on classical computers. It also holds a promise for simulation of quantum systems [2], chemistry [3], materials science [4], finance [5], and so on [6,7,8,9,10,11,12]. Any quantum computation can comprise of a sequence of one- and two-qubit quantum gates [13]. Therefore, extensive efforts have been made to achieve high-speed, high-fidelity, and robust two-qubit gates, and various two-qubit gate schemes have been proposed, such as adiabatic gates [14], diabatic gates [15], resonator-induced gates [16], and microwave gates [17].

With the rapid development of quantum information science, an enormous amount of ingenious work, e.g., quantum error correction [18] and quantum algorithms [19], requires the large-scale quantum computation based on the multiqubit controlled operations (the number of qubit is greater than 2). Although the multiqubit controlled operations can be decomposed into a series of universal single- and two-qubit gates, the quantum system becomes more and more complicated as the number of qubits increases, and it is more difficult to get an error per gate (the difference between 1 and average gate fidelity) below the fault-tolerant threshold. Thus, the direct implementation of multiqubit logic gates can greatly simplify the quantum circuit and improve the efficiency and quality of quantum information processing, which results in the increased attention to straight multiqubit gates [20,21,22,23]. For instance, three-qubit controlled gates, a typical class of multiqubit gates, have been demonstrated in many experimental platforms, such as trapped ions [24], Rydberg atoms [25,26], superconducting systems [27], nuclear magnetic resonance [28], and photonic architecture [29]. However, it is still a challenge for the direct realization of a fast multiqubit logic gate with fewer driven fields and without individual addressing of atoms.

Rydberg atoms have long been deemed as a promising platform because of the strong and tunable interactions between Rydberg states, and play important roles in entanglement generation [30,31], quantum simulators [32], quantum state transfer [33], and so on. The interaction can lead to the phenomenon of Rydberg blockade [34], which prevents nearby atoms from being excited to the Rydberg state simultaneously via a single Rydberg excitation. Motivated by the first Rydberg-blockade proposal to perform fast gate operations [35], extensive efforts have been made to improve the gate fidelity and design alternative proposals [36,37,38,39], as well as generalize relevant ideas to multiqubit gates [40,41,42,43,44,45,46]. Particularly, Han et al. [37] implemented fast two-qubit entangling gates via Rydberg blockade and required neither individual addressing of atoms nor adiabatic procedures. Nevertheless, their scheme can not rapidly implement a three-qubit gate, and the logical states have to be encoded by different ground and excited states, which increases the complexity and the adverse effect of the decoherence. Jandura et al. [46] also designed the controlled-Z gate and its three qubit generalization. However, the complicated laser pulses dependent on operation time lead to more restrictions.

In this work, we put forward an alternative scheme to rapidly implement a three-Rydberg-atom CCZ gate via a single Rydberg pulse, where the average gate fidelity can be above

97 %

. Our protocol not only requires neither individual addressing of atoms nor adiabatic procedures, but also encodes the logical states with the same ground states. In addition, compared with the schemes comprised of step-by-step operations on different atoms [23], our scheme is the one-step implementation scheme. It significantly reduces the complexity of experimental operations and raises the feasibility of experiments. Finally, we successfully apply our proposal to realize three-qubit refined Deutsch–Jozsa algorithm [47,48] and three-qubit Grover search [49,50].

2. Principle of the Fast Three-Rydberg-Atom CCZ Gate

The system to realize the fast CCZ gate consists of three

^{87}

Rb Rydberg atoms trapped in three tweezers with separation

r_{i j}

shorter than the blocking radius, where

r_{i j}

is the atomic distance between the i- and j-th atoms, and there is no requirement for the shape of the atomic arrangement. Each atom includes two ground states and one Rydberg state. The ground states are

| 0 〉 \equiv | F = 1, m_{F} = 0 〉

and

| 1 〉 \equiv | F = 2, m_{F} = 0 〉

5 S_{1 / 2}

hyperfine clock states with splitting

2 π \times 6.83

GHz, which are used as encoded quantum bits to effective restrain the adverse effect of atomic spontaneous emission. The Rydberg state

| r 〉 \equiv | 70 S_{1 / 2}, m_{j} = - 1 / 2 〉

can be dispersively coupled to the ground states via one common Rydberg pulse [23] with effective Rabi frequency

Ω \approx 2 π \times 3.5

MHz and adjustable detuning

δ

. Due to the above design, our scheme is simple for experiment and needn’t individual addressing of atoms. The corresponding schematic illustrations for the setup and atomic levels of the three-Rydberg-atom system is shown in Figure 1.

In the interaction picture, the total Hamiltonian can be written as

\begin{matrix} H_{I} = \frac{Ω}{2} \sum_{j = 1}^{3} σ_{j}^{r 1} e^{i δ t} + H . c . + \sum_{k > j} U_{j k} σ_{j}^{r r} σ_{k}^{r r}, \end{matrix}

(1)

where

{| α 〉}_{j j} 〈 β |

is parameterized as

σ_{j}^{α β}

(

α, β = 0, 1, r

) and

U_{i j}

denotes the Rydberg–Rydberg interaction of i- and j-th atoms. Here, we consider the Rydberg–Rydberg interactions are caused by the long-range van der Waals interaction, which is equal to

- C_{6} / r_{i j}^{6}

and

C_{6} = - 2 π \times 862.69

GHz

\cdot μ

^{6}

for the Rydberg state

| r 〉 \equiv | 70 S_{1 / 2}, m_{j} = - 1 / 2 〉

[51]. It is noteworthy that the result of our scheme is independent of the functional form of

U_{i j}

and only the strength of the interaction at a given fixed distance of the two atoms is relevant. Thus, a dipole-dipole interaction is also valid for our scheme.

While the condition of Rydberg blockade

min (U_{i j}) ≫ Ω

is satisfied, the simultaneous excitations of Rydberg atoms will be suppressed and the Equation (1) can be simplified as an effective Hamiltonian (see Appendix A for details),

\begin{matrix} H_{eff} = \frac{Ω}{2} \sum_{j} P_{j - 1}^{0} σ_{j}^{r 1} P_{j + 1}^{0} e^{i δ t} + H . c . \end{matrix}

(2)

Here,

P_{j}^{0} = 1 - σ_{j}^{r r}

and periodic boundary conditions of j is considered. Based on the effective Hamiltonian, we can obtain the gate operation in the subspace spanned by

{| 000 〉, | 001 〉, | 010 〉, | 011 〉, | 100 〉, | 101 〉, | 110 〉, | 111 〉}

\begin{matrix} C_{s} (t) = diag {C_{0}, C_{1}, C_{1}, C_{2}, C_{1}, C_{2}, C_{2}, C_{3}}, \end{matrix}

(3)

where

\begin{matrix} C_{l} & = & cos (\frac{1}{2} δ χ_{l} t) + i \frac{1}{χ_{l}} sin (\frac{1}{2} δ χ_{l} t), \\ χ_{l} & = & \sqrt{\frac{l Ω^{2}}{δ^{2}} + 1}, l = 0, 1, 2, 3 . \end{matrix}

Once a suitable time for the gate operation is selected, we can obtain a gate operation

diag {1, 1, 1, - 1, 1, - 1, - 1, 1}

. To get the target CCZ gate

C_{z} = diag {- 1, 1, 1, 1,

1, 1, 1, 1}

, three single qubit logical gates (operation

σ_{j}^{11} - σ_{j}^{00}

for the j-th atom) operated on the subspace

{| 0 〉, | 1 〉}

will be further performed in succession, and the Equation (3) can be obtained as

\begin{matrix} C (t) = diag {- C_{0}, C_{1}, C_{1}, - C_{2}, C_{1}, - C_{2}, - C_{2}, C_{3}} . \end{matrix}

(4)

Then we characterize the quality of the gate operation via the trace-preserving-quantum-operator-based average gate fidelity [52,53]

\begin{matrix} \bar{F} (ε, \hat{U}) = \frac{\sum_{α} tr (\hat{U} {\hat{U}}_{α}^{†} {\hat{U}}^{†} ε ({\hat{U}}_{α})) + d^{2}}{d^{2} (d + 1)}, \end{matrix}

(5)

where

{\hat{U}}_{α}

is the tensor of Pauli matrices

I I I, I I X, \dots, Z Z Z

d = 8

is the dimension for the three-qubit logic gate,

\hat{U}

is the perfect

C_{Z}

gate, and

ε

is the trace-preserving quantum operation obtained through our real logic gate

C (t)

, i.e.,

ε ({\hat{U}}_{α}) = C (t) {\hat{U}}_{α} C^{†} (t)

. The analysis formula of the average gate fidelity for our scheme can be described as

\begin{matrix} \bar{F} = \frac{1}{72} {| C_{0} + 3 C_{1} - 3 C_{2} + C_{3} |}^{2} + \frac{1}{9} . \end{matrix}

(6)

Then one can regulate the detuning

δ

and the operation time to make

\bar{F}

tend to 1.

In Figure 2a, we plot the average gate fidelity with respect to

δ

as well as the gate operation time, where the system is governed by the full Hamiltonian of Equation (1). The average gate fidelity can rapidly reach

97.31 %

with the gate operation time

t = 0.8049

μ

s and

δ / 2 π = 1.166

MHz, which is good enough for the direct implementation of the three-qubit CCZ gate. For the other values of

δ

, it can also be above

90 %

within

t = 1.2

μ

s. These results adequately demonstrate the feasibility and the high efficiency of our scheme. In addition, the CCZ gate can be realized directly without the three single qubit logical gates, i.e., set a suitable time to make

C_{s} (t)

equal to the

C_{Z}

gate. In Figure 2b, we also illustrate the average gate fidelity without the three single qubit logical gates as functions of

δ

and t. Compared with our original scheme, the scheme without the three single qubit logical gates will spend too much time. Furthermore, the average gate fidelity can only arrive at

92.62 %

with

t = 1.955

μ

s and

δ / 2 π = 2.993

MHz. The relevant data exhibits the importance for the operation of three single qubit logical gates.

Compared with the implementation of the fast two-qubit entangling gates via Rydberg blockade [37], it is observed that the aim of our scheme is to make the direct implementation of the CCZ gate easier and more efficient. Therefore, our scheme is designed for the three-Rydberg-atom system and cannot be generalized, which is a limitation for the present method. Besides, the method is sensitive to the variations of gate operation time. It is also the fundamental limitation for the schemes governed by the unitary dynamics.

3. Applications of Quantum Algorithms

3.1. Refined Deutsch–Jozsa Algorithm

Quantum algorithms play an important role in improving computational speed over their classical counterparts due to computational parallelism or interference effects. For the numerous quantum algorithms, the original Deutsch–Jozsa (DJ) algorithm [54] or its modified version (refined DJ algorithm) [47] represents a paradigmatic example, which has been implemented in various systems [55,56,57].

The heart of the original DJ algorithm [54] is to distinguish constant functions

f_{C} (x)

from balanced functions

f_{B} (x)

in an N-qubit system in terms of one query of binary-valued function

f (x) : {0, 1}^{N} \to {0, 1}

. The function can be described as the unitary operation

\begin{matrix} U_{f} | x 〉 | y 〉 = | x 〉 | y \oplus f (x) 〉, \end{matrix}

(7)

where x is an N-qubit input and y is the auxiliary qubit. To improve the original DJ algorithm, Collins et al. [47] proposed the refined DJ algorithm that fully removes the auxiliary qubit y. The corresponding action of the f-controlled gate can be expressed as [47,48]

\begin{matrix} U_{f}^{N} | x 〉 = {(- 1)}^{f (x)} | x 〉 . \end{matrix}

(8)

For the three-qubit system

N = 3

, there are one f-controlled gate of the constant functions

U_{f_{C}}^{3} = diag {1, 1, 1, 1, 1, 1, 1, 1}

and 35 nontrivial and distinct f-controlled gates of the balanced functions

U_{f_{B j}}^{3}

(j = 1, 2, \dots, 35)

. Here,

U_{f_{B j}}^{3}

can be decomposed into the combination of CCZ gate

J_{111} = diag {1, 1, 1, 1, 1, 1, 1, - 1}

and single qubit logical gates of the k-th atom

σ_{x, k} = σ_{k}^{10} + σ_{k}^{01}

[37]. For example, the f-controlled gate

U_{B 1}^{3} = diag {1, - 1, 1, - 1, - 1, 1, 1, - 1}

can be constituted as

\begin{matrix} U_{B 1}^{3} = J_{111} J_{100} J_{011} J_{001} \end{matrix}

(9)

with

J_{100} = σ_{x, 3} σ_{x, 2} J_{111} σ_{x, 2} σ_{x, 3}

J_{011} = σ_{x, 1} J_{111} σ_{x, 1}

, and

J_{001} = σ_{x, 2} σ_{x, 1} J_{111} σ_{x, 1} σ_{x, 2}

. As for the gate

J_{111}

, it can be implemented by replacing the dispersive coupling

| 1 〉 \leftrightarrow | r 〉

with the dispersive coupling

| 0 〉 \leftrightarrow | r 〉

in our three-qubit CCZ gate scheme. In Figure 3, we illustrate the contour of average gate fidelity of

U_{B 1}^{3}

with respect to the detuning and the gate operation time. The three-qubit Rydberg system is also governed by the original Hamiltonian. It can be found that the f-controlled gate of the balanced function can be achieved with a high fidelity

89.84 %

t = 0.8049

μ

s and

δ / 2 π = 1.166

MHz, which certifies the feasibility of the application.

3.2. Grover Search

Grover search [49] is another remarkable quantum algorithm to find out a certain state and is widely used in various fields [58,59,60,61,62,63,64], which can be carried out via three steps [65]. Firstly, one can employ Hadamard gates to prepare a superposition state

| ψ_{0} 〉 = \sum_{α = 0}^{N - 1} | α 〉 / \sqrt{d}

, where d is the dimension of the system. The second step is to perform an iteration Q including two operations: (a) Take advantage of quantum phase gate

I_{τ} = I - 2 | τ 〉 〈 τ |

(I is the identity matrix) to get the inversion of the amplitude of the marked state

| τ 〉

; (b) Use the diffusion transform D (

D_{α β} = 2 / d - δ_{α β}

α, β = 1, 2, \dots, d

) to get the inversion about the average of the amplitudes of all states. Finally, the marked state can be obtained by a measurement of the whole system. In this section, we discuss the application of our scheme on the three-qubit Grover search.

For our three-qubit system, the Hadamard gate can be defined as

H^{\otimes 3} = {(\frac{1}{\sqrt{2}})}^{3} (\begin{matrix} 1 & 1 \\ 1 & - 1 \end{matrix}) \otimes (\begin{matrix} 1 & 1 \\ 1 & - 1 \end{matrix}) \otimes (\begin{matrix} 1 & 1 \\ 1 & - 1 \end{matrix}),

which can be performed via external microwave pulses. The iteration Q for the second step can be characterized as

\begin{matrix} Q = H^{\otimes 3} C (t) H^{\otimes 3} I_{τ}, \end{matrix}

(10)

where the

C (t)

can be obtained by the original Hamiltonian of Equation (1). While the gate operation time t is suitable, we can obtain an approximate three-qubit quantum phase gate with

\begin{matrix} C (t) \approx diag {- 1, 1, 1, 1, 1, 1, 1, 1} . \end{matrix}

(11)

Then a full Grover search for three qubits is available through our scheme.

In Figure 4, we take the marked state

| 101 〉

as an example and calculate the fidelity of the state searched for as functions of the iteration number with different Rydberg–Rydberg interaction strength. For simplicity, the Rydberg–Rydberg interaction strength between the i- and j-th atom has been assumed as

U_{i j} = U

. The result is good enough for the three-qubit Grover search with the second iteration and

U / 2 π = 35

MHz, where a fidelity of up to

92.46 %

can be acquired. Moreover, the fidelity can be also improved to

94.76 %

and

95.08 %

with the increasing of the Rydberg–Rydberg interaction strength. These can fully reflect the feasibility for the application of our scheme to the three-qubit Grover search.

4. Discussion and Summary

While the ambient temperature is chosen as

{0, 77, 300, 700}

K, the effective lifetime of 70

S_{1 / 2}

for Rb atoms will be

{410.41, 287.78, 151.55, 92.257} μ

s, respectively [66]. Consequently, the operation time of all the above schemes that can be achieved within 1

μ

s is much shorter than the effective lifetime of the Rydberg state.

In summary, we successfully achieve a fast three-Rydberg-atom CCZ gate via a common Rydberg pulse and apply it to the three-qubit refined Deutsch–Jozsa algorithm and three-qubit Grover search. In our scheme, the Rydberg blockade effect is used to inhibit the simultaneous excitations of Rydberg atoms. The logical states are encoded into the same ground states to avoid the adverse effect of the atomic spontaneous emission. Additionally, compared with the previous scheme, our proposal requires neither individual addressing of atoms nor step-by-step operations on different atoms. Accordingly, the complexity of experimental operations is reduced and the feasibility of experiments is raised significantly. With the current experimental technologies, the average gate fidelity of the three-Rydberg-atom CCZ gate can be above

97 %

with a short operation time. We believe the present scheme supplies a viable prospect for the realizations of multiqubit gate and quantum algorithms.

Author Contributions

Conceptualization, X.S. and S.T.; methodology, X.S.; software, D.L.; validation, C.Y.; data curation, D.L.; writing—original draft preparation, D.L. and C.Y.; writing review and editing, X.S. and S.T.; funding acquisition, X.S. and S.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China (NSFC) (11774047, 12174048) and the Hunan Provincial Natural Science Foundation of China (2020JJ4146).

Data Availability Statement

Data available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Here, we will show the detailed derivation from the Equation (1) to the Equation (2) of the main text. For simplicity, we can choose the interaction strengths

U_{12} = U_{13} = U_{23} = U

, and the Equation (1) can be rewritten as

\begin{matrix} H_{I} = \frac{Ω}{2} \sum_{j = 1}^{3} σ_{j}^{r 1} e^{i δ t} + H . c . + U \sum_{k > j} σ_{j}^{r r} σ_{k}^{r r} . \end{matrix}

(A1)

Then we utilize the formula

i {\dot{U}}_{0}^{†} U_{0} + U_{0}^{†} H_{I} U_{0}

to reformulate the Hamiltonian in a rotating frame with respect to

U_{0} = exp {- i t U \sum_{k > j} σ_{j}^{r r} σ_{k}^{k k}}

as [67,68],

\begin{matrix} H_{U} = \frac{Ω}{2} \sum_{j, m, n} P_{j - 1}^{m} σ_{j}^{r 1} P_{j + 1}^{n} e^{i [(m + n) U + δ] t} + H . c ., \end{matrix}

(A2)

where

m, n = 0, 1

P_{j}^{0} = 1 - σ_{j}^{r r}

P_{j}^{1} = σ_{j}^{r r}

, and periodic boundary conditions of j is considered. While the condition of Rydberg blockade

U ≫ Ω

is satisfied, the simultaneous excitations of Rydberg atoms will be suppressed and the Equation (A2) can be simplified as the effective Hamiltonian, i.e., the Equation (2) of the main text,

\begin{matrix} H_{eff} = \frac{Ω}{2} \sum_{j} P_{j - 1}^{0} σ_{j}^{r 1} P_{j + 1}^{0} e^{i δ t} + H . c . \end{matrix}

(A3)

References

Feynman, R.P. Simulating physics with computers. Int. J. Theor. Phys. 1981, 21, 467–488. [Google Scholar] [CrossRef]
Georgescu, I.M.; Ashhab, S.; Nori, F. Quantum simulation. Rev. Mod. Phys. 2014, 86, 153–185. [Google Scholar] [CrossRef]
Cao, Y.; Romero, J.; Olson, J.P.; Degroote, M.; Johnson, P.D.; Kieferová, M.; Kivlichan, I.D.; Menke, T.; Peropadre, B.; Sawaya, N.P.; et al. Quantum chemistry in the age of quantum computing. Chem. Rev. 2019, 119, 10856–10915. [Google Scholar] [CrossRef]
Bauer, B.; Bravyi, S.; Motta, M.; Chan, G.K.L. Quantum algorithms for quantum chemistry and quantum materials science. Chem. Rev. 2020, 120, 12685–12717. [Google Scholar] [CrossRef] [PubMed]
Orús, R.; Mugel, S.; Lizaso, E. Quantum computing for finance: Overview and prospects. Rev. Phys. 2019, 4, 100028. [Google Scholar] [CrossRef]
Montanaro, A. Quantum algorithms: An overview. Npj Quantum Inf. 2016, 2, 1–8. [Google Scholar] [CrossRef]
Wendin, G. Quantum information processing with superconducting circuits: A review. Rep. Prog. Phys. 2017, 80, 106001. [Google Scholar] [CrossRef]
Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2018, 2, 79. [Google Scholar] [CrossRef]
Cerezo, M.; Poremba, A.; Cincio, L.; Coles, P.J. Variational Quantum Fidelity Estimation. Quantum 2020, 4, 248. [Google Scholar] [CrossRef]
Xin, T.; Wei, S.; Cui, J.; Xiao, J.; Arrazola, I.N.; Lamata, L.; Kong, X.; Lu, D.; Solano, E.; Long, G. Quantum algorithm for solving linear differential equations: Theory and experiment. Phys. Rev. A 2020, 101, 032307. [Google Scholar] [CrossRef] [Green Version]
Cerezo, M.; Arrasmith, A.; Babbush, R.; Benjamin, S.C.; Endo, S.; Fujii, K.; McClean, J.R.; Mitarai, K.; Yuan, X.; Cincio, L.; et al. Variational quantum algorithms. Nat. Rev. Phys. 2021, 3, 625–644. [Google Scholar] [CrossRef]
Gao, P.; Li, K.; Wei, S.; Gao, J.; Long, G. Quantum gradient algorithm for general polynomials. Phys. Rev. A 2021, 103, 042403. [Google Scholar] [CrossRef]
Bennett, C.H.; DiVincenzo, D.P. Quantum information and computation. Nature 2000, 404, 247–255. [Google Scholar] [CrossRef] [PubMed]
DiCarlo, L.; Chow, J.M.; Gambetta, J.M.; Bishop, L.S.; Johnson, B.R.; Schuster, D.; Majer, J.; Blais, A.; Frunzio, L.; Girvin, S.; et al. Demonstration of two-qubit algorithms with a superconducting quantum processor. Nature 2009, 460, 240–244. [Google Scholar] [CrossRef]
Dewes, A.; Ong, F.R.; Schmitt, V.; Lauro, R.; Boulant, N.; Bertet, P.; Vion, D.; Esteve, D. Characterization of a Two-Transmon Processor with Individual Single-Shot Qubit Readout. Phys. Rev. Lett. 2012, 108, 057002. [Google Scholar] [CrossRef]
Paik, H.; Mezzacapo, A.; Sandberg, M.; McClure, D.T.; Abdo, B.; Córcoles, A.D.; Dial, O.; Bogorin, D.F.; Plourde, B.L.T.; Steffen, M.; et al. Experimental Demonstration of a Resonator-Induced Phase Gate in a Multiqubit Circuit-QED System. Phys. Rev. Lett. 2016, 117, 250502. [Google Scholar] [CrossRef]
Chow, J.M.; Córcoles, A.D.; Gambetta, J.M.; Rigetti, C.; Johnson, B.R.; Smolin, J.A.; Rozen, J.R.; Keefe, G.A.; Rothwell, M.B.; Ketchen, M.B.; et al. Simple All-Microwave Entangling Gate for Fixed-Frequency Superconducting Qubits. Phys. Rev. Lett. 2011, 107, 080502. [Google Scholar] [CrossRef]
Shor, P.W. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 1995, 52, R2493–R2496. [Google Scholar] [CrossRef]
Grover, L.K. Quantum Computers Can Search Rapidly by Using Almost Any Transformation. Phys. Rev. Lett. 1998, 80, 4329–4332. [Google Scholar] [CrossRef]
Mølmer, K.; Sørensen, A. Multiparticle Entanglement of Hot Trapped Ions. Phys. Rev. Lett. 1999, 82, 1835–1838. [Google Scholar] [CrossRef] [Green Version]
Shao, X.Q.; Zhu, A.D.; Zhang, S.; Chung, J.S.; Yeon, K.H. Efficient scheme for implementing an N-qubit Toffoli gate by a single resonant interaction with cavity quantum electrodynamics. Phys. Rev. A 2007, 75, 034307. [Google Scholar] [CrossRef]
Chen, A.M.; Cho, S.Y.; Kim, M.D. Implementation of a three-qubit Toffoli gate in a single step. Phys. Rev. A 2012, 85, 032326. [Google Scholar] [CrossRef]
Levine, H.; Keesling, A.; Semeghini, G.; Omran, A.; Wang, T.T.; Ebadi, S.; Bernien, H.; Greiner, M.; Vuletić, V.; Pichler, H.; et al. Parallel Implementation of High-Fidelity Multiqubit Gates with Neutral Atoms. Phys. Rev. Lett. 2019, 123, 170503. [Google Scholar] [CrossRef] [PubMed]
Monz, T.; Kim, K.; Hänsel, W.; Riebe, M.; Villar, A.S.; Schindler, P.; Chwalla, M.; Hennrich, M.; Blatt, R. Realization of the Quantum Toffoli Gate with Trapped Ions. Phys. Rev. Lett. 2009, 102, 040501. [Google Scholar] [CrossRef]
Sun, L.N.; Yan, L.L.; Su, S.L.; Jia, Y. One-Step Implementation of Time-Optimal-Control Three-Qubit Nonadiabatic Holonomic Controlled Gates in Rydberg Atoms. Phys. Rev. Appl. 2021, 16, 064040. [Google Scholar] [CrossRef]
Li, D.X.; Shao, X.Q. Unconventional Rydberg pumping and applications in quantum information processing. Phys. Rev. A 2018, 98, 062338. [Google Scholar] [CrossRef]
Fedorov, A.; Steffen, L.; Baur, M.; da Silva, M.P.; Wallraff, A. Implementation of a Toffoli gate with superconducting circuits. Nature 2012, 481, 170–172. [Google Scholar] [CrossRef]
Cory, D.G.; Price, M.D.; Maas, W.; Knill, E.; Laflamme, R.; Zurek, W.H.; Havel, T.F.; Somaroo, S.S. Experimental Quantum Error Correction. Phys. Rev. Lett. 1998, 81, 2152–2155. [Google Scholar] [CrossRef]
Lanyon, B.P.; Barbieri, M.; Almeida, M.P.; Jennewein, T.; Ralph, T.C.; Resch, K.J.; Pryde, G.J.; O’Brien, J.L.; Gilchrist, A.; White, A.G. Simplifying quantum logic using higher-dimensional Hilbert spaces. Nat. Phys. 2009, 5, 134–140. [Google Scholar] [CrossRef]
Saffman, M.; Mølmer, K. Efficient Multiparticle Entanglement via Asymmetric Rydberg Blockade. Phys. Rev. Lett. 2009, 102, 240502. [Google Scholar] [CrossRef] [Green Version]
Li, D.X.; Shao, X.Q.; Wu, J.H.; Yi, X.X. Dissipation-induced W state in a Rydberg-atom-cavity system. Opt. Lett. 2018, 43, 1639–1642. [Google Scholar] [CrossRef] [PubMed]
Weimer, H.; Müller, M.; Lesanovsky, I.; Zoller, P.; Büchler, H.P. A Rydberg quantum simulator. Nat. Phys. 2010, 6, 382–388. [Google Scholar] [CrossRef]
Li, D.X.; Shao, X.Q. Directional quantum state transfer in a dissipative Rydberg-atom-cavity system. Phys. Rev. A 2019, 99, 032348. [Google Scholar] [CrossRef]
Saffman, M.; Walker, T.G.; Mølmer, K. Quantum information with Rydberg atoms. Rev. Mod. Phys. 2010, 82, 2313–2363. [Google Scholar] [CrossRef]
Jaksch, D.; Cirac, J.I.; Zoller, P.; Rolston, S.L.; Côté, R.; Lukin, M.D. Fast Quantum Gates for Neutral Atoms. Phys. Rev. Lett. 2000, 85, 2208–2211. [Google Scholar] [CrossRef]
Müller, M.M.; Murphy, M.; Montangero, S.; Calarco, T.; Grangier, P.; Browaeys, A. Implementation of an experimentally feasible controlled-phase gate on two blockaded Rydberg atoms. Phys. Rev. A 2014, 89, 032334. [Google Scholar] [CrossRef]
Han, R.; Ng, H.K.; Englert, B.G. Implementing a neutral-atom controlled-phase gate with a single Rydberg pulse. Europhys. Lett. 2016, 113, 40001. [Google Scholar] [CrossRef]
Fu, Z.; Xu, P.; Sun, Y.; Liu, Y.Y.; He, X.D.; Li, X.; Liu, M.; Li, R.B.; Wang, J.; Liu, L.; et al. High-fidelity entanglement of neutral atoms via a Rydberg-mediated single-modulated-pulse controlled-phase gate. Phys. Rev. A 2022, 105, 042430. [Google Scholar] [CrossRef]
Li, X.X.; Shao, X.Q.; Li, W.B. Single temporal-pulse-modulated parameterized controlled-phase gate for neutral atoms under symmetrically optical pumping. Phys. Rev. Appl. 2022; accepted. [Google Scholar]
Müller, M.; Lesanovsky, I.; Weimer, H.; Büchler, H.P.; Zoller, P. Mesoscopic Rydberg Gate Based on Electromagnetically Induced Transparency. Phys. Rev. Lett. 2009, 102, 170502. [Google Scholar] [CrossRef]
Shao, X.Q.; Wang, H.F.; Chen, L.; Zhang, S.; Yeon, K.H. One-step implementation of the Toffoli gate via quantum Zeno dynamics. Phys. Lett. A 2009, 374, 28. [Google Scholar] [CrossRef]
Shao, X.Q.; Zheng, T.Y.; Zhang, S. Robust Toffoli gate originating from Stark shifts. J. Opt. Soc. Am. B 2012, 29, 1203. [Google Scholar] [CrossRef]
Khazali, M.; Mølmer, K. Fast Multiqubit Gates by Adiabatic Evolution in Interacting Excited-State Manifolds of Rydberg Atoms and Superconducting Circuits. Phys. Rev. X 2020, 10, 021054. [Google Scholar] [CrossRef]
Yin, H.D.; Li, X.X.; Wang, G.C.; Shao, X.Q. One-step implementation of Toffoli gate for neutral atoms based on unconventional Rydberg pumping. Opt. Express 2020, 28, 35576. [Google Scholar] [CrossRef] [PubMed]
Yin, H.D.; Shao, X.Q. Gaussian soft control-based quantum fan-out gate in ground-state manifolds of neutral atoms. Opt. Lett. 2021, 46, 2541. [Google Scholar] [CrossRef]
Jandura, S.; Pupillo, G. Time-Optimal Two- and Three-Qubit Gates for Rydberg Atoms. Quantum 2022, 6, 712. [Google Scholar] [CrossRef]
Collins, D.; Kim, K.W.; Holton, W.C. Deutsch–Jozsa algorithm as a test of quantum computation. Phys. Rev. A 1998, 58, R1633–R1636. [Google Scholar] [CrossRef]
Yang, W.L.; Chen, C.Y.; Xu, Z.Y.; Feng, M. Cavity QED implementation of the multi-qubit refined Deutsch–Jozsa algorithm. J. Phys. B At. Mol. Opt. Phys. 2010, 43, 055501. [Google Scholar] [CrossRef]
Grover, L.K. Quantum Mechanics Helps in Searching for a Needle in a Haystack. Phys. Rev. Lett. 1997, 79, 325–328. [Google Scholar] [CrossRef]
Yang, W.L.; Chen, C.Y.; Feng, M. Implementation of three-qubit Grover search in cavity quantum electrodynamics. Phys. Rev. A 2007, 76, 054301. [Google Scholar] [CrossRef]
Šibalić, N.; Pritchard, J.; Adams, C.; Weatherill, K. ARC: An open-source library for calculating properties of alkali Rydberg atoms. Comput. Phys. Commun. 2017, 220, 319–331. [Google Scholar] [CrossRef]
Nielsen, M.A. A simple formula for the average gate fidelity of a quantum dynamical operation. Phys. Lett. A 2002, 303, 249–252. [Google Scholar] [CrossRef]
White, A.G.; Gilchrist, A.; Pryde, G.J.; O’Brien, J.L.; Bremner, M.J.; Langford, N.K. Measuring two-qubit gates. J. Opt. Soc. Am. B 2007, 24, 172–183. [Google Scholar] [CrossRef]
Deutsch, D.; Jozsa, R. Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A 1992, 439, 553–558. [Google Scholar] [CrossRef]
Chuang, I.L.; Vandersypen, L.M.; Zhou, X.; Leung, D.W.; Lloyd, S. Experimental realization of a quantum algorithm. Nature 1998, 393, 143–146. [Google Scholar] [CrossRef]
Scholz, M.; Aichele, T.; Ramelow, S.; Benson, O. Deutsch–Jozsa Algorithm Using Triggered Single Photons from a Single Quantum Dot. Phys. Rev. Lett. 2006, 96, 180501. [Google Scholar] [CrossRef]
Mohseni, M.; Lundeen, J.S.; Resch, K.J.; Steinberg, A.M. Experimental Application of Decoherence-Free Subspaces in an Optical Quantum-Computing Algorithm. Phys. Rev. Lett. 2003, 91, 187903. [Google Scholar] [CrossRef]
GuiLu, L.; WeiLin, Z.; YanSong, L.; Li, N. Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover’s Quantum Search Algorithm. Commun. Theor. Phys. 1999, 32, 335–338. [Google Scholar] [CrossRef]
Long, G.L.; Li, Y.S.; Zhang, W.L.; Tu, C.C. Dominant gate imperfection in Grover’s quantum search algorithm. Phys. Rev. A 2000, 61, 042305. [Google Scholar] [CrossRef]
Long, G.L. Grover algorithm with zero theoretical failure rate. Phys. Rev. A 2001, 64, 022307. [Google Scholar] [CrossRef]
Hsu, L.Y. Quantum secret-sharing protocol based on Grover’s algorithm. Phys. Rev. A 2003, 68, 022306. [Google Scholar] [CrossRef]
Wang, C.; Hao, L.; Song, S.Y.; Long, G.L. Quantum direct communication based on quantum search algorithm. Int. J. Quant. Inform. 2010, 8, 443–450. [Google Scholar] [CrossRef]
Hao, L.; Li, J.; Long, G. Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution. Sci. China Phys. Mech. Astron. 2010, 53, 491–495. [Google Scholar] [CrossRef]
Hao, L.; Wang, C.; Long, G.L. Quantum secret sharing protocol with four state Grover algorithm and its proof-of-principle experimental demonstration. Opt. Commun. 2011, 284, 3639–3642. [Google Scholar] [CrossRef]
Feng, M. Grover search with pairs of trapped ions. Phys. Rev. A 2001, 63, 052308. [Google Scholar] [CrossRef]
Beterov, I.I.; Ryabtsev, I.I.; Tretyakov, D.B.; Entin, V.M. Quasiclassical calculations of blackbody-radiation-induced depopulation rates and effective lifetimes of Rydberg nS, nP, and nD alkali-metal atoms with n ≤ 80. Phys. Rev. A 2009, 79, 052504. [Google Scholar] [CrossRef]
Wintermantel, T.M.; Wang, Y.; Lochead, G.; Shevate, S.; Brennen, G.K.; Whitlock, S. Unitary and Nonunitary Quantum Cellular Automata with Rydberg Arrays. Phys. Rev. Lett. 2020, 124, 070503. [Google Scholar] [CrossRef]
Li, D.X.; Yang, C.; Shao, X.Q. Dissipative engineering of a tripartite Greenberger-Horne-Zeilinger state for neutral atoms. Quantum Eng. 2021, 3, e66. [Google Scholar] [CrossRef]

Figure 1. Schematic illustrations for the setup and atomic levels of the three-Rydberg-atom system. Each atom includes two ground states

| 0, 1 〉

and one Rydberg state

| r 〉

. The Rydberg state is dispersively coupled to the ground states via one common Rydberg pulse with effective Rabi frequency

Ω \approx 2 π \times 3.5

MHz and adjustable detuning

δ

. The Rydberg–Rydberg interaction between the i- and j-th atoms is described as

U_{i j}

Figure 1. Schematic illustrations for the setup and atomic levels of the three-Rydberg-atom system. Each atom includes two ground states

| 0, 1 〉

and one Rydberg state

| r 〉

. The Rydberg state is dispersively coupled to the ground states via one common Rydberg pulse with effective Rabi frequency

Ω \approx 2 π \times 3.5

MHz and adjustable detuning

δ

. The Rydberg–Rydberg interaction between the i- and j-th atoms is described as

U_{i j}

Figure 2. (a) The average gate fidelity with respect to

δ

as well as the gate operation time, where the system is governed by the full Hamiltonian of Equation (1) to realize the gate of Equation (4). (b) The average gate fidelity without the three single qubit logical gates as functions of

δ

and t. For the two sub-pictures, the Rabi frequencies and the interaction strengths are

Ω = 2 π \times 3.5

MHz and

U_{i j} = U \approx 2 π \times 35

MHz corresponding the atomic distance

r_{i j} = r \approx 5.4

μ

Figure 2. (a) The average gate fidelity with respect to

δ

δ

and t. For the two sub-pictures, the Rabi frequencies and the interaction strengths are

Ω = 2 π \times 3.5

MHz and

U_{i j} = U \approx 2 π \times 35

MHz corresponding the atomic distance

r_{i j} = r \approx 5.4

μ

Figure 3. Contour plot of average gate fidelity of

U_{B 1}^{3}

with respect to the detuning and the gate operation time. The relevant parameters are the same as those of Figure 2a.

Figure 3. Contour plot of average gate fidelity of

U_{B 1}^{3}

with respect to the detuning and the gate operation time. The relevant parameters are the same as those of Figure 2a.

Figure 4. Fidelity of the state searched for as functions of the iteration number with different Rydberg–Rydberg interaction strength. The marked state is

| 101 〉

and the initial state is

| 000 〉

. The relevant parameters are the same as those of Figure 2a and the gate operation time for

C (t)

is set as

0.8049

μ

s. For simplicity, the Rydberg–Rydberg interaction strength between the i- and j-th atom are assumed as

U_{i j} = U

Figure 4. Fidelity of the state searched for as functions of the iteration number with different Rydberg–Rydberg interaction strength. The marked state is

| 101 〉

and the initial state is

| 000 〉

. The relevant parameters are the same as those of Figure 2a and the gate operation time for

C (t)

is set as

0.8049

μ

s. For simplicity, the Rydberg–Rydberg interaction strength between the i- and j-th atom are assumed as

U_{i j} = U

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

Share and Cite

MDPI and ACS Style

Tang, S.; Yang, C.; Li, D.; Shao, X. Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates. Entropy 2022, 24, 1371. https://doi.org/10.3390/e24101371

AMA Style

Tang S, Yang C, Li D, Shao X. Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates. Entropy. 2022; 24(10):1371. https://doi.org/10.3390/e24101371

Chicago/Turabian Style

Tang, Shiqing, Chong Yang, Dongxiao Li, and Xiaoqiang Shao. 2022. "Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates" Entropy 24, no. 10: 1371. https://doi.org/10.3390/e24101371

APA Style

Tang, S., Yang, C., Li, D., & Shao, X. (2022). Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates. Entropy, 24(10), 1371. https://doi.org/10.3390/e24101371

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Menu

Implementation of Quantum Algorithms via Fast Three-Rydberg-Atom CCZ Gates

Abstract

1. Introduction

2. Principle of the Fast Three-Rydberg-Atom CCZ Gate

3. Applications of Quantum Algorithms

3.1. Refined Deutsch–Jozsa Algorithm

3.2. Grover Search

4. Discussion and Summary

Author Contributions

Funding

Data Availability Statement

Conflicts of Interest

Appendix A

References

Share and Cite

Article Metrics

Article Access Statistics

Further Information

Guidelines

MDPI Initiatives

Follow MDPI