Quantum vs Classical Birth and Death Processes; Exactly Solvable Examples

• URL: http://arxiv.org/abs/2212.10710v1
• Date: Wed, 21 Dec 2022 01:07:27 GMT
• Title: Quantum vs Classical Birth and Death Processes; Exactly Solvable Examples
• Authors: Ryu Sasaki
• Abstract summary: A coinless quantisation procedure of continuous and discrete time Birth and Death (BD) processes is presented. The quantum and classical systems share the entire eigenvalues and the eigenvectors are related one to one.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A coinless quantisation procedure of continuous and discrete time Birth and Death (BD) processes is presented. The quantum Hamiltonian H is derived by similarity transforming the matrix L describing the BD equation in terms of the square root of the stationary (reversible) distribution. The quantum and classical systems share the entire eigenvalues and the eigenvectors are related one to one. When the birth rate B(x) and the death rate D(x) are chosen to be the coefficients of the difference equation governing the orthogonal polynomials of Askey scheme, the quantum system is exactly solvable. The eigenvectors are the orthogonal polynomials themselves and the eigenvalues are given analytically. Many examples are periodic since their eigenvalues are all integers, or all integers for integer parameters. The situation is very similar to the exactly solvable one dimensional quantum mechanical systems. These exactly solvable Markov chains contain many adjustable free parameters which could be helpful for various simulation purposes.

Related papers

• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Markov chains with doubly stochastic transition matrices and application to a sequence of non-selective quantum measurements [0.0]
  A time-dependent finite-state Markov chain that uses doubly transition matrices is considered. entropy that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are studied.
  arXiv  Detail & Related papers  (2022-03-16T14:58:38Z)
• Why we should interpret density matrices as moment matrices: the case of (in)distinguishable particles and the emergence of classical reality [69.62715388742298]
  We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs) We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way. We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
  arXiv  Detail & Related papers  (2022-03-08T14:47:39Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Lyapunov equation in open quantum systems and non-Hermitian physics [0.0]
  The continuous-time differential Lyapunov equation is widely used in linear optimal control theory. In quantum physics, it is known to appear in Markovian descriptions of linear (quadratic Hamiltonian, linear equations of motion) open quantum systems. We establish the Lyapunov equation as a fundamental and efficient formalism for linear open quantum systems.
  arXiv  Detail & Related papers  (2022-01-03T14:40:07Z)
• Multipartite quantum systems: an approach based on Markov matrices and the Gini index [0.0]
  An interpretation of the formalism in terms of sequences of integers that open random safes is presented. The formalism is used in the context of multipartite quantum systems with finite dimensional Hilbert space.
  arXiv  Detail & Related papers  (2021-05-26T05:28:42Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• 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)
• Inverse iteration quantum eigensolvers assisted with a continuous variable [0.0]
  We propose inverse iteration quantum eigensolvers, which exploit the power of quantum computing for the classical inverse power iteration method. A key ingredient is constructing an inverse Hamiltonian as a linear combination of coherent Hamiltonian evolution. We demonstrate the quantum algorithm with numerical simulations under finite squeezing for various physical systems.
  arXiv  Detail & Related papers  (2020-10-07T07:31:11Z)

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.