2012
DOI: 10.48550/arxiv.1207.3261
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantum logarithmic Sobolev inequalities and rapid mixing

Michael J. Kastoryano,
Kristan Temme
Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
19
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(19 citation statements)
references
References 0 publications
0
19
0
Order By: Relevance
“…For a more comprehensive exposition, consult Ref. [19]. The mixing time of a quantum Markov process is the time it takes for the process to become close to the stationary state, starting from an arbitrary initial state.…”
Section: Mixing Times Of Semi-groupsmentioning
confidence: 99%
See 4 more Smart Citations
“…For a more comprehensive exposition, consult Ref. [19]. The mixing time of a quantum Markov process is the time it takes for the process to become close to the stationary state, starting from an arbitrary initial state.…”
Section: Mixing Times Of Semi-groupsmentioning
confidence: 99%
“…A huge amount of effort has been invested in bounding the mixing time of classical Markov processes; especially in the setting of Markov chain Monte Carlo [35]. Recently, a set of functional tools have been developed for analyzing the quantum analogue of Markov chain mixing for one parameter semi-groups [20,19]. In particular, trace norm convergence of primitive semi-groups can be very well characterized in terms of two quantities: the inverse of the smallest eigenvalue of the stationary state σ −1 , and one of two exponential decay rates, the χ 2 constant λ s [20] or the Log-Sobolev constant α s [19].…”
Section: Mixing Times Of Semi-groupsmentioning
confidence: 99%
See 3 more Smart Citations