Pith. sign in

REVIEW 1 cited by

Spectral delineation of Markov Generators: Classical vs Quantum

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.07903 v1 pith:CMGXAXDK submitted 2025-04-10 cond-mat.stat-mech quant-ph

Spectral delineation of Markov Generators: Classical vs Quantum

classification cond-mat.stat-mech quant-ph
keywords quantumgeneratorsspectraclassicaldiskstochasticuniteigenvalues
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The celebrated theorem of Perron and Frobenius implies that spectra of classical Markov operators, represented by stochastic matrices, are restricted to the unit disk. This property holds also for spectra of quantum stochastic maps (quantum channels), which describe quantum Markovian evolution in discrete time. Moreover, the spectra of stochastic $N \times N$ matrices are additionally restricted to a subset of the unit disk, called Karpelevi\u{c} region, the shape of which depends on $N$. We address the question of whether the spectra of generators, which induce Markovian evolution in continuous time, can be bound in a similar way. We propose a rescaling that allows us to answer this question affirmatively. The eigenvalues of the rescaled classical generators are confined to the modified Karpelevi\u{c} regions, whereas the eigenvalues of the rescaled quantum generators fill the entire unit disk.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Improved sample complexity bound for sample-based Lindbladian simulation

    quant-ph 2026-05 unverdicted novelty 7.0

    Derives explicit sample complexity bound O(d t²/ε) for WML-based Lindbladian simulation, with typical-case O(t²/ε) when ||L||_∞² = O(1/d) and worst-case Ω(d t²/ε).