Metraipolis › archive › dc_d52d7a5bd53e

Directional transfer from coherence to longitudinal polarization and algebraic storage in a transmon with Markovian dephasing and a glassy environment: A non-Markovian… — arXiv:2609.37270

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37270
License (as archived)
CC0-1.0
Archived
2026-10-07T19:26:49.171Z
SHA-256 of the archived text
39cc1e1c208eeceaf70a5bd49a2361166d1e178882b5098799ee05654c50b8b6
Stable URL of this page
https://metraipolis.com/documento/dc_d52d7a5bd53e

How to cite

Directional transfer from coherence to longitudinal polarization and algebraic storage in a transmon with Markovian dephasing and a glassy environment: A non-Markovian… — arXiv:2609.37270 — arXiv (en), https://arxiv.org/abs/2609.37270 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d52d7a5bd53e (Metraipolis archive dc_d52d7a5bd53e, sha256 39cc1e1c208eeceaf70a5bd49a2361166d1e178882b5098799ee05654c50b8b6)
BibTeX
@misc{dcd52d7a5bd53e,
  title = {Directional transfer from coherence to longitudinal polarization and algebraic storage in a transmon with Markovian dephasing and a glassy environment: A non-Markovian… — arXiv:2609.37270},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37270},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d52d7a5bd53e; sha256 39cc1e1c208eeceaf70a5bd49a2361166d1e178882b5098799ee05654c50b8b6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37270. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a completely positive and trace-preserving non-Markovian transmon model with longitudinal Markovian dephasing and transverse renewal events motivated by a glassy two-level-system environment. A microscopic Hamiltonian identifies coupling subspaces; a normalized Prabhakar waiting-time law phenomenologically coarse grains slow defect reconfigurations. Forward chronological renewal histories yield an exact map-level Volterra equation, a noncommuting kernel--resolvent master equation, and an equivalent drift-conjugated Caputo-type representation with its required initial-value term. Without energy relaxation, Pauli-space dynamics splits into two one-dimensional subspaces and a coupled $(\sigma_y,\sigma_z)$ subspace supporting directional transfer between coherence and longitudinal polarization; $\sigma_x$ polarization is renewal-insensitive. For heavy-tailed waiting times with $0<\alpha<1$, branch-cut analysis gives a generic $t^{-\alpha}$ storage tail in longitudinal polarization generated from initial coherence and $O(t^{-1-\alpha})$ reverse transfer; constant-rate Poisson renewal yields pole-generated exponential decay. Independent zero-temperature relaxation at finite $T_1$ exponentially cuts off these tails when its rate is below twice the pure-dephasing rate. We compare independent inverse-Laplace reconstructions of the waiting-time density, memory kernel, and selected qubit-response components to assess numerical accuracy. For the studied parameters, Prabhakar renewal gives larger forward-transfer magnitudes at the prescribed readout than both a scale-matched constant-rate Poisson reference and an inhomogeneous Poisson reference matching the full expected-count profile, including finite-$T_1$ tests. Both Poisson references yield larger evaluated finite-window peaks. Disorder-motivated renewal memory reshapes transmon decoherence selectively by state and direction.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.37270 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:55:50.593Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).