اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTime versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a data bus, for reducing the qubit counts within quantum computations (protected by surface codes). For general computations, an automated trade-off analysis (software tool and source code are open sourced and available online) is performed to determine to what degree qubit counts are reduced by the data bus: is the time penalty worth the qubit count reductions? We provide two examples where the qubit counts are convincingly reduced: 1) interaction of two surface code patches on NISQ machines with 28 and 68 qubits, and 2) very large-scale circuits with a structure similar to state-of-the-art quantum chemistry circuits. The data bus has the potential to transform all layers of the quantum computing stack (e.g., as envisioned by Google, IBM, Riggeti, Intel), because it simplifies quantum computation layouts, hardware architectures and introduces lower qubits counts at the expense of a reasonable time penalty.
قيم البحث
اقرأ أيضاً
Scalable and fault-tolerant quantum computation will require error correction. This will demand constant measurement of many-qubit observables, implemented using a vast number of CNOT gates. Indeed, practically all operations performed by a fault-tol
erant device will be these CNOTs, or equivalent two-qubit controlled operations. It is therefore important to devise benchmarks for these gates that explicitly quantify their effectiveness at this task. Here we develop such benchmarks, and demonstrate their use by applying them to a range of differently implemented controlled gates and a particular quantum error correcting code. Specifically, we consider spin qubits confined to quantum dots that are coupled either directly or via floating gates to implement the minimal 17-qubit instance of the surface code. Our results show that small differences in the gate fidelity can lead to large differences in the performance of the surface code. This shows that gate fidelity is not, in general, a good predictor of code performance.
We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch sphere, and a u
niversal set of single-qubit gates. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants, and quantify the difference through detailed characterization. In particular, we demonstrate process tomography of logical gates, using the notion of a logical Pauli transfer matrix. This integration of high-fidelity logical operations with a scalable scheme for repeated stabilization is a milestone on the road to quantum error correction with higher-distance superconducting surface codes.
We demonstrate long-lived coherence in internal hyperfine states of a single Ca{43} trapped-ion qubit $[T_2=1.2(2)s]$, and in external motional states of a single Ca{40} trapped-ion qubit $[T_2=0.18(4)s]$, in the same apparatus. The motional decohere
nce rate is consistent with the heating rate, which was measured to be 3(1) quanta/sec. Long coherence times in the external motional states are essential for performing high-fidelity quantum logic gates between trapped-ion qubits. The internal-state $T_2$ time that we observe in Ca{43}, which has not previously been used as a trapped-ion qubit, is about one thousand times longer than that of physical qubits based on Ca{40} ions. Using a single spin-echo pulse to ``re-phase the internal state, we can detect no decoherence after 1s, implying an effective coherence time $T_2^{mbox{tiny SE}} gtish 45s$. This compares with timescales in this trap for single-qubit operations of ish 1us, and for two-qubit operations of ish 10us.
We provide a characterization and analysis of the effects of dissipation on oscillator assisted (qubus) quantum gates. The effects can be understood and minimized by looking at the dynamics of the signal coherence and its entanglement with the contin
uous variable probe. Adding loss in between successive interactions we obtain the effective quantum operations, providing a novel approach to loss analysis in such hybrid settings. We find that in the presence of moderate dissipation the gate can operate with a high fidelity. We also show how a simple iteration scheme leads to independent single qubit dephasing, while retaining the conditional phase operation regardless of the amount of loss incurred by the probe.
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 system is then truncated to these five qubits, so that the exchange process can be run on the IBM 5Q processor. The results demonstrate the expected effect of the exchange. This paper has been written in a style that should hopefully be accessible to both professional and amateur scientists.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
