The smallest quantum code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error-correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.
In this work we investigate the problem of secretly broadcasting five qubit entangled state between three different partners We implement the protocol described in ref [16] on three particle W-state shared by three distant partners Alice,Bob and Charlie. The problem is interesting in the sense it is the first attempt to broadcast five qubit entangled state between three parties.
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are sufficient and only numerical evidences have been gathered, indicating that the five-gate implementation is necessary. The idea introduced here can also be used to solve the problem of optimal simulation of three-qubit control phase introduced by Deutsch in 1989.
In this work, a quantum error correction (QEC) procedure with the concatenated five-qubit code is used to construct a near-perfect effective qubit channel (with a error below $10^{-5}$) from arbitrary noise channels. The exact performance of the QEC is characterized by a Choi matrix, which can be obtained via a simple and explicit protocol. In a noise model with five free parameters, our numerical results indicate that the concatenated five-qubit code is general: To construct a near-perfect effective channel from the noise channels, the necessary size of the concatenated five-qubit code depend…
We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states are in ten classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule.
We investigate the usefulness of a recently introduced five qubit state by Brown $\it et al. \normalfont$ \cite{Brown} for quantum teleportation, quantum state sharing and superdense coding. It is shown that this five-qubit state can be utilized for perfect teleportation of arbitrary single and two qubit systems. We devise various schemes for quantum state sharing of an arbitrary single and two particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits…
In this paper I explore the entanglement evolution of qubits that are part of a five qubit quantum error correction code subject to various decohering environments. Specifically, I look for possible parallels between the entanglement degradation and the fidelity of the logical qubit of quantum information stored in the physical qubits. In addition, I note the possible exhibition of entanglement sudden death (ESD) due to decoherence and question whether ESD is actually a roadblock to successful quantum computation.
In quantum error correction, it is an important assumption that errors on different qubits are independent. In our previous work [Phys. Rev. A {\bf 92}, 052320 (2015)], the generality of the concatenated five-qubit code has been investgated when noises of the principal system and the auxiliary environment are assumed to be the same. In the error correction with concatenated code, tiny differences (in fidelity or independent errors) between initial quantum channels may introduce different effective channels in the next level, and therefore, it is necessary to study a meaningful question: Does f…
We solve the eigenvalue problem of the five-qubit anisotropic Heisenberg model, without use of Bethe's Ansatz, and give analytical results for entanglement and mixedness of two nearest-neighbor qubits. The entanglement takes its maximum at Delta= (Delta>1) for the case of zero (finite) temperature with Delta being the anisotropic parameter. In contrast, the mixedness takes its minimum at Delta=1 (Delta>1) for the case of zero (finite) temperature.
A theoretical scheme for bidirectional swapping quantum controlled teleportation is presented using the entanglement property of maximally entangled five-qubit state, i.e., Alice wants to transmit a entangled state of particle a to Bob and Bob wants to transmit a entangled state of particle b to Alice via the control of the supervisor Charlie.
Employing five commuting sets of five-qubit observables, we propose specific 160-661 and 160-21 state proofs of the Bell-Kochen-Specker theorem that are also proofs of Bell's theorem. A histogram of the 'Hilbert-Schmidt' distances between the corresponding maximal bases shows in both cases a noise-like behaviour. The five commuting sets are also ascribed a finite-geometrical meaning in terms of the structure of symplectic polar space W(9,2).
We demonstrate the implementation of quantum cheque, proposed by Roy Moulick and Panigrahi [Quantum Inf. Process (2016) 15: 2475], using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates have been implemented for the realization of the quantum cheque transaction in a quantum networked banking system. Quantum state tomography reveals the accuracy of the implementation with comparable results from the theoretical and experimental density matrices.
We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be prepared for the purpose at hand, with less entanglement resource. We find that a variant of the Brown state can be utilized for perfect teleportation of single and two qubit states. In case of superdense coding, it is observed that five cbits can be transmitted by sending only three qubits.
Local implementation of non-local quantum gates is necessary in a distributed quantum computer. Here, we demonstrate the non-local implementation of controlled-unitary quantum gates proposed by Eisert et al. (Phys Rev A 62:052317, 2000) using the five-qubit IBM quantum computer. We verify the fidelity and accuracy of the implementation through the techniques of quantum state and process tomographies.
We present an efficient and economic scheme for five-party quantum state sharing of an arbitrary m-qubit state with $2m$ three-particle Greenberger-Horne-Zeilinger (GHZ) states and three-particle GHZ-state measurements. It is more convenient than other schemes as it only resorts to three-particle GHZ states and three-particle joint measurement, not five-particle entanglements and five-particle joint measurements. Moreover, this symmetric scheme is in principle secure even though the number of the dishonest agents is more than one. Its total efficiency approaches the maximal value.
The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results obtained in five experimental tests performed on these computers: dense coding, quantum Fourier transforms, Bell's inequality, Mermin's inequalities (up to $n=5$) and the construction of the prime state $|p_3\rangle$. These results serve to assess the functioning of the IBM 5Q chips.
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations. In combination with a drift Hamiltonian containing interactions between the qubits, this allows the implementation of any required gate operation. Here, we demonstrate an alternative scheme that does not require local control for all qubits: we implement one- and two-qubit gate operations on a set of target qubits indirectly, through a combination of gates …
Simpler encoding and decoding networks are necessary for more reliable quantum error correcting codes (QECCs). The simplification of the encoder-decoder circuit for a perfect five-qubit QECC can be derived analytically if the QECC is converted from its equivalent one-way entanglement purification protocol (1-EPP). In this work, the analytical method to simplify the encoder-decoder circuit is introduced and a circuit that is as simple as the existent simplest circuits is presented as an example. The encoder-decoder circuit presented here involves nine single- and two-qubit unitary operations, o…
Experimental realization of stabilizer-based quantum error correction (QEC) codes that would yield superior logical qubit performance is one of the formidable task for state-of-the-art quantum processors. A major obstacle towards realizing this goal is the large footprint of QEC codes, even those with a small distance. We propose a circuit based on the minimal distance-3 QEC code, which requires only 5 data qubits and 5 ancilla qubits, connected in a ring with iSWAP gates implemented between neighboring qubits. Using a density-matrix simulation, we show that, thanks to its smaller footprint, t…
A six-qubit quantum network consisting of conditional unitary gates is presented which is capable of implementing a large class of covariant two-qubit quantum operations. Optimal covariant NOT operations for one and two-qubit systems are special cases contained in this class. The design of this quantum network exploits basic algebraic properties which also shed new light onto these covariant quantum processes.
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate…
Currently, the mainstream approach to quantum computing is through surface codes. One way to store and manipulate quantum information with these to create defects in the codes which can be moved and used as if they were particles. Specifically, they simulate the behaviour of exotic particles known as Majoranas, which are a kind of non-Abelian anyon. By exchanging these particles, important gates for quantum computation can be implemented. Here we investigate the simplest possible exchange operation for two surface code Majoranas. This is found to act non-trivially on only five qubits. The syst…
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary …
Universal quantum information processing requires single-qubit rotations and two-qubit interactions as minimal resources. A possible step beyond this minimal scheme is the use of three-qubit interactions. We consider such three-qubit interactions and show how they can reduce the time required for a quantum state transfer in an XY spin chain. For the experimental implementation, we use liquid-state nuclear magnetic resonance (NMR), where three-qubit interactions can be implemented by sequences of radio-frequency pulses.
By constructing the recovery operations of the protocol of remote implementation of partially unknown quantum operation of two qubits [An Min Wang: PRA, \textbf{74}, 032317(2006)], we present a scheme to implement it in cavity QED. Long-lived Rydberg atoms are used as qubits, and the interaction between the atoms and the field of cavity is a nonresonant one. Finally, we analyze the experimental feasibility of this scheme.
We present two experimental schemes that can be used to implement the Factorized Quantum Lattice-Gas Algorithm for the 1D Diffusion Equation with Persistent-Current Qubits. One scheme involves biasing the PC Qubit at multiple flux bias points throughout the course of the algorithm. An implementation analogous to that done in Nuclear Magnetic Resonance Quantum Computing is also developed. Errors due to a few key approximations utilized are discussed and differences between the PC Qubit and NMR systems are highlighted.
We propose a one-step scheme to implement a multiqubit controlled phase gate of one qubit simultaneously controlling multiple qubits with three-level atoms at distant nodes in coupled cavity arrays. The selective qubit-qubit couplings are achieved by adiabatically eliminating the atomic excited states and photonic states and the required phase shifts between the control qubit and any target qubit can be realized through suitable choices of the parameters of the external fields. Moreover, the effective model is robust against decoherence because neither the atoms nor the field modes during the …
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally. The graph requires each qubit to interact with 4 other qubits and yet the time-overhead for implementing any n-qubit quantum circuit is 6 log n. Building a network of quantum computing nodes according to this graph enables the network to emulate a single monolithic device with minimal overhead.
We study the possibility of an implementation of N-qubit (N>3) Grover search in cavity QED, based on a fast operation of N-qubit controlled phase-flip with atoms in resonance with the cavity mode. We demonstrate both analytically and numerically that, our scheme could be achieved efficiently to find a marked state with high fidelity and high success probability. As cavity decay is involved in our quantum trajectory treatment, we could analytically understand the implementation of a Grover search subject to dissipation, which would be very helpful for relevant experiments.
The performance of quantum error correction schemes depends sensitively on the physical realizations of the qubits and the implementations of various operations. For example, in quantum dot spin qubits, readout is typically much slower than gate operations, and conventional surface code implementations that rely heavily on syndrome measurements could therefore be challenging. However, fast and accurate reset of quantum dot qubits--without readout--can be achieved via tunneling to a reservoir. Here, we propose small-scale surface code implementations for which syndrome measurements are replaced…
The Solovay-Kitaev theorem allows us to approximate any single-qubit gate to arbitrary accuracy with a finite sequence of fundamental operations from a universal set of gates. Inspired by this decomposition, we present a quantum channel simulator capable of implementing any completely positive trace-preserving map. Our realization consists of one ancillary qubit, encoded in the transverse mode of a laser beam (orbital degree of freedom), one qubit system, encoded in its polarization (spin), one spin-orbit CNOT gate and four single-qubit operations performed with prisms and polarization compone…
We propose a protocol to construct the 35 $f$-controlled phase gates of a three-qubit refined Deutsch-Jozsa (DJ) algorithm, by using single-qubit $σ_z$ gates, two-qubit controlled phase gates, and two-target-qubit controlled phase gates. Using this protocol, we discuss how to implement the three-qubit refined DJ algorithm with superconducting transmon qutrits resonantly coupled to a single cavity. Our numerical calculation shows that implementation of this quantum algorithm is feasible within the present circuit QED technique. The experimental realization of this algorithm would be an importan…
We consider the problem of bi-directional controlled quantum teleportation of information encoded in phase opposite coherent state among two distant partners Alice and Bob, with the consent of controller, Charlie. We use five-mode cluster-type entangled coherent state as the quantum resource to achieve this task. The scheme uses linear optical devices such as beam splitter, phase shifters, and photon counters. We have shown that for moderately large coherent amplitude, near-perfect bi-directional controlled teleportation can be obtained in terms of the average fidelity of teleportation.
We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.
We investigate decoherence channels that are modelled as a sequence of collisions of a quantum system (e.g., a qubit) with particles (e.g., qubits) of the environment. We show that collisions induce decoherence when a bi-partite interaction between the system qubit and an environment (reservoir) qubit is described by the controlled-U unitary transformation (gate). We characterize decoherence channels and in the case of a qubit we specify the most general decoherence channel and derive a corresponding master equation. Finally, we analyze entanglement that is generated during the process of deco…
The method for preparation of a two-qubit state on two spins-1/2 that mutually interact through an auxiliary spin is proposed. The essence of the method is that, initially, the three spins evolve under the action of an external magnetic field during a predefined period of time. Then, the auxiliary spin is measured by a monochromatic electromagnetic radiation that allows obtaining a certain state of the remaining spins. We study the entanglement of this state and obtain the condition for achieving the maximally entangled state. The implementation of the method on the physical system of nuclear …
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.
We propose a scenario to physically implement a kind of topologically decoherence-protected qubit using superconducting devices coupled to a micro-wave cavity mode with unconventional geometric operations. It is shown that the two needed interactions for selective devices, which are required for implementing such protected qubits, as well as single-qubit gates, can be achieved by using the external magnetic flux. The easy combination of individual addressing with the many-device setup proposed in the system presents a distinct merit in comparison with the implementation of topologically protec…
A scheme for distributed quantum measurement that allows nondestructive or indirect Bell measurement was proposed by Gupta et al., (Int. J. Quant. Infor. \textbf{5} (2007) 627) and subsequently realized experimentally using an NMR-based three-qubit quantum computer by Samal et al., (J. Phys. B, \textbf{43} (2010) 095508). In the present work, a similar experiment is performed using the five-qubit super-conductivity-based quantum computer, which has been recently placed in cloud by IBM Corporation. The experiment confirmed that the Bell state can be constructed and measured in a nondestructive …
A five-qubit 1-resistant graph state and stabilizer marginal certificates
University of Science and Technology of China（中国科学技术大学）；School of Mathematical Sciences, University of Science and Technology of China（中国科学技术大学数学科学学院）；Hefei National Laboratory, University of Science and Technology of China（中国科学技术大学合肥国家实验室）
We propose an alternative scheme to implement a two-qubits Controlled-U gate in the hybrid system atom-$CCA$ (coupled cavities array). Our scheme results in a constant gating time and, with an adjustable qubit-bus coupling (atom-resonator), one can specify a particular transformation $U$ on the target qubit. We believe that this proposal may open promising perspectives for networking quantum information processors and implementing distributed and scalable quantum computation.
We theoretically study the realization of a multi-qubit refined Deutsch-Jozsa (DJ) algorithm using resonant interaction of many Rydberg atoms with a single-mode microwave cavity, in which the multi-qubit controlled phase gates could be accomplished efficiently. We show how to achieve a multi-qubit refined DJ algorithm in high fidelity, even in the case of a weak cavity decay and some imperfection. We argue that the required operations in our scheme are almost within the present experimental possibilities.
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic sum…
Aiming the construction of quantum computers and quantum communication systems based on optical devices, in this work we present possible implementations of quantum and classical CNOTs gates, as well an optical setup for generation and distribution of bipartite entangled states, using linear optical devices and photon number quantum non-demolition measurement.
Recently, Li and Nie (Int. J. Theo. Phys. 52:1630, 2013) had introduced a bidirectional controlled quantum teleportation (BCQT) protocol by using GHZ-Bell state as a quantum channel. Also, Shukla et al. (Int. J. Theo. Phys. 52:3790, 2013) had shown the Li and Nie (LN) protocol is not a BCQT scheme. In this paper, two kinds of bidirectional teleportation schemes in order to correct and improve LN protocol are presented. In the first scheme, Alice and Bob as two legitimate users can simultaneously teleport an unknown single-qubit state to each other with the help of controller Charlie. In the se…
We propose a protocol for Alice to implement a multiqubit quantum operation from the restricted sets on distant qubits possessed by Bob, and then we investigate the communication complexity of the task in different communication scenarios. By comparing with the previous work, our protocol works without prior sharing of entanglement, and requires less communication resources than the previous protocol in the qubit-transmission scenario. Furthermore, we generalize our protocol to $d$-dimensional operations.
We propose a simple scheme for generating a high-fidelity controlled-Z (CZ) gate in a three-component qubit/bus/qubit device. The corresponding tune/detune pulse is single-step, with a near-resonant constant undershoot between the 200 and 101 states. During the pulse, the frequency of the first qubit is kept fixed, while the frequency of the second qubit is varied in such a way as to bring the 200 and 101 states close to resonance. As a result, the phase of the 101 state is accumulated via the corresponding second-order anticrossing. For experimentally realistic qubit frequencies and a 75 MHz …
Nonadiabatic holonomic quantum computation has attracted increasing interest because of its robustness. In this paper, based on the shortcuts to adiabaticity (STA), we propose a scheme to construct a three-qubit nonadiabatic holonomic gate in a cavity quantum electrodynamics system. In the scheme, the three-qubit holonomic gate is implemented in a single step. Besides, numerical simulations show that the constructed holonomic quantum gate holds the characteristics of high-fidelity, decoherence-resistance and error-immunity.
We design optimal interferometric schemes for implementation of two-qubit linear optical quantum filters diagonal in the computational basis. The filtering is realized by interference of the two photons encoding the qubits in a multiport linear optical interferometer, followed by conditioning on presence of a single photon in each output port of the filter. The filter thus operates in the coincidence basis, similarly to many linear optical unitary quantum gates. Implementation of the filter with linear optics may require an additional overhead in terms of reduced overall success probability of…
The Deutsch-Jozsa algorithm is experimentally demonstrated for three-qubit functions using pure coherent superpositions of Li$_{2}$ rovibrational eigenstates. The function's character, either constant or balanced, is evaluated by first imprinting the function, using a phase-shaped femtosecond pulse, on a coherent superposition of the molecular states, and then projecting the superposition onto an ionic final state, using a second femtosecond pulse at a specific time delay.
We propose two potentially practical schemes to carry out two-qubit quantum gates on endohedral fullerenes $N@C_{60}$ or $P@C_{60}$. The qubits are stored in electronic spin degrees of freedom of the doped atom $N$ or $P$. By means of the magnetic dipolar coupling between two neighboring fullerenes, the two-qubit controlled-NOT gate and the two-qubit conditional phase gate are performed by selective microwave pulses assisted by refocusing technique. We will discuss the necessary additional steps for the universality of our proposal. We will also show that our proposal is useful for both quantu…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit quantum computer has been investigated using the 400 MHz NMR spectrum of the three coupled protons in 2,3-dibromopropanoic acid. It has been employed to implement the Deutsch-Jozsa algorithm for distinguishing between constant and balanced functions. The extension to systems containing more coupled spins is straightforward and does not require a more protra…
Using resonant interaction of three Rydberg atoms with a single-mode microwave cavity, we consider a realization of three-qubit Grover search algorithm in the presence of weak cavity decay, based on a previous idea for three-qubit quantum gate [Phys. Rev. A 73, 064304 (2006)]. We simulate the searching process under the influence of the cavity decay and show that our scheme could be achieved efficiently to find the marked state with high fidelity. The required operations are very close to the reach with current cavity QED techniques.
A quantum circuit is introducted to describe the preparation of a labeled pseudo-pure state by mutiplet-component excitation scheme which has been experimentally implemented on a 4-qubit nuclear magnetic resonance quantum processor. Meanwhile, we theoretically analyze and numerically inverstigate the low-power selective single-pulse implementation of a controlled-rotation gate, which manifests its validity in our experiment. Based on the labeled pseudo-pure state prepared, a 3-qubit Bernstein-Vazirani algorithm has been experimentally demonstrated by spectral implementation. The "answers" of t…
We have devised an optical scheme for the recently proposed protocol for encoding two qubits into one qutrit. In this protocol, Alice encodes an arbitrary pure product state of two qubits into a state of one qutrit. Bob can then restore error-free any of the two encoded qubit states but not both of them simultaneously. We have successfully realized this scheme experimentally using spatial-mode encoding. Each qubit (qutrit) was represented by a single photon that could propagate through two (three) separate fibers. We theoretically propose two generalizations of the original protocol. We have f…
The diamond nitrogen-vacancy (NV) center is an excellent candidate for quantum information processing, whereas entangling separate NV centers is still of great experimental challenge. We propose an one-step conditional phase flip with three NV centers coupled to a whispering-gallery mode cavity by virtue of the Raman transition and smart qubit encoding. As decoherence is much suppressed, our scheme could work for more qubits. The experimental feasibility is justified.
In this paper, a novel protocol is proposed for implementing BQCT by using five-qubit en The proposed protocol depends on the Controlled-NOT operation, proper single-qubit unitary operations and single-qubit measurement in the Z-basis and X-basis. The results showed that the protocol is more efficient from the perspective such as lower shared qubits and, single qubit measurements compared to the previous work. Furthermore, the probability of obtaining Charlie's qubit by eavesdropper is reduced, and supervisor can control one of the users or every two users. Also, we present a new method for tr…
We propose a single-step implementation of a muti-target-qubit controlled phase gate with one cat-state qubit (\textit{cqubit}) simultaneously controlling $n-1$ target \textit{cqubits}. The two logic states of a \textit{cqubit} are represented by two orthogonal cat states of a single cavity mode. In this proposal, the gate is implemented with $n$ microwave cavities coupled to a superconducting transmon qutrit. Because the qutrit remains in the ground state during the gate operation, decoherence caused due to the qutrit's energy relaxation and dephasing is greatly suppressed. The gate implement…
A proposal for a phase gate and a Mølmer-Sørensen (MS) gate in the dressed state basis is presented. In order to perform the multi-qubit interaction, a strong magnetic field gradient is required to couple the phonon-bus to the qubit states. The gate is performed using resonant microwave driving fields together with either a radio-frequency (RF) driving field, or additional detuned microwave driving fields. The gate is robust to ambient magnetic field fluctuations due to an applied resonant microwave driving field. Furthermore, the gate is robust to fluctuations in the microwave Rabi frequency …
