Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Open Systems & Information Dynamics

Generic Quantum Markov Semigroups with Degenerate Ground States: The Fock Case

Skander Hachicha, Ikbel Nasraoui

Published Jun 1, 2018• 2 citations
Publisher

Abstract

We consider quantum Markov semigroups arising from the weak coupling limit of a system with generic Hamiltonian coupled to a boson Fock zero temperature reservoir. We find all the invariant states of a generic quantum Markov semigroup and compute explicitly the limit invariant state explicitly starting from an arbitrary initial state. We also show that convergence is exponentially fast under some natural assumptions.

DOI
10.1142/s1230161218500105

Related papers

Generic Quantum Markov Semigroups: the Gaussian Gauge Invariant Case

Raffaella Carbone, Franco Fagnola, Skander Hachicha

We study a class of generic quantum Markov semigroups on the algebra of all bounded operators on a Hilbert space h arising from the stochastic limit of a discrete system with generic Hamiltonian HS, acting on h, interacting with a Gaussian, gauge invariant, reservoir. The selfadjoint operator HS determines a privileged orthonormal basis of h. These semigroups leave invariant diagonal and off-diagonal bounded operators with respect to this basis. The action on diagonal operators describes a classical Markov jump process. We construct generic semigroups from their formal generators by the minimal semigroup method and discuss their conservativity (uniqueness). When the semigroup is irreducible we prove uniqueness of the equilibrium state and show that, starting from an arbitrary initial state, the semigroup converges towards this state. We also prove that the exponential speed of convergence of the quantum Markov semigroup coincides with the exponential speed of convergence of the classical (diagonal) semigroup towards its unique invariant measure. The exponential speed is computed or estimated in some examples.

Open Systems & Information Dynamics•Dec 1, 2007•36 citations

Decomposition and Classification of Generic Quantum Markov Semigroups: The Gaussian Gauge Invariant Case

Franco Fagnola, Skander Hachicha

We study the structure of generic quantum Markov semigroups, arising from the stochastic limit of a discrete system with generic Hamiltonian interacting with a Gaussian gauge invariant reservoir. We show that they can be essentially written as the sum of their irreducible components determined by closed classes of states of the associated classical Markov jump process. Each irreducible component turns out to be recurrent, transient or have an invariant state if and only if its classical (diagonal) restriction is recurrent, transient or has an invariant state, respectively. We classify invariant states and study convergence towards invariant states as time goes to infinity.

Open Systems & Information Dynamics•Jun 1, 2012•5 citations

GENERIC q-MARKOV SEMIGROUPS AND SPEED OF CONVERGENCE OF q-ALGORITHMS

Luigi Accardi, Franco Fagnola, Skander Hachicha

We study a special class of generic quantum Markov semigroups, on the algebra of all bounded operators on a Hilbert space [Formula: see text], arising in the stochastic limit of a generic system interacting with a boson–Fock reservoir. This class depends on an orthonormal basis of [Formula: see text]. We obtain a new estimate for the trace distance of a state from a pure state and use this estimate to prove that, under the action of a semigroup of this class, states with finite support with respect to the given basis converge to equilibrium with a speed which is exponential, but with a polynomial correction which makes the convergence increasingly worse as the dimension of the support increases (Theorem 5.1). We interpret the semigroup as an algorithm, its initial state as input and, following Belavkin and Ohya,10 the dimension of the support of a state as a measure of complexity of the input. With this interpretation, the above results mean that the complexity of the input "slows down" the convergence of the algorithm. Even if the convergence is exponential and the slow down the polynomial, the constants involved may be such that the convergence times become unacceptable from a computational standpoint. This suggests that, in the absence of estimates of the constants involved, distinctions such as "exponentially fast" and "polynomially slow" may become meaningless from a constructive point of view. We also show that, for arbitray states, the speed of convergence to equilibrium is controlled by the rate of decoherence and the rate of purification (i.e. of concentration of the probability on a single pure state). We construct examples showing that the order of magnitude of these two decays can be quite different.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Dec 1, 2006•44 citations

Generic Fock quantum Markov semigroups with instantaneous states

Anis Ben Ghorbal, Franco Fagnola, Skander Hachicha +1 more

We construct a generic quantum Markov semigroup with instantaneous states exploiting the invariance of the diagonal algebra and the explicit form of the action of the pre-generator on off-diagonal matrix elements.Our semigroup acts on a unital C * -algebra and is strongly continuous on this algebra (Feller property).We discuss the generic hydrogen type atoms as an example.

Communications on Stochastic Analysis•Aug 1, 2008•1 citation

Generic Quantum Markov Semigroups: the Fock Case

Luigi Accardi, Skander Hachicha, Habib Ouerdiane

We introduce the class of generic quantum Markov semigroups. Within this class we study the class corresponding to the Fock case which is further split into four subclasses each of which contains both bounded and unbounded generators, depending on some global characteristics of the intensities of jumps. For the first two of these classes we find an explicit solution which reduces the problem of finding the quantum semigroup to the calculation of two classical semigroups, one of which is diagonal (in a suitable basis) and the other one is triangular (in the same basis). In the bounded case our formula gives the unique solution. In the unbounded case it gives one solution, which we conjecture to be the minimal one.

Open Systems & Information Dynamics•Nov 11, 2005•8 citations

A characterization of quantum Markov semigroups of weak coupling limit type

Franco Fagnola, Roberto B. Quezada

We characterize generators of quantum Markov semigroups leaving invariant a maximal abelian purely atomic algebra and certain operator subspaces associated with it in a natural way. From this result, we also establish a characterization of generators of quantum Markov semigroups of weak coupling limit type associated with a nondegenerate Hamiltonian.

Infinite Dimensional Analysis Quantum Probability and Related Topics•Jun 1, 2019•8 citations
We consider quantum Markov semigroups arising from the weak coupling limit of a system with generic Hamiltonian coupled to a boson Fock zero temperature reservoir. We find all the invariant states of a generic quantum Markov semigroup and compute explicitly the limit invariant state explicitly starting from an arbitrary initial state. We also show that convergence is exponentially fast under some natural assumptions.
We study a class of generic quantum Markov semigroups on the algebra of all bounded operators on a Hilbert space h arising from the stochastic limit of a discrete system with generic Hamiltonian HS, acting on h, interacting with a Gaussian, gauge invariant, reservoir. The selfadjoint operator HS determines a privileged orthonormal basis of h. These semigroups leave invariant diagonal and off-diagonal bounded operators with respect to this basis. The action on diagonal operators describes a classical Markov jump process. We construct generic semigroups from their formal generators by the minimal semigroup method and discuss their conservativity (uniqueness). When the semigroup is irreducible we prove uniqueness of the equilibrium state and show that, starting from an arbitrary initial state, the semigroup converges towards this state. We also prove that the exponential speed of convergence of the quantum Markov semigroup coincides with the exponential speed of convergence of the classical (diagonal) semigroup towards its unique invariant measure. The exponential speed is computed or estimated in some examples.
We study the structure of generic quantum Markov semigroups, arising from the stochastic limit of a discrete system with generic Hamiltonian interacting with a Gaussian gauge invariant reservoir. We show that they can be essentially written as the sum of their irreducible components determined by closed classes of states of the associated classical Markov jump process. Each irreducible component turns out to be recurrent, transient or have an invariant state if and only if its classical (diagonal) restriction is recurrent, transient or has an invariant state, respectively. We classify invariant states and study convergence towards invariant states as time goes to infinity.
We study a special class of generic quantum Markov semigroups, on the algebra of all bounded operators on a Hilbert space [Formula: see text], arising in the stochastic limit of a generic system interacting with a boson–Fock reservoir. This class depends on an orthonormal basis of [Formula: see text]. We obtain a new estimate for the trace distance of a state from a pure state and use this estimate to prove that, under the action of a semigroup of this class, states with finite support with respect to the given basis converge to equilibrium with a speed which is exponential, but with a polynomial correction which makes the convergence increasingly worse as the dimension of the support increases (Theorem 5.1). We interpret the semigroup as an algorithm, its initial state as input and, following Belavkin and Ohya,10 the dimension of the support of a state as a measure of complexity of the input. With this interpretation, the above results mean that the complexity of the input "slows down" the convergence of the algorithm. Even if the convergence is exponential and the slow down the polynomial, the constants involved may be such that the convergence times become unacceptable from a computational standpoint. This suggests that, in the absence of estimates of the constants involved, distinctions such as "exponentially fast" and "polynomially slow" may become meaningless from a constructive point of view. We also show that, for arbitray states, the speed of convergence to equilibrium is controlled by the rate of decoherence and the rate of purification (i.e. of concentration of the probability on a single pure state). We construct examples showing that the order of magnitude of these two decays can be quite different.
We introduce the class of generic quantum Markov semigroups. Within this class we study the class corresponding to the Fock case which is further split into four subclasses each of which contains both bounded and unbounded generators, depending on some global characteristics of the intensities of jumps. For the first two of these classes we find an explicit solution which reduces the problem of finding the quantum semigroup to the calculation of two classical semigroups, one of which is diagonal (in a suitable basis) and the other one is triangular (in the same basis). In the bounded case our formula gives the unique solution. In the unbounded case it gives one solution, which we conjecture to be the minimal one.