ترغب بنشر مسار تعليمي؟ اضغط هنا

Electric circuit induced by quantum walk

69   0   0.0 ( 0 )
 نشر من قبل Etsuo Segawa
 تاريخ النشر 2020
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We consider the Szegedy walk on graphs adding infinite length tails to a finite internal graph. We assume that on these tails, the dynamics is given by the free quantum walk. We set the $ell^infty$-category initial state so that the internal graph receives time independent input from the tails, say $boldsymbol{alpha}_{in}$, at every time step. We show that the response of the Szegedy walk to the input, which is the output, say $boldsymbol{beta}_{out}$, from the internal graph to the tails in the long time limit, is drastically changed depending on the reversibility of the underlying random walk. If the underlying random walk is reversible, we have $boldsymbol{beta}_{out}=mathrm{Sz}(boldsymbol{m}_{delta E})boldsymbol{alpha}_{in}$, where the unitary matrix $mathrm{Sz}(boldsymbol{m}_{delta E})$ is the reflection matrix to the unit vector $boldsymbol{m}_{delta E}$ which is determined by the boundary of the internal graph $delta E$. Then the global dynamics so that the internal graph is regarded as one vertex recovers the local dynamics of the Szegedy walk in the long time limit. Moreover if the underlying random walk of the Szegedy walk is reversible, then we obtain that the stationary state is expressed by a linear combination of the reversible measure and the electric current on the electric circuit determined by the internal graph and the random walks reversible measure. On the other hand, if the underlying random walk is not reversible, then the unitary matrix is just a phase flip; that is, $boldsymbol{beta}_{out}=-boldsymbol{alpha}_{in}$, and the stationary state is similar to the current flow but satisfies a different type of the Kirchhoff laws.

قيم البحث

اقرأ أيضاً

Topological phases exhibit a plethora of striking phenomena including disorder-robust localization and propagation of waves of various nature. Of special interest are the transitions between the different topological phases which are typically contro lled by the external parameters. In contrast, in this Letter, we predict the topological transition in the two-particle interacting system driven by the particles quantum statistics. As a toy model, we investigate an extended one-dimensional Hubbard model with two anyonic excitations obeying fractional quantum statistics in-between bosons and fermions. As we demonstrate, the interplay of two-particle interactions and tunneling processes enables topological edge states of anyon pairs whose existence and localization at one or another edge of the one-dimensional system is governed by the quantum statistics of particles. Since a direct realization of the proposed system is challenging, we develop a rigorous method to emulate the eigenmodes and eigenenergies of anyon pairs with resonant electric circuits.
We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $ell^infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary st ate exists, moreover a perfect transmission to the opposite tail always occurs in the long time limit. We also show that the lower bound of the norm of the stationary measure restricted to the internal graph is proportion to the number of edges of this graph. Furthermore when we add more tails (e.g., $r$-tails) to the internal graph, then we find that from the temporal and spatial global view point, the scattering to each tail in the long time limit coincides with the local one-step scattering manner of the Grover walk at a vertex whose degree is $(r+1)$.
86 - Andrew M. Childs 2008
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.
The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years, the growing interest in noisy intermediate-scale quantum computers (NISQ) has lead to intense efforts being directed at understanding the computational advantages of open quantum systems. In this work, we extend the quantum walk model to open noisy systems in order to provide such a tool for the study of NISQ computers. Our method does not use explicit purification, and allows to ignore the environment degrees of freedom and get direct and much more efficient access to the entanglement properties of the system. In our representation, the quantum walk amplitudes represent elements in a density matrix rather than the wavefunction of a pure state. Despite the non-trivial manifestation of the normalization requirement in this setting, we model the application of general unitary gates and nonunitary channels, with an explicit implementation protocol for channels that are commonly used in noise models.
71 - Simon Apers 2019
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as $widetilde{O}(m^{1/3 } delta^{-1/3})$, with $m$ the number of edges and $delta$ the random walk spectral gap. This improves on existing strategies by initially growing a classical seed set in the graph, from which a quantum walk is then run. The algorithm leads to a number of improvements: (i) it provides a new bound on the setup cost of quantum walk search algorithms, (ii) it yields a new algorithm for $st$-connectivity, and (iii) it allows to create a superposition over the isomorphisms of an $n$-node graph in time $widetilde{O}(2^{n/3})$, surpassing the $Omega(2^{n/2})$ barrier set by index erasure.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا