Continuous-Time Quantum Markov Chains And Discretizations Of p-Adic Schrödinger Equations: Comparisons And Simulations

• URL: http://arxiv.org/abs/2508.06712v1
• Date: Fri, 08 Aug 2025 21:28:18 GMT
• Title: Continuous-Time Quantum Markov Chains And Discretizations Of p-Adic Schrödinger Equations: Comparisons And Simulations
• Authors: W. A. Zúñiga-Galindo, L. F. Chacón-Cortés,
• Abstract summary: We study a large class of p-adic Schr"odinger equations and the associated CTQMCs.<n>Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p-adic Schr\"odinger equations give rise to continuous-time quantum Markov chains (CTQMCs); this type of Markov chain includes the CTQWs constructed using adjacency matrices of graphs as a particular case. In this paper, we study a large class of p-adic Schr\"odinger equations and the associated CTQMCs by comparing them with p-adic heat equations and the associated continuous-time Markov chains (CTMCs). The comparison is done by a mathematical study of the mentioned equations, which requires, for instance, solving the initial value problems attached to the mentioned equations, and through numerical simulations. We conducted multiple simulations, including numerical approximations of the limiting distribution. Our simulations show that the limiting distribution of quantum Markov chains is greater than the stationary probability of their classical counterparts, for a large class of CTQMCs.

Related papers

• Identifying quantum coherence in quantum annealers [37.067444579637076]
  We use many-body coherent oscillations (MBCO) as a diagnostic for the identification of system-wide coherence in analog quantum simulators.<n>This work gives a general roadmap for the search for quantum coherence in noisy, large-scale quantum platforms.
  arXiv  Detail & Related papers  (2026-02-24T20:39:41Z)
• Stochastic Quantum Information Geometry and Speed Limits at the Trajectory Level [35.18016233072556]
  We bridge the gap between quantum information geometry and thermodynamics by introducing the Conditional Quantum Fisher Information (CQFI)<n>We show that the CQFI admits a decomposition into incoherent (population) and coherent (basis rotation) contributions, augmented by a transient interference cross-term absent at the ensemble level.
  arXiv  Detail & Related papers  (2026-01-18T16:23:26Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• One-dimensional Continuous-Time Quantum Markov Chains: qubit probabilities and measures [0.0]
  We study continuous-time QMCs on the integer line, half-line and finite segments. We are able to obtain exact probability calculations in terms of the associated matrix-valueds and measures.
  arXiv  Detail & Related papers  (2024-02-24T18:02:41Z)
• Quantum simulation of Maxwell's equations via Schr\"odingersation [27.193565893837356]
  We present quantum algorithms for electromagnetic fields governed by Maxwell's equations. The algorithms are based on the Schr"odingersation approach. Instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework.
  arXiv  Detail & Related papers  (2023-08-16T14:52:35Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum vs classical Markov chains; Exactly solvable examples [0.0]
  A coinless quantisation procedure of general reversible Markov chains on graphs is presented.<n>A quantum Hamiltonian H is obtained by a similarity transformation of the fundamental transition probability matrix K.
  arXiv  Detail & Related papers  (2022-12-21T01:24:23Z)
• Quantum-based solution of time-dependent complex Riccati equations [0.0]
  We show a time-dependent complex Riccati equation (TDCRE) as the solution of the time evolution operator (TEO) of quantum systems. The inherited symmetries of quantum systems can be recognized by a simple inspection of the TDCRE. As an application, but also as a consistency test, we compare our solution with the analytic one for the Bloch-Riccati equation.
  arXiv  Detail & Related papers  (2022-09-07T23:52:04Z)
• Approximate symmetries and quantum error correction [0.6526824510982799]
  Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. We study the competition between continuous symmetries and QEC in a quantitative manner. We showcase two explicit types of quantum codes, obtained from quantum Reed--Muller codes and thermodynamic codes, that nearly saturate our bounds.
  arXiv  Detail & Related papers  (2021-11-11T18:09:33Z)
• A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices [30.49132891333353]
  We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Our proof is based on the matrix expander (regular undirected graph) Chernoff bound [Garg et al. STOC '18] and scalar Chernoff-Hoeffding bounds for Markov chains. Our matrix Chernoff bound for Markov chains can be applied to analyze the behavior of co-occurrence statistics for sequential data.
  arXiv  Detail & Related papers  (2020-08-06T05:44:54Z)
• The $χ^2$-divergence and Mixing times of quantum Markov processes [0.0]
  We introduce quantum versions of the $chi2$-divergence, provide a detailed analysis of their properties, and apply them in the investigation of mixing times of quantum Markov processes. A strict spectral bound to the convergence rate can be given for time-discrete as well as for time-continuous quantum Markov processes.
  arXiv  Detail & Related papers  (2010-05-13T15:56:12Z)

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.