The localization of quantum random walks on sierpinski gaskets

• URL: http://arxiv.org/abs/2103.10575v1
• Date: Fri, 19 Mar 2021 00:22:34 GMT
• Title: The localization of quantum random walks on sierpinski gaskets
• Abstract summary: We consider the discrete time quantum random walks on a Sierpinski gasket. We define and solve the amplitude Green functions when the level of the fractal graph goes to infinity.
• Score: 5.473331579671874
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $\beta_w$ , total variation exponents $\delta_w$ and relative entropy exponents $\eta_w$ . We define and solve the amplitude Green functions recursively when the level of the fractal graph goes to infinity. We obtain exact recursive formulas for the amplitude Green functions, based on which the hitting probabilities and expectation of the first-passage time are calculated. Using the recursive formula with the aid of Monte Carlo integration, we evaluate their numerical values. We also show that when the level of the fractal graph goes to infinity, with probability 1, the quantum random walks will return to origin, i.e., the quantum walks on Sierpinski gasket are recurrent.

Related papers

• Many-Body Quantum Chaos At All Time Scales [0.0]
  We study the Green's and out-of-time order correlation functions of the four-body, $N$-Majorana Sachdev-Ye-Kitaev model.<n>For late times that scale exponentially with $N$, both functions have a dip-ramp-plateau pattern for $N mathrmmod8 = 2, 6$ that deviates substantially from the ergodic prediction.
  arXiv  Detail & Related papers  (2026-05-26T18:00:03Z)
• On Gaussian approximation for entropy-regularized Q-learning with function approximation [30.147231451149064]
  We derive rates of convergence in the high-dimensional central theorem for Polyak-uppert iterates generated by entropy-regularized asynchronous Q-learning.<n>We establish a Gaussian approximation bound in the convex distance with rate of order $n-1/4$, up to polyarithmic factors in $n$, where $n$ is the number of samples used by the algorithm.
  arXiv  Detail & Related papers  (2026-05-17T22:23:25Z)
• Computing Green's functions and improving ground state energy estimation on quantum computers with Liouvillian recursion [35.18016233072556]
  We present a quantum-classical hybrid implementation of the Liouvillian recursion method compute many-body Green functions using a quantum computer.<n>From an approximate ground state preparation circuit, this algorithm produces the local ($r=r'$) and inter-site ($rneq r'$) Green's functions.
  arXiv  Detail & Related papers  (2026-03-05T16:28:48Z)
• Adiabatic preparation of many-body quantum states: getting the beginning and ending right [1.631115063641726]
  We demonstrate that the end-to-end transfer error can be suppressed by adopting smooth initial and final scheduling functions for the Hamiltonian.<n>We show, in particular, that if the time dependent Hamiltonian is $n$ times differentiable with vanishing $1st$ to $nth$ order derivatives in the beginning and in the end, the infidelity with respect to the final adiabatic eigenstate scales as $1/Tn+1$ when evolving for time $T$.
  arXiv  Detail & Related papers  (2025-12-19T16:50:46Z)
• Quantum-driven sampling of the quasi-uniform distribution via quantum walks [0.5097809301149341]
  We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution.<n>We show that when the quantum walk parameters, such as the coin operator and initial state, satisfy the conditions of the ergodic theorem for random walks on finite groups, the resulting sequence convergesally to the uniform distribution.
  arXiv  Detail & Related papers  (2025-11-11T14:26:18Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Approximation theory for Green's functions via the Lanczos algorithm [0.0]
  It is known that Green's functions can be expressed as continued fractions. We present a theory concerning errors in approximating Green's functions using continued fractions.
  arXiv  Detail & Related papers  (2025-04-30T18:00:43Z)
• Measurement induced phase transition in a quantum Ising model by periodic measurements [0.0]
  We present a model where a global measurement is performed with certainty at every time-step of the measurement protocol. The transition at finite (tau_c) for (L sim 28) seems to recede to (tau_c = 0) in the thermodynamic limit.
  arXiv  Detail & Related papers  (2025-01-29T12:23:44Z)
• Quantum walks advantage on the dihedral group for uniform sampling problem [0.0]
  Mixing through walks is the process for a Markov chain to approximate a stationary distribution for a group. Quantum walks have shown potential advantages in mixing time over the classical case but lack general proof in the finite group case. This work has potential applications in algorithms for sampling non-abelian groups, graph isomorphism tests, etc.
  arXiv  Detail & Related papers  (2023-12-25T11:21:55Z)
• Thermodynamic phases in first detected return times of quantum many-body systems [0.0]
  We study the probability distribution of the first return time to the initial state of a quantum many-body system. We show that this distribution can be interpreted as a continuation of the canonical partition function of a spin chain with non-interacting domains at equilibrium.
  arXiv  Detail & Related papers  (2023-11-09T18:47:07Z)
• Quantum Chebyshev Transform: Mapping, Embedding, Learning and Sampling Distributions [18.124351208075062]
  We show how to encode data into quantum states with amplitudes growing exponentially in the system size. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity. This enables automatic model differentiation, and opens a route to solving differential equations.
  arXiv  Detail & Related papers  (2023-06-29T15:19:32Z)
• Exploring $2d$ localization with a step dependent coin [0.0]
  We generalize the coin operator of citeZahed023 to include a step dependent feature which induces localization in $2d$. We compute and compare three distinct measures (a) Shannon Entropy in the position and coin space, (b) Entanglement entropy between position and spin space, and (c) Quantum Relative Entropy which is a POVM of density operators of the step dependent and step independent coins.
  arXiv  Detail & Related papers  (2023-03-12T22:27:30Z)
• Geometric phases along quantum trajectories [58.720142291102135]
  We study the distribution function of geometric phases in monitored quantum systems. For the single trajectory exhibiting no quantum jumps, a topological transition in the phase acquired after a cycle. For the same parameters, the density matrix does not show any interference.
  arXiv  Detail & Related papers  (2023-01-10T22:05:18Z)
• Geometric relative entropies and barycentric Rényi divergences [16.385815610837167]
  monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure. We show that monotone quantum relative entropies define monotone R'enyi quantities whenever $P$ is a probability measure.
  arXiv  Detail & Related papers  (2022-07-28T17:58:59Z)
• The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for Two-Dimensional Systems [62.997667081978825]
  Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation. We exhaustively study the case of a Hilbert space dimension of $2$.
  arXiv  Detail & Related papers  (2022-04-16T07:03:54Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Sublinear quantum algorithms for estimating von Neumann entropy [18.30551855632791]
  We study the problem of obtaining estimates to within a multiplicative factor $gamma>1$ of the Shannon entropy of probability distributions and the von Neumann entropy of mixed quantum states. We work with the quantum purified query access model, which can handle both classical probability distributions and mixed quantum states, and is the most general input model considered in the literature.
  arXiv  Detail & Related papers  (2021-11-22T12:00:45Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Lanczos recursion on a quantum computer for the Green's function and ground state [0.0]
  A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas.
  arXiv  Detail & Related papers  (2020-08-12T22:50:47Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)
• From stochastic spin chains to quantum Kardar-Parisi-Zhang dynamics [68.8204255655161]
  We introduce the asymmetric extension of the Quantum Symmetric Simple Exclusion Process. We show that the time-integrated current of fermions defines a height field which exhibits a quantum non-linear dynamics.
  arXiv  Detail & Related papers  (2020-01-13T14:30:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.