Recurrence in discrete-time quantum stochastic walks

• URL: http://arxiv.org/abs/2501.08674v2
• Date: Thu, 06 Feb 2025 15:17:30 GMT
• Title: Recurrence in discrete-time quantum stochastic walks
• Authors: Martin Stefanak, Vaclav Potocek, Iskender Yalcinkaya, Aurel Gabris, Igor Jex,
• Abstract summary: We analyze the discrete-time quantum recurrence walk on a line. We find that randomness can reduce the recurrence probability. Our results show that for certain tasks discrete-time quantum walks outperform both classical random walks and unitary quantum walks.
• Score: 0.0
• License:
• Abstract: Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which is a quantum stochastic process that interpolates between quantum and classical walk dynamics. Surprisingly, we find that introducing classical randomness can reduce the recurrence probability -- despite the fact that the classical random walk returns with certainty -- and we identify the conditions under which this intriguing phenomenon occurs. Numerical evaluation of the first-return generating function allows us to investigate the asymptotics of the return probability as the step number approaches infinity. This provides strong evidence that the suppression of recurrence probability is not a transient effect but a robust feature of the underlying quantum-classical interplay in the asymptotic limit. Our results show that for certain tasks discrete-time quantum stochastic walks outperform both classical random walks and unitary quantum walks.

Related papers

• Making sense of negative probabilities: An exact representation of the dynamics of quantum spin chains as classical stochastic processes with particle/antiparticle pairs [0.0]
  A notable issue arises when attempting to define the joint probability of non-commutative observables. We propose an exact representation of the dynamics of quantum spin chains using classical continuous-time Markov chains.
  arXiv  Detail & Related papers  (2025-02-14T19:00:11Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Hysteresis and Self-Oscillations in an Artificial Memristive Quantum Neuron [79.16635054977068]
  We study an artificial neuron circuit containing a quantum memristor in the presence of relaxation and dephasing. We demonstrate that this physical principle enables hysteretic behavior of the current-voltage characteristics of the quantum device.
  arXiv  Detail & Related papers  (2024-05-01T16:47:23Z)
• Universal and nonuniversal probability laws in Markovian open quantum dynamics subject to generalized reset processes [0.0]
  We consider quantum jump trajectories of Markovian open quantum systems subject to in time resets of their state to an initial configuration. For observables related to functions of the quantum state, we show that the probability of certain orderings in the sequences obeys a universal law.
  arXiv  Detail & Related papers  (2023-10-10T20:04:21Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Quantum Instability [30.674987397533997]
  We show how a time-independent, finite-dimensional quantum system can give rise to a linear instability corresponding to that in the classical system. An unstable quantum system has a richer spectrum and a much longer recurrence time than a stable quantum system.
  arXiv  Detail & Related papers  (2022-08-05T19:53:46Z)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation [0.0]
  We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits. The classical computational algorithm exploits a specific restriction in classical phase space which directly captures the quantum uncertainty relation.
  arXiv  Detail & Related papers  (2021-06-21T06:43:34Z)
• Probabilistic Hysteresis from a Quantum Phase Space Perspective [0.0]
  emphProbabilistic is a manifestation of cyclic irreversibility in a small, isolated classical system. We show that classical ergodization can lead to a breakdown of quantum-classical correspondence.
  arXiv  Detail & Related papers  (2020-05-31T15:40:55Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.