اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImplementing a Ternary Decomposition of the Toffoli Gate on Fixed-FrequencyTransmon Qutrits
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors during computation, with multi-qubit operations often being a primary limitation. Most quantum devices naturally have multiple accessible energy levels beyond the lowest two traditionally used to define a qubit. Qudits offer a larger state space to store and process quantum information, reducing complexity of quantum circuits and improving efficiency of quantum algorithms. Here, we experimentally demonstrate a ternary decomposition of a multi-qubit operation on cloud-enabled fixed-frequency superconducting transmons. Specifically, we realize an order-preserving Toffoli gate consisting of four two-transmon operations, whereas the optimal order-preserving binary decomposition uses eight texttt{CNOT}s on a linear transmon topology. Both decompositions are benchmarked via truth table fidelity where the ternary approach outperforms on most sets of transmons on texttt{ibmq_jakarta}, and is further benchmarked via quantum process tomography on one set of transmons to achieve an average gate fidelity of 78.00% $pm$ 1.93%.
قيم البحث
اقرأ أيضاً
The quantum Toffoli gate allows universal reversible classical computation. It is also an important primitive in many quantum circuits and quantum error correction schemes. Here we demonstrate the realization of a Toffoli gate with three superconduct
ing transmon qubits coupled to a microwave resonator. By exploiting the third energy level of the transmon qubit, the number of elementary gates needed for the implementation of the Toffoli gate, as well as the total gate time can be reduced significantly in comparison to theoretical proposals using two-level systems only. We characterize the performance of the gate by full process tomography and Monte Carlo process certification. The gate fidelity is found to be $68.5pm0.5$%.
We determine the cost of performing Shors algorithm for integer factorization on a ternary quantum computer, using two natural models of universal fault-tolerant computing: (i) a model based on magic state distillation that assumes the availability
of the ternary Clifford gates, projective measurements, classical control as its natural instrumentation set; (ii) a model based on a metaplectic topological quantum computer (MTQC). A natural choice to implement Shors algorithm on a ternary quantum computer is to translate the entire arithmetic into a ternary form. However, it is also possible to emulate the standard binary version of the algorithm by encoding each qubit in a three-level system. We compare the two approaches and analyze the complexity of implementing Shors period finding function in the two models. We also highlight the fact that the cost of achieving universality through magic states in MTQC architecture is asymptotically lower than in generic ternary case.
We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven or eight qubits, we show that success probabilities of 1/4, 1/2 and 1 respectively can be achieved. Our study p
uts a measurement-based version of this important quantum logic gate within the reach of current experiments. As the graphs are setup-independent, they could be realized in a variety of systems, including linear optics and ion-traps.
Compared with the idea of universal quantum computation, a direct synthesis of a multiqubit logic gate can greatly improve the efficiency of quantum information processing tasks. Here we propose an efficient scheme to implement a three-qubit controll
ed-not (Toffoli) gate of neutral atoms based on unconventional Rydberg pumping. By adjusting the strengths of Rabi frequencies of driving fields, the Toffoli gate can be achieved within one step, which is also insensitive to the fluctuation of the Rydberg-Rydberg interaction. Considering different atom alignments, we can obtain a high-fidelity Toffoli gate at the same operation time $sim 7~mu s$. In addition, our scheme can be further extended to the four-qubit case without altering the operating time.
Conditional multi-qubit gates are a key component for elaborate quantum algorithms. In a recent work, Rasmussen et al. (Phys. Rev. A 101, 022308) proposed an efficient single-step method for a prototypical multi-qubit gate, a Toffoli gate, based on a
combination of Ising interactions between control qubits and an appropriate driving field on a target qubit. Trapped ions are a natural platform to implement this method, since Ising interactions mediated by phonons have been demonstrated in increasingly large ion crystals. However, the simultaneous application of these interactions and the driving field required for the gate results in undesired entanglement between the qubits and the motion of the ions, reducing the gate fidelity. In this work, we propose a solution based on adiabatic switching of these phonon mediated Ising interactions. We study the effects of imperfect ground state cooling, and use spin-echo techniques to undo unwanted phase accumulation in the achievable fidelities. For gates coupling to all axial modes of a linear crystal, we calculate high fidelities ($>$ 99%) $N$-qubit rotations with $N=$ 3-7 ions cooled to their ground state of motion and a gate time below 1~ms. The high fidelities obtained also for large crystals could make the gate competitive with gate-decomposed, multi-step variants of the $N$-qubit Toffoli gate, at the expense of requiring ground state cooling of the ion crystal.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
