اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalytic Pulse Sequence Construction for Exchange-Only Quantum Computation
178
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present pulse sequences for two-qubit gates acting on encoded qubits for exchange-only quantum computation. Previous work finding such sequences has always required numerical methods due to the large search space of unitary operators acting on the space of the encoded qubits. By contrast, our construction can be understood entirely in terms of three-dimensional rotations of effective spin-1/2 pseudospins which allows us to use geometric intuition to determine the required sequence of operations analytically. The price we pay for this simplification is that, at 39 pulses, our sequences are significantly longer than the best numerically obtained sequences.
قيم البحث
اقرأ أيضاً
Global control strategies for arrays of qubits are a promising pathway to scalable quantum computing. A continuous-wave global field provides decoupling of the qubits from background noise. However, this approach is limited by variability in the para
meters of individual qubits in the array. Here we show that by modulating a global field simultaneously applied to the entire array, we are able to encode qubits that are less sensitive to the statistical scatter in qubit resonance frequency and microwave amplitude fluctuations, which are problems expected in a large scale system. We name this approach the SMART (Sinusoidally Modulated, Always Rotating and Tailored) qubit protocol. We show that there exist optimal modulation conditions for qubits in a global field that robustly provide improved coherence times. We discuss in further detail the example of spins in silicon quantum dots, in which universal one- and two-qubit control is achieved electrically by controlling the spin-orbit coupling of individual qubits and the exchange coupling between spins in neighbouring dots. This work provides a high-fidelity qubit operation scheme in a global field, significantly improving the prospects for scalability of spin-based quantum computer architectures.
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in two space d
imensions. The resulting quasiparticle trajectories define world-lines in three dimensional space-time, and the corresponding quantum gates depend only on the topology of the braids formed by these world-lines. We show how to find braids that yield a universal set of quantum gates for qubits encoded using a specific kind of quasiparticle which is particularly promising for experimental realization.
A scheme based on Coherent Tunneling by Adiabatic Passage (CTAP) of exchange-only spin qubit quantum states in a linearly arranged double quantum dot chain is demonstrated. Logical states for the qubit are defined by adopting the spin state of three
electrons confined in a double quantum dot. The possibility to obtain gate operations entirely with electrical manipulations makes this qubit a valuable architecture in the field of quantum computing for the implementation of quantum algorithms. The effect of the external control parameters as well as the effect of the dephasing on the coherent tunneling in the chain is studied. During adiabatic transport, within a constant energy degenerate eigenspace, the states in the double quantum dots internal to the chain are not populated, while transient populations of the mixed states in the external ones are predicted.
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum dynamics in t
he enlarged Hilbert space of an embedding quantum simulator. In this manner, entanglement monotones are conveniently mapped onto physical observables, overcoming the necessity of full tomography and reducing drastically the experimental requirements. Furthermore, this method is directly applicable to pure states and, assisted by classical algorithms, to the mixed-state case. Finally, we expect that the proposed embedding framework paves the way for a general theory of enhanced one-to-one quantum simulators.
The hopes for scalable quantum computing rely on the threshold theorem: once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based on a number o
f assumptions, which are supposed to be satisfied exactly, like axioms, e.g. zero undesired interactions between qubits, etc. However in the physical world no continuous quantity can be exactly zero, it can only be more or less small. Thus the error per qubit per gate threshold must be complemented by the required precision with which each assumption should be fulfilled. This issue was never addressed. In the absence of this crucial information, the prospects of scalable quantum computing remain uncertain.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
