Quantum vs classical Markov chains; Exactly solvable examples

• URL: http://arxiv.org/abs/2212.10713v1
• Date: Wed, 21 Dec 2022 01:24:23 GMT
• Title: Quantum vs classical Markov chains; Exactly solvable examples
• Authors: Ryu Sasaki
• Abstract summary: A quantum Hamiltonian H is obtained by a similarity transformation of the fundamental transition probability matrix K. The evolution of the classical and quantum Markov chains are described.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A coinless quantisation procedure of general reversible Markov chains on graphs is presented. A quantum Hamiltonian H is obtained by a similarity transformation of the fundamental transition probability matrix K in terms of the square root of the reversible distribution. The evolution of the classical and quantum Markov chains are described by the solutions of the eigenvalue problem of the quantum Hamiltonian H. About twenty plus exactly solvable Markov chains based on the hypergeometric orthogonal polynomials of Askey scheme, derived by Odake-Sasaki, would provide a good window for scrutinising the quantum/classical contrast of Markov chains. Among them five explicit examples, related to the Krawtchouk, Hahn, q-Hahn, Charlier and Meixner, are demonstrated to illustrate the actual calculations.

Related papers

• Quantized Markov chain couplings that prepare Qsamples [0.0]
  We present a novel approach to quantizing Markov chains. The approach is based on the Markov chain coupling method. We show that the convergence time of the quantum map is directly related to the coupling time of the Markov chain.
  arXiv  Detail & Related papers  (2025-04-03T14:48:47Z)
• Quantum Speedup for Nonreversible Markov Chains [0.0]
  It has been discussed that Markov chains problems could be solved significantly faster using quantum computing. This study uses modern quantum algorithmic techniques and Markov chain theory to sample from the stationary distribution of nonreversible Markov chains.
  arXiv  Detail & Related papers  (2025-01-10T11:09:40Z)
• Quantum Spin Chains and Symmetric Functions [1.7802147489386628]
  We consider the question of what quantum spin chains naturally encode in their Hilbert space. quantum spin chains are examples of "quantum integrable systems"
  arXiv  Detail & Related papers  (2024-04-05T18:00:02Z)
• Virtual Quantum Markov Chains [4.656320930335616]
  We propose the concept of virtual quantum Markov chains (VQMCs) VQMCs characterize states where arbitrary global shadow information can be recovered from subsystems through local quantum operations and measurements. We show that the virtual quantum recovery is fully determined by the block matrices of a quantum state on its subsystems.
  arXiv  Detail & Related papers  (2023-12-04T16:51:28Z)
• Emergence of Kac-Moody Symmetry in Critical Quantum Spin Chains [0.0]
  We numerically investigate the emergence of Kac-Moody symmetry at low energies and long distances. We first propose a method to construct lattice operators corresponding to the Kac-Moody generators. We numerically show that, when projected onto low energy states of the quantum spin chain, these operators indeed approximately fulfill the Kac-Moody algebra.
  arXiv  Detail & Related papers  (2022-06-03T16:02:50Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity [0.0]
  Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum computer by preparing a quantum state that encodes the entire probability distribution followed by a projective measurement. We investigate the complexity of adiabatically preparing such quantum states for the Gibbs distributions of various models including the Ising chain, hard-sphere models on different graphs, and a model encoding the unstructured search problem.
  arXiv  Detail & Related papers  (2021-09-07T11:43:45Z)
• Preserving quantum correlations and coherence with non-Markovianity [50.591267188664666]
  We demonstrate the usefulness of non-Markovianity for preserving correlations and coherence in quantum systems. For covariant qubit evolutions, we show that non-Markovianity can be used to preserve quantum coherence at all times.
  arXiv  Detail & Related papers  (2021-06-25T11:52:51Z)
• Exact thermal properties of free-fermionic spin chains [68.8204255655161]
  We focus on spin chain models that admit a description in terms of free fermions. Errors stemming from the ubiquitous approximation are identified in the neighborhood of the critical point at low temperatures.
  arXiv  Detail & Related papers  (2021-03-30T13:15:44Z)
• 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)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)
• 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.