اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Swapping in a Quantum Multiplier Modelled as a Queuing Network
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Predicting the optimum SWAP depth of a quantum circuit is useful because it informs the compiler about the amount of necessary optimization. Fast prediction methods will prove essential to the compilation of practical quantum circuits. In this paper, we propose that quantum circuits can be modeled as queuing networks, enabling efficient extraction of the parallelism and duration of SWAP circuits. To provide preliminary substantiation of this approach, we compile a quantum multiplier circuit and use a queuing network model to accurately determine the quantum circuit parallelism and duration. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
قيم البحث
اقرأ أيضاً
We demonstrate a SWAP gate between laser-cooled ions in a segmented microtrap via fast physical swapping of the ion positions. This operation is used in conjunction with qubit initialization, manipulation and readout, and with other types of shuttlin
g operations such as linear transport and crystal separation and merging. Combining these operations, we perform quantum process tomography of the SWAP gate, obtaining a mean process fidelity of 99.5(5)%. The swap operation is demonstrated with motional excitations below 0.05(1)~quanta for all six collective modes of a two-ion crystal, for a process duration of 42~$mu$s. Extending these techniques to three ions, we reverse the order of a three-ion crystal and reconstruct the truth table for this operation, resulting in a mean process fidelity of 99.96(13)% in the logical basis.
We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeaters sizes. Based on this, we are able to demonstrate that the commonly
used doubling scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on higher nesting levels, our approach reveals that a power-of-two number of segments has no privileged position in quantum repeater theory; the best scheme can be constructed for any number of segments. Moreover, classical communication can be included into our scheme, and we show how this influences the raw waiting time for different number of segments, confirming again the optimality of non-doubling in some relevant parameter regimes. Thus, our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.
Simple, controllable models play an important role to learn how to manipulate and control quantum resources. We focus here on quantum non-Markovianity and model the evolution of open quantum systems by quantum renewal processes. This class of quantum
dynamics provides us with a phenomenological approach to characterise dynamics with a variety of non-Markovian behaviours, here described in terms of the trace distance between two reduced states. By adopting a trajectory picture for the open quantum system evolution, we analyse how non-Markovianity is influenced by the constituents defining the quantum renewal process, namely the time-continuous part of the dynamics, the type of jumps and the waiting time distributions. We focus not only on the mere value of the non-Markovianity measure, but also on how different features of the trace distance evolution are altered, including times and number of revivals.
Entanglement swapping, the process to entangle two particles without coupling them in any way, is one of the most striking manifestations of the quantum-mechanical nonlocal characteristic. Besides fundamental interest, this process has applications i
n complex entanglement manipulation and quantum communication. Here we report a high-fidelity, unconditional entanglement swapping experiment in a superconducting circuit. The measured concurrence characterizing the qubit-qubit entanglement produced by swapping is above 0.75, confirming most of the entanglement of one qubit with its partner is deterministically transferred to another qubit that has never interacted with it. We further realize delayed-choice entanglement swapping, showing whether two qubits previously behaved as in an entangled state or as in a separable state is determined by a later choice of the type of measurement on their partners. This is the first demonstration of entanglement-separability duality in a deterministic way.
Various post-quantum cryptography algorithms have been recently proposed. Supersingluar isogeny Diffie-Hellman key exchange (SIKE) is one of the most promising candidates due to its small key size. However, the SIKE scheme requires numerous finite fi
eld multiplications for its isogeny computation, and hence suffers from slow encryption and decryption process. In this paper, we propose a fast finite field multiplier design that performs multiplications in GF(p) with high throughput and low latency. The design accelerates the computation by adopting deep pipelining, and achieves high hardware utilization through data interleaving. The proposed finite field multiplier demonstrates 4.48 times higher throughput than prior work based on the identical fast multiplication algorithm and 1.43 times higher throughput than the state-of-the-art fast finite field multiplier design aimed at SIKE.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
