اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum-classical distance as a tool to design optimal chiral quantum walk
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian generator of CTQWs, which are the complex phases along the loops of the underlying graph, was acknowledged for its interest in optimizing or suppressing transport on specific topologies. We argue that the quantum-classical distance, a figure of merit which was introduced to capture the difference in dynamics between a CTQW and its classical, stochastic counterpart, guides the optimization of parameters of the Hamiltonian to achieve better quantum transport on cycle graphs and spatial search to the quantum speed limit without an oracle on complete graphs, the latter also implying fast uniform mixing. We compare the variations of this quantity with the 1-norm of coherence and the Inverse Participation Ratio, showing that the quantum-classical distance is linked to both, but in a topology-dependent relation, which is key to spot the most interesting quantum evolution in each case.
قيم البحث
اقرأ أيضاً
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to simulate a qua
ntum machine to execute the quantum walk. In this way, to minimize the computational cost, the methodology employed to train the neural network will adjust the synaptic weights of the output layer, not altering the weights of the hidden layer, inspired in the method of Extreme Learning Machine. The quantum walk algorithm as a search algorithm is quadratically faster than its classic analog. The quantum walk variance is $O(t)$ while the variance of its classic analog is $O(sqrt{t})$, where $t$ is the time or iteration. In addition to computational gain, another advantage of the proposed procedure is to be possible to know textit{a priori} the number of iterations required to obtain the solutions, unlike the classical training algorithms based on gradient descendent.
We have realized a quantum walk in momentum space with a rubidium spinor Bose-Einstein condensate by applying a periodic kicking potential as a walk operator and a resonant microwave pulse as a coin toss operator. The generated quantum walks appear t
o be stable for up to ten steps and then quickly transit to classical walks due to spontaneous emissions induced by laser beams of the walk operator. We investigate these quantum to classical walk transitions by introducing well controlled spontaneous emissions with an external light source during quantum walks. Our findings demonstrate a scheme to control the robustness of the quantum walks and can also be applied to other cold atom experiments involving spontaneous emissions.
We address the scattering of a quantum particle by a one-dimensional barrier potential over a set of discrete positions. We formalize the problem as a continuous-time quantum walk on a lattice with an impurity, and use the quantum Fisher information
as a mean to quantify the maximal possible accuracy in the estimation of the height of the barrier. We introduce suitable initial states of the walker and derive the reflection and transmission probabilities of the scattered state. We show that while the quantum Fisher information is affected by the width and central momentum of the initial wave packet, this dependency is weaker for the quantum signal-to-noise ratio. We also show that a dichotomic position measurement provides a nearly optimal detection scheme.
In a Quantum Walk (QW) the walker follows all possible paths at once through the principle of quantum superposition, differentiating itself from classical random walks where one random path is taken at a time. This facilitates the searching of proble
m solution spaces faster than with classical random walks, and holds promise for advances in dynamical quantum simulation, biological process modelling and quantum computation. Current efforts to implement QWs have been hindered by the complexity of handling single photons and the inscalability of cascading approaches. Here we employ a versatile and scalable resonator configuration to realise quantum walks with bright classical light. We experimentally demonstrate the versatility of our approach by implementing a variety of QWs, all with the same experimental platform, while the use of a resonator allows for an arbitrary number of steps without scaling the number of optics. Our approach paves the way for practical QWs with bright classical light and explicitly makes clear that quantum walks with a single walker do not require quantum states of light.
We introduce a fidelity-based measure $text{D}_{text{CQ}}(t)$ to quantify the differences between the dynamics of classical (CW) and quantum (QW) walks over a graph. We provide universal, graph-independent, analytic expressions of this quantum-classi
cal dynamical distance, showing that at short times $text{D}_{text{CQ}}(t)$ is proportional to the coherence of the walker, i.e. a genuine quantum feature, whereas for long times it depends only on the size of the graph. At intermediate times, $text{D}_{text{CQ}}(t)$ does depend on the graph topology through its algebraic connectivity. Our results show that the difference in the dynamical behaviour of classical and quantum walks is entirely due to the emergence of quantum features at short times. In the long time limit, quantumness and the different nature of the generators of the dynamics, e.g. the open system nature of CW and the unitary nature of QW, are instead contributing equally.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
