Surpassing the classical limit in magic square game with distant quantum dots coupled to optical cavities

Abstract

The emergence of quantum technologies is heating up the debate on quantum supremacy, usually focusing on the feasibility of looking good on paper algorithms in realistic settings, due to the vulnerability of quantum systems to myriad sources of noise. In this vein, an interesting example of quantum pseudo-telepathy games that quantum mechanical resources can theoretically outperform classical resources is the Magic Square game (MSG), in which two players play against a referee. Due to noise, however, the unit winning probability of the players can drop well below the classical limit. Here, we propose a timely and unprecedented experimental setup for quantum computation with quantum dots inside optical cavities, along with ancillary photons for realizing interactions between distant dots to implement the MSG. Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology, outperforming the classical resources under realistic conditions. Next, we show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness, and increase his winning probability. We believe our work contributes to not only quantum game theory, but also quantum computing with quantum dots.

Introduction

Quantum mechanical resources can enable some tasks such as superdense coding and teleporting an unknown state1 which are impossible to realize with classical resources. Many approaches to optimizing quantum resources for efficient quantum computation and quantum communication such as gate-model, quantum channel capacity, optimizing quantum memory, and algorithms have been studied2,3,4,5,6,7,8,9,10,11,12. On the other hand, speeding up classically possible computational tasks which are beyond the ability of any classical computer such as unsorted database search and factorization1 and some other devoted efforts13,14,15 in achieving supremacy have been attracting an intense attention. One of the most groundbreaking advances in quantum technologies is the recent claim of Google that they have achieved quantum supremacy16.

Surpassing the classically achievable limit in various tasks is also in the center of attraction. For example in quantum metrology, surpassing the classical shot noise limit has been studied extensively under various scenarios taking into account the standard decoherence channels and thermal noise17,18,19,20,21,22,23. Quantum resources also enable advantages in thermodynamics24,25,26,27. Quantum games—where “everyone wins”28, provide an interesting playground for investigating the advantages of utilizing various quantum weirdness over classical resources. Among quantum pseudo-telepathy games where quantum mechanical resources can theoretically outperform classical resources, a widely studied one is the so-called Magic Square game (MSG), in which two players, say Alice and Bob, play against a referee. In the MSG, players are allowed to communicate, share any resources and agree on any strategy, only until the game starts. The game is played on a \(3 \times 3\) square matrix with binary entries. Once the game starts, referee gives numbers a and b to Alice and Bob, respectively, where \(a, b \in \{1, 2, 3\}\). Alice fills row a and Bob fills column b, i.e. each tell referee the numbers to fill. They win if the sum of numbers in row a (column b) is even (odd) and the intersecting element is the same. Otherwise, they lose, i.e. the referee wins. Let us illustrate one of the nine possible instances that referee gives Alice \(a=2\), and Bob \(b=3\). They will win if they can fill the row and column as \(\{0,0,0\},\{0,0,1\}\), respectively, or \(\{0,1,1\},\{0,1,0\}\), for example, resulting in two possible winning instances (i) and (ii) given in Table  1.

Table 1 Two possible winning instances for players Alice and Bob, if they are given \(a=2\) and \(b=3\), respectively. They will win if Alice can fill the second row as \(\{0,0,0\}\) and Bob the third column as \(\{0,0,1\}\), or \(\{0,1,1\}\) and \(\{0,1,0\}\) corresponding to the final matrices shown on left (i) and right (ii), respectively.

The shortcoming of utilizing classical resources in playing the MSG is that no matter what strategy they choose, the players can win against the referee only in eight cases out of nine, resulting in the average winning probability 8/9. However, this winning probability could theoretically achieve unity if they could have shared a four-qubit entangled state given in Eq. (1), and applied an appropriate quantum strategy29.

$$\begin{aligned} |\phi \rangle = {1 \over 2} ( |0011\rangle + |1100\rangle - |0110\rangle - |1001\rangle ), \end{aligned}$$
(1)

where Alice holds the first two qubits and Bob holds the third and fourth qubits. This four qubit state is actually the composition of two EPR (Einstein–Podolsky–Rosen) pairs in the form \({1 \over \sqrt{2} }( |01\rangle - |10\rangle ) \otimes {1 \over \sqrt{2} }( |01\rangle - |10\rangle )\), each shared by Alice and Bob, such that Alice (Bob) possesses the first and third (second and fourth) qubits. The strategy they determine before the game starts is as follows. According to the row (column) number given by the referee, Alice (Bob) applies one of the three two-qubit operations \(A_a\) (\(B_b\)), where \(a, b \in \{1, 2, 3\}\), given in Eqs. (2) and (3). That is, following the above example, Alice applies \(A_2\), and Bob applies \(B_3\).

$$\begin{aligned} A_1 =\,{1 \over \sqrt{2}} \left( \begin{array}{cccc} i &{} \ \ 0 &{} 0 &{} 1 \\ 0 &{} -i &{} 1 &{} 0 \\ 0 &{} \ \ i &{} 1 &{} 0 \\ 1 &{} \ \ 0 &{} 0 &{} i \\ \end{array} \right) \!\!\! , \ \ \ \ A_2 = {1 \over 2} \left( \begin{array}{cccc} \ \ i &{} 1 &{} \ \ 1 &{} \ \ i \\ -i &{} 1 &{} -1 &{} \ \ i \\ \ \ i &{} 1 &{} -1 &{} -i \\ -i &{} 1 &{} \ \ 1 &{} -i \\ \end{array} \right) \!\! , \ \ \ \ A_3 = {1 \over 2} \left( \begin{array}{cccc} -1 &{} -1 &{} -1 &{} \ \ 1 \\ \ \ 1 &{} \ \ 1 &{} -1 &{} \ \ 1 \\ \ \ 1 &{} -1 &{} \ \ 1 &{} \ \ 1 \\ \ \ 1 &{} -1 &{} -1 &{} -1 \\ \end{array} \right) \!\! , \end{aligned}$$
(2)
$$\begin{aligned} B_1 =\, {1 \over 2} \left( \begin{array}{cccc} \ \ i &{} -i &{} \ \ 1 &{} \ \ 1 \\ -i &{} -i &{} \ \ 1 &{} -1 \\ \ \ 1 &{} \ \ 1 &{} -i &{} \ \ i \\ -i &{} \ \ i &{} \ \ 1 &{} \ \ 1 \\ \end{array} \right) \!\! , \ \ \ \ B_2 = {1 \over 2} \left( \begin{array}{cccc} -1 &{} \ \ i &{} 1 &{} \ \ i \\ \ \ 1 &{} \ \ i &{} 1 &{} -i \\ \ \ 1 &{} -i &{} 1 &{} \ \ i \\ -1 &{} -i &{} 1 &{} -i \\ \end{array} \right) \!\! , \ \ \ \ B_3 = {1 \over \sqrt{2}} \left( \begin{array}{cccc} \ \ 1 &{} 0 &{} \ \ 0 &{} 1 \\ -1 &{} 0 &{} \ \ 0 &{} 1 \\ \ \ 0 &{} 1 &{} \ \ 1 &{} 0 \\ \ \ 0 &{} 1 &{} -1 &{} 0 \\ \end{array} \right) \!\!. \end{aligned}$$
(3)

Next, measuring their qubits, each obtains two classical bits and determine the third bit according to the parity conditions. Note that the measurement of each party do not provide a single result, but one of the possible results with some probability. However, thanks to the entangled state and quantum strategy, in the ideal case where there is no noise and experimental imperfections, the results of Alice and Bob are found to be both satisfying the parity conditions and that the intersecting number is the same. Following the same example (\(a=2\), \(b=3\)), in addition to two instances given in Table 1, the instances (iii) through (viii) given in Table 2 could occur each with 1/8 probability, summing up to unity. For a more detailed example, let us take instance (iv), that after applying \(A_2\) and \(B_3\), measurement results yield two classical bits \(\{0,1\}\) for Alice and \(\{1,1\}\) for Bob. To satisfy the parity conditions, Alice extends her two-bit string to \(\{0,1,1\}\), and Bob to \(\{1,1,1\}\).

Table 2 Given \(a=2\) for Alice and \(b=3\) for Bob under ideal conditions, in addition to two possible winning instances given in Table 1, any of these six winning instances can occur each with probability 1/8 by applying \(A_2\) and \(B_3\) and performing the measurement.

However, quantum systems are very fragile that any source of imperfections during the process might affect the performance of the task, and the MSG is of no exception. Gawron et al.’s work on the noise effects in the MSG30 clearly showed that if qubits hold by Alice and Bob are subject to noise, that their four-qubit state is not the pure state in Eq. (1) but rather a mixed state, the average winning probability decreases and with increasing noise, the probability can drop well below the classical limit 8/9. This work was followed by others in various settings31,32,33,34,35. Hence, although quantum advantage is imminent in theory, it is of great interest to design a physical system to bring this advantage to life and investigate the conditions for surpassing the classically achievable limit.

In this work, addressing this problem, we propose a few nanometer-sized silicon single quantum dots (SQDs)36,37,38 with bandgap small enough to allow spin-photon interaction based setup within the reach of current technology. Electron spins confined in quantum dots provide a promising basis for quantum computation with potential for scaling and reasonably long coherence time39,40,41,42,43. In the basic proposal39, single spins form a logical basis with a single qubit operation via spin resonance. The silicon-based quantum dot has been studied intensively and attracted great interest thanks to its charge offset stability and compatibility with CMOS and quantum information technology44,45,46,47,48,49. Hence, progressive approaches based on quantum dots have been proposed in various areas of quantum information such as preparing multipartite entanglement via Pauli spin blockade in double quantum dot system50, and coupling photonic and electronic qubits in microcavity systems51,52. What is more, coupling quantum dots to nanophotonic waveguide53, and optical microcavity54 for quantum information processing have recently been experimentally demonstrated. By considering various physical imperfections, we first show that the MSG can be implemented in a quantum system outperforming the classical resources under realistic conditions. Next, thanks to our physical analysis, we design a new version of the game, that having information on the physical realization and strategy of the players, in order to decrease their winning probability, referee can bias the game.

Figure 1
figure1

Extending each two-qubit operation on two spin qubits denoted as \(q_1\) and \(q_2\), to a three-qubit operation via an ancillary photon, so that any two-qubit operation could be realized on spatially separated spin qubits.

Results

Our setup is based on quantum computation with quantum dots coupled to spatially separated optical cavities. In our setup, each spin of a quantum dot constituting each logical qubit of Alice and Bob is coupled to the optical field of the cavity. Introducing ancillary photons, quantum operations on two distant qubits of each player are realized through photon-spin interactions. That is, as illustrated in Fig. 1 each two-qubit operation on logical qubits is extended to an equivalent three-qubit operation which is realized by only single-qubit operations on photons or spins, and two-qubit operations on photon-spin pairs. As already considered in many works55 and explained in Methods section, our configuration realizes a controlled-phase \(CP(\pi -\theta )\) gate between spin and photon, which reduces to a controlled-Z (CZ) gate in the ideal condition for \(\theta =0\), with \(CZ=CP(\pi )\). Hence, before considering physical imperfections and taking into account the effect of finite \(\theta\) on winning probability, we first decompose each two-qubit unitary operation in terms of single-qubit gates (detailed in Methods section) and CZ gates, and then extend the decomposed two-qubit circuits to three-qubit circuits.

As controlled-Not (CNOT) gates with single qubit gates constitute a universal set, any unitary operation can be decomposed in terms of these gates1,56. What is more, a CNOT is equivalent to a \(\mathrm{CZ}\) up to two Hadamard (Had) gates applied to the target qubit before and after the \(\mathrm{CZ}\) gate, i.e. \(CNOT^{1,2} \equiv Had^2.CZ.Had^2\), where the superscript of single qubit gates represent which qubit it is applied to, and we use \(\mathrm{CNOT}^{1,2}\) for the first qubit being the control and second qubit being the target qubit, and \(\mathrm{CNOT}^{2,1}\) for the opposite case. For each operation \(A_a\) (and \(B_b\)), we find the decomposition \(A^d_a\) in terms of \(\mathrm{CNOT}\) and single qubit gates, and then the extension to three-qubit circuit \(A^e_a\), and finally the circuit \(A^{CZ}_a\) consisting of only \(\mathrm{CZ}\) and single qubit gates. We are now ready to present the decompositions we find for the two-qubit operations given in Eqs. (2) and (3), as

Figure 2
figure2

Circuit diagrams for realizing the operations of players. Blue H gate represent a Hadamard gate, purple gates represents Controlled-Z (CZ) gate or \(R_x\), \(R_y\), and \(R_z\) gates which are rotation around x, y, and z axis, respectively. Referee gives the row number a to Alice and column number b to Bob. Alice applies \(A_a\) and Bob applies \(B_b\), each to his/her two spin qubits (\(q_1\) and \(q_2\)) in distant optical cavities through an ancillary photon. As the photon passes through the cavity, the interaction realizes a CZ operation between the photon and spin in the ideal conditions. We used IBM qiskit57 to draw our decomposed circuit diagrams.

Figure 3
figure3

Proposed experimental setup for playing the game. Referee gives the number of row a (column b) to Alice (Bob) to fill with binary entries. The initial four-qubit state given in Eq. (1) is a composition of two EPR pairs (one illustrated with red and the other with green circles) shared by Alice and Bob. Each quantum dot (red or green circles) coupled to an optical cavity (blue toroids) constitutes one logical qubit. Following the extension strategy in Fig. 1, each two-qubit operation (given in Eqs. 2 and 3 ) on the logical qubits (distant quantum dots) is realized via an ancillary photon traveling between the optical cavities as: Following a SWAP operation between the photon and the spin coupled to the first cavity, the photon is sent to the second cavity to realize the desired operation. “Operations” represent the overall operations as decomposed in Eqs. (2) red and (3), each containing single qubit operations, and one or two CZ operations. Each CZ is realized through the interaction between ancillary photon and second spin qubit, \(q^A_2\) (or \(q^B_2\)). Each “Op” represents either an identity operator, or a set of single qubit operations on photonic or spin qubit. After the “Operations”, the photon is sent back to the first cavity for swapping back the quantum state with the spin qubit. Two-spin qubits of each party are now ready to be measured for obtaining the binary entries.

$$\begin{aligned} A^d_1=\, & {} e^{ - {7\pi \over 8} i} R_z^1({\pi / 4}).CNOT^{2,1}. R_z^2({7\pi / 4}) . R_x^2({\pi / 2}). R_z^1({7\pi / 4}). CNOT^{2,1}. R_z^1({\pi / 2}). R_y^1({\pi }). R_z^2({3\pi / 2}). R_y^2({\pi }), \end{aligned}$$
(4)
$$\begin{aligned} A^d_2\,= \,& {} R_y^1({\pi / 2}) . R_z^2({\pi }) . CNOT^{1,2} . R_z^1({\pi / 2}). R_y^1({\pi }) . R_z^2({\pi }). R_y^2({\pi / 2}) . R_z^2({ 3 \pi / 2}), \end{aligned}$$
(5)
$$\begin{aligned} A^d_3\,=\, & {} R_z^1(\pi ) . R_y^1(\pi / 2) . CNOT^{1,2} . R_y^1(\pi /2). R_z^1(\pi ) . R_y^2(\pi ), \end{aligned}$$
(6)
$$\begin{aligned} B^d_1\,=\, & {} e^{ {7\pi \over 8} i} R_x^2(3 \pi / 2) . R_y^2(3 \pi / 4) . CNOT^{1,2} . R_z^1(\pi / 4) . R_y^1(3 \pi / 2). R_y^2(3 \pi / 2). CNOT^{1,2} . R_z^1(2 \pi ) . R_z^2(3 \pi / 2) . R_y^2(\pi ), \end{aligned}$$
(7)
$$\begin{aligned} B^d_2\,=\, & {} e^{i \pi } R_y^1( \pi / 2). R_y^2( \pi / 2). R_z^2(3 \pi / 2). CNOT^{1,2} . R_z^1(3 \pi / 2). R_z^2( \pi ),\end{aligned}$$
(8)
$$\begin{aligned} B^d_3\,=\, & {} R_y^1( \pi / 2). R_z^2( \pi ). R_y^2( \pi ). CNOT^{1,2}. R_y^1( \pi / 2). R_z^1( \pi ) . R_y^2( \pi / 2). \end{aligned}$$
(9)

Unlike other four operations, requiring not one but two CNOT gates in the decomposition, \(A_1\) and \(B_1\) are going to play a significant role in the physical realization of the task, and give rise to a new version of the game.

For extending the decomposed two-qubit (spin–spin) circuits to three-qubit (spin–photon–spin) circuits as illustrated in Fig. 1, we will make use of two-qubit SWAP gates, which can be realized as \(SWAP \equiv CNOT^{1,2}.CNOT^{2,1}.CNOT^{1,2}\). Our strategy for realizing the interaction between two spins via a three-qubit operation using only two-qubit gates is as follows. For each player, the ancillary photon is sent to the first cavity to interact several times. Before and after each interaction which realizes a CZ gate between the photon and the spin, Hadamard gates are applied to both qubits appropriately, so that three CNOT gates equivalent to a SWAP gate are realized. That is, quantum states of the first spin and ancillary photon are swapped. The photon is then sent to the other cavity containing the second spin. Through interactions realizing CZ gates, and single qubit operations on spin and photon, the actual operation is realized. Finally, the photon is sent back to the first cavity to swap back the quantum state with the spin. The overall operation is equivalent to the corresponding two-qubit operation of the player. We illustrate the circuit diagram for each overall operation in Fig. 2, red and the corresponding experimental setup in Fig. 3.

We start with the initial state (in Eq. 1) and two ancillary photons each in \(|0\rangle\) state in the physical order of qubits as \(Alice^1, Ancilla^{A}, Alice^2\) and \(Bob^1,Ancilla^B,Bob^2\), which can be written as

$$\begin{aligned} |\Psi \rangle =\, (SWAP \otimes id \otimes id \otimes SWAP) .(|0\rangle ^{A} \otimes |\phi \rangle \otimes |0\rangle ^{B}), \end{aligned}$$
(10)

where id is the single qubit identity operator. Note first that this writing is only for the sake of clarity to explain the physical order of the qubits, hence the SWAP operations in Eq. (10) are not taken into account in the physical realization. Note also that for simplicity in tracing out operations during calculations, we start by swapping the ancillary photon with the first photon of Alice, while we swap the ancillary photon with the second photon of Bob. With \(a,b \in \{1,2,3\}\), extended three-qubit operations \(A^e_a\) and \(B^e_b\) are defined as

$$\begin{aligned} A^e_a\,=\, & {} (SWAP \otimes id) . (id \otimes A^d_a). (SWAP \otimes id), \end{aligned}$$
(11)
$$\begin{aligned} B^e_b\,=\, & {} (id \otimes SWAP) . (B^d_b \otimes id). (id \otimes SWAP). \end{aligned}$$
(12)

Upon receiving the number a (b) from the referee, Alice (Bob) applies the operation \(A^e_a\) (\(B^e_b\)). Next step is to trace out the ancillary qubits, and finally perform the measurements. Under ideal conditions, as the ancillary qubits are back in their initial \(|0\rangle\) states separable from the logical qubits, tracing them out will not disturb them. Note that as these measurements are not Bell measurements, they can be performed on distant spin qubits separately.

Physical imperfections

Neglecting the imperfections such as the decoherence or absorption of photons between distant cavities, major physical imperfections we take into account in this analysis are due to Q-factor of the chosen optical cavity, coherence of qubits and the coupling, which all contribute to the imperfection in the desired operation between spin qubits and photon qubits. In general, according to the technology used, the realized operation might deviate from the ideal \(CZ \equiv CP(\pi )\) to \(CP(\pi -\theta )\). Following our decomposition and extension, it is straightforward to take this effect into account by simply replacing each CZ in the circuits with \(CP(\pi -\theta )\). This time, final states of the ancillary qubits will not be \(|0\rangle\), and measurement result on each qubit pair will not yield 1/8, but rather a function of \(\theta\). We plot the success probability \(P_s\) for each \(\{a,b\}\) in Fig. 4. As we expected, \(a=1\) and \(b=1\) is the worst case for players. On the contrary to the other cases, the decompositions of both \(A_1\) and \(B_1\) contain not one but two CNOT gates, they require two imperfect CZ gates in the realistic settings, which lead to a potential new version of MSG.

Discussion

Following the usual scenarios in quantum games, we assumed that Alice and Bob initially shared the ideal state given in Eq. (1), and did not take into account the imperfections in preparing the state, which could slightly decrease the overall success probabilities. However, as the initial state consists of two Bell states, its preparation is straightforward58,59. On the other hand, Alice and Bob could choose to prepare the initial state not based on four spin qubits, but two being the photonic qubits. Hence, the first SWAP gate (i.e. the imperfect CZ gates to realize it) could be removed, this time increasing the overall success probability.

For realizing the interaction between the incident photon and the spin qubit in not only in quantum dots but in also nitrogen-vacancy centers in diamond, and also atomic qubits, various optical microcavities are considered. Achieving ultra-high quality factor, microtoroid resonators with whispering gallery modes are promising60,61,62,63. Single-sided or double-sided cavities even with small Q-factors64,65 are also shown to be candidates for realizing atom-photon or spin-photon interactions with high success rate, enabling myriad quantum information processing tasks from entanglement generation to quantum teleportation (see Refs.58,59,66,67 and references therein).

Note that, our particular setup herein is robust because due to Eq. (18), the parameter \(\theta\) can take only two values, \(\pi\), or 0, the latter being either for realizing the desired operation according to the conditions (as explained in the Methods section), or deviating from \(\pi\) only in the extremely imperfection conditions such as \(g \ll 5 \sqrt{\kappa \gamma }\) (where g is the coupling strength of the cavity to the quantum dot, \(\kappa\) is the cavity decay rate and \(\gamma\) is the quantum dot spin decay rate), which is not anticipated with high-Q resonators. However, our analysis on the affect of physical imperfections on the success probability is more general for realization in any technology where the interaction yields the operation \(CP(\pi -\theta )\) with a finite \(\theta\).

Our analysis showed that, if some of the possible cases for realizing a task requires more complicated operations, new versions of the task could arise. Suppose Alice and Bob are playing MSG against a referee, with the present experimental setup following our decomposition. Then the question lying in the heart of game theory is, whether the referee has information on their setup and strategy. If so, in order to decrease the winning probability of the players (that is increasing the own winning probability), instead of each round with an evenly distributed random numbers a and b for the row and column, respectively, the referee can tend to choose always \(a=1\) or \(b=1\), and even \(a=b=1\).

In summary, taking into account possible physical imperfections, we proposed a physical setup for playing MSG feasible with the current technology. We found the limits of imperfections for surpassing the classical winning probability. We also showed that, depending on the partial information, the referee can bias the game to increase his/her winning probability, which gives rise to a new version of the Magic Square game.

Figure 4
figure4

Success probability \(P_s\) as a function of \(\theta\) for each pair of numbers \(\{a, b\}\) referee can give Alice and Bob for filling the row and column, respectively, with binary entries. Here, \(\theta\) represents the imperfection of the interaction between the logical qubit and the ancillary qubit, i.e. realizing not the desired \(CZ \equiv CP(\pi )\) but \(CP(\pi -\theta )\) operation. Operations \(A_1\) and \(B_1\) (corresponding to \(a=1\) and \(b=1\), respectively) are more complex than others that they contain more controlled operations, i.e. \(CP(\pi -\theta )\). Hence, success probability of players decreases faster for \(a=1\) or \(b=1\), and the fastest for \(a=b=1\).

Methods

A quantum dot coupled to an optical cavity can be coupled to the cavity mode, and the interaction between the cavity and the quantum dot spin is governed by Jaynes-Cummings model with the Hamiltonian

$$\begin{aligned} H = \sum _{j=R,L} [ {\omega _{j0} \over 2} \sigma _{jz} + \omega _{jC} a^{\dagger }_j a_j + i g_j(a_j \sigma _{j+} - a^{\dagger }_j \sigma _{j-})] + H_R, \end{aligned}$$
(13)

where \(a^{\dagger }\) and a are the creation and annihilation operators of the cavity field, respectively. R and L denote the circular polarizations of the photon, associated with the optical transitions in the quantum dot (see Fig. 5) and index j runs for R and L. \(\omega _0\) and \(\omega _C\) are the transition frequencies of the electronic energy levels and the frequency of the cavity field, \(\sigma _+\), \(\sigma _-\) and \(\sigma _z\) are the raising, lowering and inversion operators of the quantum dot spin between the two corresponding levels, respectively. The Hamiltonian for the field and atomic reservoirs are denoted by \(H_R\), and we take \(\hslash =1\). Applying a magnetic field, non-zero spin level splitting can be achieved, so that R and L polarized photons receive different phase shifts upon the interaction with the quantum dot-cavity system58, as explained below.

When an incident photon with frequency \(\omega _p\) is introduced to the cavity, the Langevin equations for a and \(\sigma _-\) can be obtained for the low temperature reservoir and neglecting the vacuum input field, as

$$\begin{aligned} { \text {d} a_j \over \text {d}t} = [ i (\omega _p - \omega _C) - { \kappa \over 2} ] a_j(t) - g\sigma _{j-}(t) - \sqrt{\kappa } a_{j, in} (t), \end{aligned}$$
(14)
$$\begin{aligned} { \text {d} \sigma _{j-} \over \text {d}t} = [ i (\omega _p - \omega _0) - { \gamma \over 2} ] \sigma _{j-}(t) - g\sigma _{j,z}(t) a_{j} (t), \end{aligned}$$
(15)

where g is the coupling strength of the cavity to the quantum dot, \(\kappa\) is the cavity decay rate and \(\gamma\) is the quantum dot spin decay rate. Assuming weak assumption limit \(\langle \sigma _z \rangle = -1\) and adiabatically eliminating the cavity mode, the reflection coefficient for the input photon pulse is found as59,68

$$\begin{aligned} r(\omega _p) = { [ i (\omega _C - \omega _p) - {\kappa \over 2} ] [ i (\omega _0 - \omega _p) + {\gamma \over 2} ] + g^2 \over [ i (\omega _C - \omega _p) + {\kappa \over 2} ] [ i (\omega _0 - \omega _p) + {\gamma \over 2} ] + g^2 }. \end{aligned}$$
(16)

If the quantum dot is uncoupled from the cavity, the reflection coefficient for the input photon becomes

$$\begin{aligned} r_0(\omega _p) = { i (\omega _C - \omega _p) - {\kappa \over 2} \over i (\omega _C - \omega _p) + {\kappa \over 2} }. \end{aligned}$$
(17)

The reflection coefficients can be obtained for the resonant condition \(\omega _p=\omega _0=\omega _C\) as

$$\begin{aligned} r(\omega _p) = { - \kappa \gamma + 4 g^2 \over \kappa \gamma + 4 g^2 }, \ \ \text {and} \ \ r_0(\omega _p) = -1. \end{aligned}$$
(18)
Figure 5
figure5

\(\Lambda\) type optical transitions possible in a quantum dot. The transitions \(|-\rangle \leftrightarrow |e\rangle\) and \(|+\rangle \leftrightarrow |e\rangle\) are associated with the left and right polarization of the photon, denoted as \(|L\rangle\) and \(|R\rangle\) respectively.

Due to the spin-dependent optical transition rules55 as simply illustrated in Fig. 5, and optical Faraday rotation, an \(|R\rangle\) polarized incident photon receives a phase shift \(e^{i \phi _0}\) because, due to large level splitting, the spin state of the quantum dot is decoupled from the incident pulse58. However, if the incident photon is \(|L\rangle\) polarized, it will receive a phase shift \(e^{i \phi }\) (\(e^{i \phi _0}\)) depending on the spin state of the quantum dot \(|-\rangle\) \((|+\rangle )\), where \(\phi\) and \(\phi _0\) are the arguments of \(r(\omega _p)\) and \(r_0(\omega _p)\), respectively. For the resonant condition, and \(g > 5 \sqrt{\kappa \gamma }\), one approximately finds \(\phi =0\) and \(\phi _0=\pi\). Placing a \(\pi\) phase shifter to the photon reflection path, a controlled-Z gate between the electronic spin of the quantum dot and the incident photon is realized as \(|R\rangle |+\rangle \rightarrow |R\rangle |+\rangle\), \(|R\rangle |-\rangle \rightarrow |R\rangle |-\rangle\), \(|L\rangle |+\rangle \rightarrow |L\rangle |+\rangle\), \(|L\rangle |-\rangle \rightarrow -|L\rangle |-\rangle\). The implementations of single qubit operations on spins and incident photons can be realized effectively and with high fidelity via electric pulses69 and half wave plates70, respectively. One- and two-qubit operations we use in this work are

$$\begin{aligned} \text {CNOT} = \left( \begin{array}{cccc} 1 &{} 0 &{} 0 &{} 0 \\ 0 &{} 1 &{} 0 &{} 0 \\ 0 &{} 0 &{} 0 &{} 1 \\ 0 &{} 0 &{} 1 &{} 0 \\ \end{array} \right) , \ \ \ CP( \theta ) = \left( \begin{array}{cccc} 1 &{} 0 &{} 0 &{} 0 \\ 0 &{} 1 &{} 0 &{} 0 \\ 0 &{} 0 &{} 1 &{} 0 \\ 0 &{} 0 &{} 0 &{} \exp ({i \pi \theta })\\ \end{array} \right) , \end{aligned}$$
(19)
$$\begin{aligned} R_x( \theta ) = \left( \begin{array}{cc} \cos {\theta \over 2} &{} i \sin {\theta \over 2} \\ i \sin {\theta \over 2} &{} \cos {\theta \over 2} \\ \end{array} \right) ,\ \ \ R_y( \theta ) = \left( \begin{array}{cc} \cos {\theta \over 2} &{} \sin {\theta \over 2} \\ - \sin {\theta \over 2} &{} \cos {\theta \over 2} \\ \end{array} \right) ,\ \ \ R_y( \theta ) = \left( \begin{array}{cc} \exp ({i \theta \over 2}) &{} 0 \\ 0 &{} \exp ({ - i \theta \over 2}) \\ \end{array} \right) . \end{aligned}$$
(20)

References

  1. 1.

    Nielsen, M. A. & Chuang, I. L. Quantum computation and quantum information. Phys. Today 54, 60 (2001).

    Google Scholar 

  2. 2.

    Gyongyosi, L. & Imre, S. A survey on quantum computing technology. Comput. Sci. Rev. 31, 51–71 (2019).

    MathSciNet  Article  Google Scholar 

  3. 3.

    Gyongyosi, L., Imre, S. & Nguyen, H. V. A survey on quantum channel capacities. IEEE Commun. Surv. Tutor. 20, 1149–1205 (2018).

    Article  Google Scholar 

  4. 4.

    Gyongyosi, L. & Imre, S. Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices. Sci. Rep. 10, 135 (2020).

  5. 5.

    Gyongyosi, L. & Imre, S. Circuit depth reduction for gate-model quantum computers. Sci. Rep. 10, 1–17 (2020).

    Article  CAS  Google Scholar 

  6. 6.

    Gyongyosi, L. Quantum state optimization and computational pathway evaluation for gate-model quantum computers. Sci. Rep. 10, 2 (2020).

    Article  CAS  Google Scholar 

  7. 7.

    Gyongyosi, L. & Imre, S. Dense quantum measurement theory. Sci. Rep. 9, 2 (2019).

    Article  CAS  Google Scholar 

  8. 8.

    Gyongyosi, L. & Imre, S. Quantum circuit design for objective function maximization in gate-model quantum computers. Quantum Inf. Process. 18, 225 (2019).

    ADS  MathSciNet  Article  Google Scholar 

  9. 9.

    Gyongyosi, L. & Imre, S. Training optimization for gate-model quantum neural networks. Sci. Rep. 9, 2 (2019).

    Article  CAS  Google Scholar 

  10. 10.

    Farhi, E., Gamarnik, D. & Gutmann, S. The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002 (2020).

  11. 11.

    Farhi, E., Goldstone, J., Gutmann, S. & Leo, Z. The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size. arXiv preprint arXiv:1910.08187 (2019).

  12. 12.

    Lloyd, S. Quantum approximate optimization is computationally universal. arXiv preprint arXiv:1812.11075 (2018).

  13. 13.

    Harrow, A. W. & Montanaro, A. Quantum computational supremacy. Nature 549, 203–209 (2017).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  14. 14.

    Neill, C. et al. A blueprint for demonstrating quantum supremacy with superconducting qubits. Science 360, 195–199 (2018).

    ADS  MathSciNet  CAS  PubMed  Article  PubMed Central  Google Scholar 

  15. 15.

    Bremner, M. J., Montanaro, A. & Shepherd, D. J. Achieving quantum supremacy with sparse and noisy commuting quantum computations. Quantum 1, 8 (2017).

    Article  Google Scholar 

  16. 16.

    Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).

    ADS  CAS  PubMed  Article  Google Scholar 

  17. 17.

    Pezzé, L. & Smerzi, A. Entanglement, nonlinear dynamics, and the Heisenberg limit. Phys. Rev. Lett. 102, 100401 (2009).

    ADS  MathSciNet  PubMed  Article  CAS  PubMed Central  Google Scholar 

  18. 18.

    Ma, J., Huang, Y.-X., Wang, X. & Sun, C. Quantum fisher information of the Greenberger–Horne–Zeilinger state in decoherence channels. Phys. Rev. A 84, 022302 (2011).

    ADS  Article  CAS  Google Scholar 

  19. 19.

    Erol, V., Ozaydin, F. & Altintas, A. A. Analysis of entanglement measures and locc maximized quantum Fisher information of general two qubit systems. Sci. Rep. 4, 5422 (2014).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  20. 20.

    Ozaydin, F. Phase damping destroys quantum Fisher information of W states. Phys. Lett. A 378, 3161–3164 (2014).

    ADS  CAS  MATH  Article  Google Scholar 

  21. 21.

    Altintas, A. A. Quantum Fisher information of an open and noisy system in the steady state. Ann. Phys. 367, 192–198 (2016).

    ADS  MathSciNet  CAS  MATH  Article  Google Scholar 

  22. 22.

    Ozaydin, F. & Altintas, A. A. Quantum metrology: Surpassing the shot-noise limit with Dzyaloshinskii–Moriya interaction. Sci. Rep. 5, 16360 (2015).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  23. 23.

    Ozaydin, F. & Altintas, A. A. Parameter estimation with Dzyaloshinskii–Moriya interaction under external magnetic fields. Opt. Quantum Electron. 52, 70 (2020).

    Article  Google Scholar 

  24. 24.

    Scully, M. O., Zubairy, M. S., Agarwal, G. S. & Walther, H. Extracting work from a single heat bath via vanishing quantum coherence. Science 299, 862–864 (2003).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  25. 25.

    Türkpençe, D. & Müstecaplıoğlu, Ö. E. Quantum fuel with multilevel atomic coherence for ultrahigh specific work in a photonic carnot engine. Phys. Rev. E 93, 012145 (2016).

    ADS  PubMed  Article  CAS  PubMed Central  Google Scholar 

  26. 26.

    Tuncer, A., Izadyari, M., Dağ, C. B., Ozaydin, F. & Müstecaplıoğlu, Ö. E. Work and heat value of bound entanglement. Quantum Inf. Process. 18, 373 (2019).

    ADS  MathSciNet  Article  Google Scholar 

  27. 27.

    Dag, C. B., Niedenzu, W., Ozaydin, F., Mustecaplıoglu, O. E. & Kurizki, G. Temperature control in dissipative cavities by entangled dimers. J. Phys. Chem. C 123, 4035–4043 (2019).

    CAS  Article  Google Scholar 

  28. 28.

    Ball, P. Everyone wins in quantum games (1999).

  29. 29.

    Brassard, G., Broadbent, A. & Tapp, A. Quantum pseudo-telepathy. Found. Phys. 35, 1877–1907 (2005).

    ADS  MathSciNet  MATH  Article  Google Scholar 

  30. 30.

    Gawron, P., Miszczak, J. & Sładkowski, J. Noise effects in quantum magic squares game. Int. J. Quantum Inf. 6, 667–673 (2008).

    MATH  Article  Google Scholar 

  31. 31.

    Ramzan, M. & Khan, M. Distinguishing quantum channels via magic squares game. Quantum Inf. Process. 9, 667–679 (2010).

    MathSciNet  MATH  Article  Google Scholar 

  32. 32.

    Fialík, I. Noise and the magic square game. Quantum Inf. Process. 11, 411–429 (2012).

    MathSciNet  MATH  Article  Google Scholar 

  33. 33.

    Gawron, P. & Pawela, Ł. Relativistic quantum pseudo-telepathy. Acta Phys. Pol., B 47, 1147 (2016).

    ADS  MathSciNet  MATH  Article  Google Scholar 

  34. 34.

    Pawela, Ł, Gawron, P., Puchała, Z. & Sładkowski, J. Enhancing pseudo-telepathy in the magic square game. PLoS One 8, e64694 (2013).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  35. 35.

    Ozaydin, F. Quantum pseudo-telepathy in spin systems: The magic square game under magnetic fields and the Dzyaloshinskii–Moriya interaction. Laser Phys. 30, 025203 (2020).

    ADS  CAS  Article  Google Scholar 

  36. 36.

    Garoufalis, C., Zdetsis, A. D. & Grimme, S. High level ab initio calculations of the optical gap of small silicon quantum dots. Phys. Rev. Lett. 87, 276402 (2001).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  37. 37.

    Wilcoxon, J., Samara, G. & Provencio, P. Optical and electronic properties of Si nanoclusters synthesized in inverse micelles. Phys. Rev. B 60, 2704 (1999).

    ADS  CAS  Article  Google Scholar 

  38. 38.

    Wolkin, M., Jorne, J., Fauchet, P., Allan, G. & Delerue, C. Electronic states and luminescence in porous silicon quantum dots: The role of oxygen. Phys. Rev. Lett. 82, 197 (1999).

    ADS  CAS  Article  Google Scholar 

  39. 39.

    Loss, D. & DiVincenzo, D. P. Quantum computation with quantum dots. Phys. Rev. A 57, 120 (1998).

    ADS  CAS  Article  Google Scholar 

  40. 40.

    DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G. & Whaley, K. B. Universal quantum computation with the exchange interaction. Nature 408, 339–342 (2000).

    ADS  CAS  PubMed  Article  Google Scholar 

  41. 41.

    Taylor, J. et al. Fault-tolerant architecture for quantum computation using electrically controlled semiconductor spins. Nat. Phys. 1, 177–183 (2005).

    CAS  Article  Google Scholar 

  42. 42.

    Veldhorst, M. et al. An addressable quantum dot qubit with fault-tolerant control-fidelity. Nat. Nanotechnol. 9, 981 (2014).

    ADS  CAS  PubMed  Article  Google Scholar 

  43. 43.

    Leon, R. et al. Coherent spin control of s-, p-, d-and f-electrons in a silicon quantum dot. Nat. Commun. 11, 1–7 (2020).

    ADS  Google Scholar 

  44. 44.

    Zimmerman, N. M., Huber, W. H., Fujiwara, A. & Takahashi, Y. Excellent charge offset stability in a si-based single-electron tunneling transistor. Appl. Phys. Lett. 79, 3188–3190 (2001).

    ADS  CAS  Article  Google Scholar 

  45. 45.

    Fujiwara, A. & Takahashi, Y. Manipulation of elementary charge in a silicon charge-coupled device. Nature 410, 560–562 (2001).

    ADS  CAS  PubMed  Article  Google Scholar 

  46. 46.

    Dutta, A., Oda, S., Fu, Y. & Willander, M. Electron transport in nanocrystalline Si based single electron transistors. Jpn. J. Appl. Phys. 39, 4647 (2000).

    ADS  CAS  Article  Google Scholar 

  47. 47.

    Takahashi, Y., Ono, Y., Fujiwara, A. & Inokawa, H. Silicon single-electron devices. J. Phys.: Condens. Matter 14, R995 (2002).

    ADS  CAS  Google Scholar 

  48. 48.

    Ono, Y., Fujiwara, A., Nishiguchi, K., Inokawa, H. & Takahashi, Y. Manipulation and detection of single electrons for future information processing. J. Appl. Phys. 97, 2 (2005).

    Google Scholar 

  49. 49.

    Bugu, S. et al. RF reflectometry for readout of charge transition in a physically defined PMOS silicon quantum dot. arXiv preprint arXiv:2010.07566 (2020).

  50. 50.

    Bugu, S., Ozaydin, F., Ferrus, T. & Kodera, T. Preparing multipartite entangled spin qubits via pauli spin blockade. Sci. Rep. 10, 1–8 (2020).

    Article  CAS  Google Scholar 

  51. 51.

    Han, X. et al. Effective W-state fusion strategies for electronic and photonic qubits via the quantum-dot-microcavity coupled system. Sci. Rep. 5, 12790 (2015).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  52. 52.

    Li, N., Yang, J. & Ye, L. Realizing an efficient fusion gate for W states with cross-Kerr nonlinearities and QD-cavity coupled system. Quantum Inf. Process. 14, 1933–1946 (2015).

    ADS  MATH  Article  Google Scholar 

  53. 53.

    Uppu, R. et al. On-chip deterministic operation of quantum dots in dual-mode waveguides for a plug-and-play single-photon source. Nat. Commun. 11, 3782 (2020).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  54. 54.

    Najer, D. et al. A gated quantum dot strongly coupled to an optical microcavity. Nature 575, 622–627 (2019).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  55. 55.

    Cheng, L.-Y., Wang, H.-F. & Zhang, S. Simple schemes for universal quantum gates with nitrogen-vacancy centers in diamond. JOSA B 30, 1821–1826 (2013).

    ADS  CAS  Article  Google Scholar 

  56. 56.

    Iten, R. et al. Introduction to universalQcompiler. arXiv preprint arXiv:1904.01072 (2019).

  57. 57.

    Cross, A. The ibm q experience and qiskit open-source quantum computing software. APS 2018, L58-003 (2018).

    Google Scholar 

  58. 58.

    Hu, C., Young, A., O’Brien, J., Munro, W. & Rarity, J. Giant optical faraday rotation induced by a single-electron spin in a quantum dot: Applications to entangling remote spins via a single photon. Phys. Rev. B 78, 085307 (2008).

    ADS  Article  CAS  Google Scholar 

  59. 59.

    Hu, C., Munro, W. & Rarity, J. Deterministic photon entangler using a charged quantum dot inside a microcavity. Phys. Rev. B 78, 125318 (2008).

    ADS  Article  CAS  Google Scholar 

  60. 60.

    Wei, H.-R. & Long, G. L. Hybrid quantum gates between flying photon and diamond nitrogen-vacancy centers assisted by optical microcavities. Sci. Rep. 5, 12918 (2015).

    ADS  CAS  PubMed  PubMed Central  Article  Google Scholar 

  61. 61.

    Chen, Q., Yang, W., Feng, M. & Du, J. Entangling separate nitrogen-vacancy centers in a scalable fashion via coupling to microtoroidal resonators. Phys. Rev. A 83, 054305 (2011).

    ADS  Article  CAS  Google Scholar 

  62. 62.

    Cheng, L.-Y., Wang, H.-F., Zhang, S. & Yeon, K.-H. Quantum state engineering with nitrogen-vacancy centers coupled to low-Q microresonator. Opt. Express 21, 5988–5997 (2013).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  63. 63.

    Wei, H.-R. & Deng, F.-G. Compact quantum gates on electron-spin qubits assisted by diamond nitrogen-vacancy centers inside cavities. Phys. Rev. A 88, 042323 (2013).

    ADS  Article  CAS  Google Scholar 

  64. 64.

    An, J.-H., Feng, M. & Oh, C. Quantum-information processing with a single photon by an input-output process with respect to low-Q cavities. Phys. Rev. A 79, 032303 (2009).

    ADS  Article  CAS  Google Scholar 

  65. 65.

    Li, M., Lin, J.-Y. & Zhang, M. High-fidelity hybrid quantum gates between a flying photon and diamond nitrogen-vacancy centers assisted by low-Q single-sided cavities. Ann. Phys. 531, 1800312 (2019).

    Article  CAS  Google Scholar 

  66. 66.

    Duan, L.-M. & Kimble, H. Scalable photonic quantum computation through cavity-assisted interactions. Phys. Rev. Lett. 92, 127902 (2004).

    ADS  PubMed  Article  CAS  PubMed Central  Google Scholar 

  67. 67.

    Heo, J. et al. Implementation of controlled quantum teleportation with an arbitrator for secure quantum channels via quantum dots inside optical cavities. Sci. Rep. 7, 1–12 (2017).

    ADS  Article  CAS  Google Scholar 

  68. 68.

    Walls, D. F. & Milburn, G. J. Quantum Optics (Springer, Berlin, 2007).

    Google Scholar 

  69. 69.

    Yoneda, J. et al. A quantum-dot spin qubit with coherence limited by charge noise and fidelity higher than 99.9%. Nat. Nanotechnol. 13, 102–106 (2018).

    ADS  CAS  PubMed  Article  PubMed Central  Google Scholar 

  70. 70.

    Bartkowiak, M. & Miranowicz, A. Linear-optical implementations of the iswap and controlled not gates based on conventional detectors. JOSA B 27, 2369–2377 (2010).

    ADS  CAS  Article  Google Scholar 

Download references

Acknowledgements

SB thanks to Roger Colbeck and Raban Iten, and FO thanks to Bilen Basarir for fruitful discussions. SB acknowledges Japanese Government MEXT scholarship. FO acknowledges the Personal Research Fund of Tokyo International University. This work was partially supported by JSPS KAKENHI Grant Number: JP18K18996 and JP20H00237, JST CREST (JPMJ CR1675) and MEXT Quantum Leap Flagship Program (MEXT Q-LEAP) Grant Number JPMXS0118069228.

Author information

Affiliations

Authors

Contributions

S.B. designed the scheme and carried out the theoretical analysis under the guidance of F.O. and T.K., S.B., F.O. and T.K. reviewed the manuscript and contributed to the interpretation of the work and the writing of the manuscript.

Corresponding author

Correspondence to Sinan Bugu.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Bugu, S., Ozaydin, F. & Kodera, T. Surpassing the classical limit in magic square game with distant quantum dots coupled to optical cavities. Sci Rep 10, 22202 (2020). https://doi.org/10.1038/s41598-020-79295-x

Download citation

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing