اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCyclic networks of quantum gates
56
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article initial steps in an analysis of cyclic networks of quantum logic gates is given. Cyclic networks are those in which the qubit lines are loops. Here we have studied one and two qubit systems plus two qubit cyclic systems connected to another qubit on an acyclic line. The analysis includes the group classification of networks and studies of the dynamics of the qubits in the cyclic network and of the perturbation effects of an acyclic qubit acting on a cyclic network. This is followed by a discussion of quantum algorithms and quantum information processing with cyclic networks of quantum gates, and a novel implementation of a cyclic network quantum memory. Quantum sensors via cyclic networks are also discussed.
قيم البحث
اقرأ أيضاً
We extend the circuit model of quantum comuptation so that the wiring between gates is soft-coded within registers inside the gates. The addresses in these registers can be manipulated and put into superpositions. This aims at capturing indefinite ca
usal orders, as well as making their geometrical layout explicit. We show how to implement the quantum switch and the polarizing beam splitter within our model. One difficulty is that the names used as addresses should not matter beyond the wiring they describe, i.e. the evolution should commute with renamings. Yet, the evolution may act nontrivially on these names. Our main technical contribution is a full characterization of such nameblind matrices.
High quality, fully-programmable quantum processors are available with small numbers (<1000) of qubits, and the scientific potential of these near term machines is not well understood. If the small number of physical qubits precludes practical quantu
m error correction, how can these error-susceptible processors be used to perform useful tasks? We present a strategy for developing quantum error detection for certain gate imperfections that utilizes additional internal states and does not require additional physical qubits. Examples for adding error detection are provided for a universal gate set in the trapped ion platform. Error detection can be used to certify individual gate operations against certain errors, and the irreversible nature of the detection allows a result of a complex computation to be checked at the end for error flags.
The presence of decoherence in quantum computers necessitates the suppression of noise. Dynamically corrected gates via specially designed control pulses offer a path forward, but hardware-specific experimental constraints can cause complications. He
re, we present a widely applicable method for obtaining smooth pulses which is not based on a sampling approach and does not need any assumptions with regards to the underlying statistics of the experimental noise. We demonstrate the capability of our approach by finding smooth shapes which suppress the effects of noise within the logical subspace as well as leakage out of that subspace.
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standa
rd process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized pi/2 pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.
Causal reasoning is essential to science, yet quantum theory challenges it. Quantum correlations violating Bell inequalities defy satisfactory causal explanations within the framework of classical causal models. What is more, a theory encompassing qu
antum systems and gravity is expected to allow causally nonseparable processes featuring operations in indefinite causal order, defying that events be causally ordered at all. The first challenge has been addressed through the recent development of intrinsically quantum causal models, allowing causal explanations of quantum processes -- provided they admit a definite causal order, i.e. have an acyclic causal structure. This work addresses causally nonseparable processes and offers a causal perspective on them through extending quantum causal models to cyclic causal structures. Among other applications of the approach, it is shown that all unitarily extendible bipartite processes are causally separable and that for unitary processes, causal nonseparability and cyclicity of their causal structure are equivalent.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
