اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum walks as mathematical foundation for quantum gates
126
0
0.0
(
0
)
تأليف
Dmitry Solenov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit designs and can be formulated for very general field-matter interactions. It is shown that, most generally, gates are described by a set of coined quantum walks. Rotating wave and resonant approximations for field-matter interaction simplify the walks, factorizing the coin, and leading to pure continuous time quantum walk description. The walks reside on a graph formed by the Hilbert space of all involved qubits and auxiliary states, if present. Physical interactions between different parts of the system necessary to propagate entanglement through such graph -- quantum network -- enter via reduction of symmetries in graph edges. Description for several single- and two-qubit gates are given as examples.
قيم البحث
اقرأ أيضاً
Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. Th
e present paper reviews the mathematical and theoretical foundation of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence both for the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.
We show that a quantum walk process can be used to construct and secure quantum memory. More precisely, we show that a localized quantum walk with temporal disorder can be engineered to store the information of a single, unknown qubit on a compact po
sition space and faithfully recover it on demand. Since the localization occurss with a finite spread in position space, the stored information of the qubit will be naturally secured from the simple eavesdropper. Our protocol can be adopted to any quantum system for which experimental control over quantum walk dynamics can be achieved.
Non-local higher-energy auxiliary states have been successfully used to entangle pairs of qubits in different quantum computing systems. Typically a longer-span non-local state or sequential application of few-qubit entangling gates are needed to pro
duce a non-trivial multiqubit gate. In many cases a single non-local state that span over the entire system is difficult to use due to spectral crowding or impossible to have. At the same time, many multiqubit systems can naturally develop a network of multiple non-local higher-energy states that span over few qubits each. We show that continuous time quantum walks can be used to address this problem by involving multiple such states to perform local and entangling operations concurrently on many qubits. This introduces an alternative approach to multiqubit gate compression based on available physical resources. We formulate general requirements for such walks and discuss configurations of non-local auxiliary states that can emerge in quantum computing architectures based on self-assembled quantum dots, defects in diamond, and superconducting qubits, as examples. Specifically, we discuss a scalable multiqubit quantum register constructed as a single chain with nearest-neighbor interactions. We illustrate how quantum walks can be configured to perform single-, two- and three-qubit gates, including Hadamard, Control-NOT, and Toffoli gates. Continuous time quantum walks on graphs involved in these gates are investigated.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
