Pith. sign in

REVIEW 2 major objections 6 minor 44 references

Every Markovian open quantum system is exactly two magnetic graphs with operator-valued edge signals, so the master equation becomes an average wave feature on those graphs.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-11 14:35 UTC pith:YYWW4V33

load-bearing objection Exact two-graph operator-measure map of the full Lindblad generator is an identity once bases are fixed; open-Rabi illustrations and pruning/GCN are consistent numerical consequences, not independent proofs. the 2 major comments →

arxiv 2607.04721 v1 pith:YYWW4V33 submitted 2026-07-06 quant-ph physics.comp-ph

Mapping open quantum dynamics onto graphs

Kyuho Kim , Dayeong Lee , Seungkyun Park , Xianji Piao , Namkyoo Park , Sunkyu Yu This is my paper
classification quant-ph physics.comp-ph
keywords open quantum systemsLindblad master equationmagnetic graphsSchrödinger operator graphquantum Rabi modelgraph neural networksultrastrong couplingLiouville spectrum
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Open quantum systems are usually written as abstract algebraic equations that hide how system-bath couplings are connected. This paper shows that once a fixed operator basis is chosen, every Markovian Lindblad generator is exactly the sum of two uniquely determined magnetic graphs: one for the Hamiltonian and one for the dissipative Kossakowski matrix. The master equation is then the average wave characteristic of operator-valued signals that live on those graphs. The authors apply the construction to the open quantum Rabi model, recover an open-system version of Fock-state lattices, read off topological signatures of cavity loss versus dephasing, and track the weak-to-ultrastrong-coupling transition by watching connectivity and hub structure grow. Pruning the weak edges leaves a sparse backbone that still preserves the Liouville spectrum and trains a graph neural network more accurately and more quickly than the full graph. The result turns the connectivity of system-bath operators into an explicit, learnable object rather than an algebraic afterthought.

Core claim

Once an orthonormal operator basis is fixed, every Markovian Lindblad generator is exactly equal to a linear combination of two operator measures on uniquely determined magnetic graphs with vertex potentials: d|ρ⟩/dt = [N M_H(G_H) + (N^{2}−1) M_L(G_L)] |ρ⟩. All non-unitary dynamics therefore live entirely in the topology and vertex potentials of those two graphs.

What carries the argument

Schrödinger operator graph: a magnetic graph whose edges carry operator-valued signals; the graph Hamiltonian (magnetic Laplacian plus vertex potential) acts on those signals, and the partial-trace operator measure recovers the Liouville superoperator.

Load-bearing premise

All non-unitary dynamics must be capturable by a single positive-semidefinite Kossakowski matrix written in one fixed operator basis that can be uniquely split into a magnetic Laplacian plus a diagonal potential; if a physically natural set of jump operators cannot be written this way without changing basis, the claimed uniqueness of the two graphs fails.

What would settle it

Construct a Markovian generator whose Kossakowski matrix cannot be uniquely decomposed as magnetic Laplacian plus diagonal potential in any fixed orthonormal basis, or show that the pruned graph spectra diverge from the true Liouville spectrum under a concrete Chamfer-distance test for the open Rabi model.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Distinct dissipation channels (cavity loss, qubit relaxation, dephasing) produce visibly different graph motifs and Liouville spectra that can be read off without solving the master equation.
  • The weak-to-ultrastrong-coupling transition appears as a measurable rise in Fiedler value and the emergence of hub vertices, giving a purely graph-theoretic order parameter.
  • Edge pruning that preserves the positive-semidefinite structure yields a sparse backbone that still reproduces the essential spectrum, enabling cheaper simulation and learning.
  • Graph convolutional networks trained on the pruned operator graphs predict Liouville spectra of random open Rabi models more accurately and with fewer training epochs than the pristine fully-connected graphs.
  • The same construction immediately supplies a forward map from any prescribed graph family (Erdős–Rényi, scale-free, small-world) onto a corresponding family of Markovian generators whose spectral statistics can be catalogued.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The inverse problem—recovering the underlying open system from measured spectra by optimizing graph topology—becomes a well-posed graph-design task once the forward map is unique.
  • Because the two graphs separate unitary and non-unitary contributions cleanly, one can systematically search for graph motifs that protect coherence or accelerate thermalization without enumerating jump operators.
  • The same operator-measure construction should extend, with only technical changes, to time-dependent or Floquet Lindbladians by allowing the graphs themselves to become time-periodic.
  • If the pruning backbone is stable under small Hamiltonian perturbations, it may serve as a practical reduced-order model for open quantum control and readout design.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The manuscript introduces Schrödinger operator graphs: two magnetic graphs GH and GL (with vertex potentials) that encode any N-dimensional Markovian Lindblad generator once a state basis and an orthonormal traceless operator basis are fixed. The Liouvillian is recovered exactly as a linear combination of two operator measures MH(GH) and ML(GL) built from operator-valued edge signals (Eqs. 1–7). The construction is applied to the open quantum Rabi model, recovering an open-system generalization of Fock-state lattices, distinguishing relaxation versus dephasing by edge phases and hub structure, and tracking the weak-to-ultrastrong-coupling transition via the Fiedler value and degree distributions. Edge pruning that preserves the PSD Kossakowski structure is shown to outperform direct matrix sparsification (Chamfer distance), and the pruned graphs improve GCN regression of Liouville spectra of random open QRMs.

Significance. If the algebraic identity holds—as the uniqueness argument in Methods and the explicit edge operators (4)–(6) indicate—the paper supplies a clean, basis-dependent but parameter-free dictionary between Markovian open dynamics and magnetic graphs. That dictionary makes graph-theoretic diagnostics (Fiedler value, hubs, pruning) and graph neural networks immediately applicable to high-dimensional Liouvillians, with concrete illustrations on the open Rabi model and publicly deposited code (Zenodo 10.5281/zenodo.19777226). The pruning-plus-GCN results are a useful empirical demonstration that the “backbone” of the Kossakowski graph carries most spectral information. The work therefore offers a practical bridge between open quantum systems and modern graph learning, even if the mapping itself is an exact rewriting rather than a new dynamical principle.

major comments (2)
  1. Abstract and opening claim of “two uniquely defined graphs”: uniqueness holds only after the state basis {|p⟩} and the SU(N) generator basis {Sp} are fixed (Methods, “Graph uniqueness”; also stated later in “Graph mapping”). The abstract and the first paragraph of the Introduction present uniqueness without this caveat. Because the central equivalence is an identity once those bases are chosen, the claim is not false, but the unqualified wording invites over-reading. A single clarifying clause in the abstract and Introduction would remove the ambiguity without changing any result.
  2. Section “Lindbladian dynamics” / first standard form: the framework deliberately expands every set of physical jump operators into a dense Kossakowski matrix K in a fixed orthonormal basis so that all non-unitary structure sits in GL. For systems whose natural description uses only a few jump operators (e.g., cavity a and qubit σ−), the resulting GL is typically far denser than the original Lindblad form. The open-QRM examples already work in a dressed multi-operator basis, so the illustrations remain valid, but the paper should state more explicitly when the graph view is expected to be more insightful than the sparse jump-operator picture and when it is mainly a change of representation. This does not invalidate the identity, but it bounds the interpretive claim that the construction “reveals the underlying connectivity structure” of system–bath coupling.
minor comments (6)
  1. Eqs. (4) and (6): the edge operators Op,qH and Op,qL are written with a mix of tensor-product and dagger notation that is correct but dense; a short expanded example for N=2 would help readers verify the recovery of LH and LL.
  2. Figure 2 and 3 captions: “only edges with |Apq| > max/1000 are shown” is necessary for readability, but the main text should note that the full graphs remain fully connected and that the displayed sparsity is visual only (except after explicit pruning).
  3. Methods, Chamfer distance: the normalization by σRe and σIm of the original spectrum is sensible; stating that the same σ’s are used for all pruned spectra (so distances remain comparable) would remove a possible ambiguity.
  4. Supplementary Note S3: the GCN uses separate networks per χ and Hungarian matching for the unordered spectrum; both choices are appropriate and should be mentioned briefly in the main-text GCN paragraph so that the comparison in Fig. 5 is self-contained.
  5. Discussion: the inverse-design and random-graph-family suggestions are interesting; a sentence on the computational scaling of building GL (O(N^4) entries for the Kossakowski matrix) would help readers judge practicality for larger N.
  6. Typographical: “gr aph-based” (p. 4), “c avity” (p. 10), and a few missing spaces around em-dashes appear in the compiled text; a final proofread will catch them.

Circularity Check

0 steps flagged

No significant circularity: the central mapping is an explicit algebraic identity by construction of the graphs and edge operators, with no fitted parameters or load-bearing self-citations.

full rationale

The derivation chain begins from the first-standard-form Lindblad equation (Eq. 2) and its vectorized Liouvillian L = L_H + L_L (Eq. 3). For any Hermitian H (resp. Kossakowski matrix K) the Methods section “Graph uniqueness” constructs a unique magnetic graph G_H (resp. G_L) together with a unique diagonal vertex potential by the elementary decomposition Q = Δ(G) + Φ(G), where the off-diagonal entries of Q fix A(G) and the diagonal entries fix Φ(G). Edge operators are then defined by the explicit formulae (4) and (6) so that the operator measures M_H(G_H) and M_L(G_L) recover L_H and L_L exactly (Eqs. 5 and 7). Consequently the claimed identity d|ρ〉/dt = [N M_H(G_H) + (N^{2}–1) M_L(G_L)] |ρ〉 holds by direct substitution once the bases are fixed; it is not a prediction obtained from independent data or from a prior theorem of the same authors. Subsequent numerical illustrations (open Rabi graphs, Fiedler-value scaling, edge pruning, GCN regression) are consistent consequences of the same identity and do not feed free parameters back into the mapping. No self-citation is load-bearing for the uniqueness claim, and no ansatz is smuggled in. The construction is therefore self-contained and non-circular.

Axiom & Free-Parameter Ledger

3 free parameters · 3 axioms · 2 invented entities

The framework rests on standard Lindblad theory plus the definition of magnetic graphs; the only new objects are the Schrödinger operator graph and the operator measure. Free parameters appear only in the numerical examples (truncation, rates, pruning threshold) and do not affect the central identity.

free parameters (3)
  • pruning threshold χ
    Hand-chosen cutoff that zeros edges weaker than χ times the strongest edge; performance curves are reported versus χ but the optimal value is empirical.
  • Fock truncation N_max
    Hilbert-space cutoff (10 or 25) used for all numerical spectra and GCN training; results depend on it in the USC regime.
  • dissipation rates (κ,γ,γφ)
    Sampled log-uniformly for GCN training or fixed at 10^{-5} for illustrative graphs; not derived from first principles.
axioms (3)
  • domain assumption Markovian dynamics are completely described by the first standard form of the Lindblad equation with a fixed orthonormal traceless operator basis {S_p}.
    Stated in the paragraph after Eq. (2); required for uniqueness of G_L.
  • standard math Any Hermitian matrix Q admits a unique decomposition Q = Δ(G) + Φ(G) into magnetic Laplacian plus diagonal potential.
    Proved in Methods “Graph uniqueness”; used for both H and K.
  • domain assumption The magnetic Laplacian is the correct graph operator whose spectrum controls connectivity via the generalized Cheeger inequality.
    Invoked for the Fiedler-value analysis of the USC transition (Fig. 3d).
invented entities (2)
  • Schrödinger operator graph no independent evidence
    purpose: Carries operator-valued edge signals whose averaged wave features recover the Liouvillian.
    Defined in the section “Schrödinger operator graphs”; the central new object of the paper.
  • operator measure M(G) no independent evidence
    purpose: Partial-trace average that converts graph Hamiltonian action on edge operators into the superoperator L.
    Eq. (1); the mathematical device that makes the mapping exact.

pith-pipeline@v1.1.0-grok45 · 19854 in / 2415 out tokens · 42804 ms · 2026-07-11T14:35:57.119704+00:00 · methodology

0 comments
read the original abstract

Graph-theoretic frameworks have been widely employed in quantum physics to address the high-dimensional complexity of quantum systems. Although open quantum dynamics incorporates system-bath coupling via numerous interacting operators, it has been formulated algebraically with a partial set of jump operators or statistically universal reservoirs, leaving the underlying connectivity structure largely unexplored. Here, we propose a universal graph-theoretic framework for Markovian quantum dynamics. The framework maps open quantum dynamics onto two uniquely defined graphs, where the quantum master equation is rigorously interpreted as the average wave characteristic of operator-valued signals across the graphs. Applying this framework to the open quantum Rabi model, we demonstrate an open-system generalization of Fock-state lattices, characterize graph-topological signatures of dissipation, and classify the weak-to-ultrastrong coupling transition. Building on these representations, graph pruning reveals the backbone of open quantum dynamics, which enables superior graph neural-network learning. Our results bridge graph theory and open quantum dynamics, achieving efficient data-driven analysis of high-dimensional complexity.

Figures

Figures reproduced from arXiv: 2607.04721 by Dayeong Lee, Kyuho Kim, Namkyoo Park, Seungkyun Park, Sunkyu Yu, Xianji Piao.

Figure 1
Figure 1. Figure 1: Schrödinger operator graphs. a, Magnetic graph G = (V, E) with NG vertices, where weighted edges depicted by their thicknesses represent A(G). Grey and orange arrows denote vanishing and nonvanishing gauges, respectively. b, Operator-valued signals across the graph, where each edge (p,q) carries an edge operator Op,q. Grey and orange arrows indicate Hermitian and non-Hermitian signals, respectively. While … view at source ↗
Figure 1
Figure 1. Figure 1: Schrödinger operator graphs. a, Magnetic graph G = (V, E) with NG vertices, where weighted edges depicted by their thicknesses represent A(G). Grey and orange arrows denote vanishing and nonvanishing gauges, respectively. b, Operator-valued signals across the graph, where each edge (p,q) carries an edge operator Op,q. Grey and orange arrows indicate Hermitian and non-Hermitian signals, respectively. While … view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

44 extracted references · 1 canonical work pages

  1. [1]

    & Moreno, Y

    Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V . & Moreno, Y . The physics of higher-order interactions in complex systems. Nat. Phys. 17, 1093-1098 (2021)

    2021

  2. [2]

    P., Sun, H., Giambagli, L., Muolo, R., Carletti, T., Torres, J

    Millán, A. P., Sun, H., Giambagli, L., Muolo, R., Carletti, T., Torres, J. J., Radicchi, F., Kurths, J. & Bianconi, G. Topology shapes dynamics of higher -order networks. Nature Physics 21, 353-361 (2025)

    2025

  3. [3]

    & Jimenez Rezende, D

    Battaglia, P., Pascanu, R., Lai, M. & Jimenez Rezende, D. Interaction networks for learning about objects, relations and physics. Adv. Neural Inf. Process. Syst. 29 (2016)

    2016

  4. [4]

    & Zhang, L

    Wang, Q. & Zhang, L. Inverse design of glass structure with deep graph neural networks. Nat. Commun. 12, 5359 (2021)

    2021

  5. [5]

    D., Schoenholz, S

    Bapst, V ., Keck, T., Grabska-Barwińska, A., Donner, C., Cubuk, E. D., Schoenholz, S. S., Obika, A., Nelson, A. W., Back, T. & Hassabis, D. Unveiling the predictive power of static structure in glassy systems. Nat. Phys. 16, 448-454 (2020)

    2020

  6. [6]

    & Anandkumar, A

    Li, Z., Kovachki, N., Azizzadenesheli, K., Liu, B., Bhattacharya, K., Stuart, A. & Anandkumar, A. Neural operator: Graph kernel network for partial differential equations. arXiv preprint arXiv:2003.03485 (2020)

    Pith/arXiv arXiv 2003

  7. [7]

    & Larson, J

    Saugmann, P. & Larson, J. Fock-state-lattice approach to quantum optics. Phys. Rev. A 108, 033721 (2023). 25

    2023

  8. [8]

    & Chen, Y

    Zhang, J., Huang, W., Chu, J., Qiu, J., Sun, X., Tao, Z., Zhang, J., Zhang, L., Zhou, Y . & Chen, Y . Synthetic multidimensional Aharonov-Bohm cages in Fock state lattices. Phys. Rev. Lett. 134, 070601 (2025)

    2025

  9. [9]

    & Kim, T

    Lee, K., Yu, S., Kang, J., Yu, S., Choi, W., Chung, D., Park, S. & Kim, T. Phase -space topology in a single-atom synthetic dimension. Phys. Rev. A 113, L010401 (2026)

    2026

  10. [10]

    & Smilansky, U

    Kottos, T. & Smilansky, U. Chaotic scattering on graphs. Phys. Rev. Lett. 85, 968 (2000)

    2000

  11. [11]

    Tensor networks for complex quantum systems

    Orús, R. Tensor networks for complex quantum systems. Nat. Rev. Phys. 1, 538-550 (2019)

    2019

  12. [12]

    A short introduction to the Lindblad master equation

    Manzano, D. A short introduction to the Lindblad master equation. AIP Adv. 10, 025106 (2020)

    2020

  13. [13]

    & Petruccione, F

    Breuer, H.-P. & Petruccione, F. The theory of open quantum systems (Oxford University Press, 2002)

    2002

  14. [14]

    Plenio, M. B. & Knight, P. L. The quantum -jump approach to dissipative dynamics in quantum optics. Rev. Mod. Phys. 70, 101 (1998)

    1998

  15. [16]

    & Gopalakrishnan, S

    Can, T., Oganesyan, V ., Orgad, D. & Gopalakrishnan, S. Spectral gaps and midgap states in random quantum master equations. Phys. Rev. Lett. 123, 234103 (2019)

    2019

  16. [17]

    Random lindblad dynamics

    Can, T. Random lindblad dynamics. Journal of Physics A: Mathematical and Theoretical 52, 485302 (2019)

    2019

  17. [18]

    & Luitz, D

    Wang, K., Piazza, F. & Luitz, D. J. Hierarchy of relaxation timescales in local random Liouvillians. Phys. Rev. Lett. 124, 100604 (2020)

    2020

  18. [19]

    & Presilla, C

    Popkov, V . & Presilla, C. Full spectrum of the liouvillian of open dissipative quantum systems in the zeno limit. Phys. Rev. Lett. 126, 190402 (2021). 26

    2021

  19. [20]

    & del Campo, A

    Yang, Y ., Xu, Z. & del Campo, A. Decoherence rate in random Lindblad dynamics. Physical Review Research 6, 023229 (2024)

    2024

  20. [21]

    & Gopalakrishnan, S

    Orgad, D., Oganesyan, V . & Gopalakrishnan, S. Dynamical transitions from slow to fast relaxation in random open quantum systems. Phys. Rev. Lett. 132, 040403 (2024)

    2024

  21. [22]

    & Dobrovitski, V

    Mehmandoost, M. & Dobrovitski, V . Decoherence induced by a sparse bath of two- level fluctuators: Peculiar features of 1/f noise in high-quality qubits. Phys. Rev. Res. 6, 033175 (2024)

    2024

  22. [23]

    & Park, N

    Yu, S., Piao, X. & Park, N. Heavy- tailed open quantum systems reveal long- lived and ultrasensitive coherence. arXiv preprint arXiv:2506.22717 (2025)

    Pith/arXiv arXiv 2025

  23. [24]

    & Post, O

    Lange, C., Liu, S., Peyerimhoff, N. & Post, O. Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians. Calc. Var. Partial Differential Equations 54, 4165-4196, doi:10.1007/s00526-015-0935-x (2015)

    doi:10.1007/s00526-015-0935-x 2015

  24. [25]

    Shubin, M. A. Discrete magnetic Laplacian. Commun. Math. Phys. 164, 259- 275, doi:10.1007/BF02101702 (1994)

    doi:10.1007/bf02101702 1994

  25. [26]

    & Hirn, M

    Zhang, X., He, Y ., Brugnone, N., Perlmutter, M. & Hirn, M. Magnet: A neural network for directed graphs. Adv. Neural Inf. Process. Syst. 34, 27003-27015 (2021)

    2021

  26. [27]

    & Chan, C

    Yang, Y ., Yang, B., Ma, G., Li, J., Zhang, S. & Chan, C. Non-Abelian physics in light and sound. Science 383, eadf9621 (2024)

    2024

  27. [28]

    Kim, G., Li, J., Piao, X., Park, N. & Yu, S. Programmable lattices for non- Abelian topological photonics and braiding. Phys. Rev. Lett. 136, 043804, doi:10.1103/rgfy-n6zd (2026)

    work page doi:10.1103/rgfy-n6zd 2026

  28. [29]

    Singer, A. & Wu, H. T. Vector diffusion maps and the connection Laplacian. Communications on pure and applied mathematics 65, 1067-1144 (2012). 27

    2012

  29. [30]

    Hioe, F. T. & Eberly, J. H. N -level coherence vector and higher conservation laws in quantum optics and quantum mechanics. Phys. Rev. Lett. 47, 838 (1981)

    1981

  30. [31]

    Gyamfi, J. A. Fundamentals of quantum mechanics in Liouville space. European Journal of Physics 41, 063002 (2020)

    2020

  31. [32]

    & Nori, F

    Di Stefano, O., Settineri, A., Macrì, V ., Garziano, L., Stassi, R., Savasta, S. & Nori, F. Resolution of gauge ambiguities in ultrastrong-coupling cavity quantum electrodynamics. Nat. Phys. 15, 803-808 (2019)

    2019

  32. [33]

    & Nori, F

    Frisk Kockum, A., Miranowicz, A., De Liberato, S., Savasta, S. & Nori, F. Ultrastrong coupling between light and matter. Nat. Rev. Phys. 1, 19-40 (2019)

    2019

  33. [34]

    & Solano, E

    Forn-Díaz, P., Lamata, L., Rico, E., Kono, J. & Solano, E. Ultrastrong coupling regimes of light-matter interaction. Rev. Mod. Phys. 91, 025005 (2019)

    2019

  34. [35]

    & Rubio, A

    Schäfer, C., Ruggenthaler, M., Rokaj, V . & Rubio, A. Relevance of the quadratic diamagnetic and self-polarization terms in cavity quantum electrodynamics. ACS Photon. 7, 975-990 (2020)

    2020

  35. [36]

    & Solano, E

    Niemczyk, T., Deppe, F., Huebl, H., Menzel, E., Hocke, F., Schwarz, M., Garcia-Ripoll, J., Zueco, D., Hümmer, T. & Solano, E. Circuit quantum electrodynamics in the ultrastrong- coupling regime. Nat. Phys. 6, 772-776 (2010)

    2010

  36. [37]

    Beaudoin, F., Gambetta, J. M. & Blais, A. Dissipation and ultrastrong coupling in circuit QED. Phys. Rev. A 84, 043832 (2011)

    2011

  37. [38]

    Kipf, T. N. & Welling, M. Semi -supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)

    Pith/arXiv arXiv 2016

  38. [39]

    & Zhang, X

    Luo, D., Cheng, W., Yu, W., Zong, B., Ni, J., Chen, H. & Zhang, X. Learning to drop: Robust graph neural network via topological denoising. In Proceedings of the 14th ACM 28 international conference on web search and data mining 779-787 (2021)

    2021

  39. [40]

    Network science (Cambridge University Press, 2016)

    Barabási, A.-L. Network science (Cambridge University Press, 2016)

    2016

  40. [41]

    A., Boltasseva, A., Cai, W

    Ma, W., Liu, Z., Kudyshev, Z. A., Boltasseva, A., Cai, W. & Liu, Y . Deep learning for the design of photonic structures. Nat. Photon. 15, 77-90 (2021)

    2021

  41. [42]

    & Blais, A

    Gautier, R., Genois, É. & Blais, A. Optimal control in large open quantum systems: the case of transmon readout and reset. Phys. Rev. Lett. 134, 070802 (2025)

    2025

  42. [43]

    & Park, N

    Yu, S., Piao, X. & Park, N. Multi -objective design of photon blockade for bright single - photon sources. arXiv preprint arXiv:2606.20160 (2026)

    Pith/arXiv arXiv 2026

  43. [44]

    Mapping open quantum dynamics onto graphs

    Mikaberidze, G., Mikaberidze, B. & Taylor, D. GradNet: A Gradient-Based Framework for Optimal Network Science. arXiv preprint arXiv:2603.09197 (2026). 1 Supplementary Information for “Mapping open quantum dynamics onto graphs” Kyuho Kim1, Dayeong Lee1, Seungkyun Park1,2,4, Xianji Piao3§, Namkyoo Park2†, and Sunkyu Yu1* 1Intelligent Wave Systems Laboratory...

    Pith/arXiv arXiv 2026

  44. [45]

    & Życzkowski, K

    Denisov, S., Laptyeva, T., Tarnowski, W., Chruściński, D. & Życzkowski, K. Universal spectra of random Lindblad operators. Phys. Rev. Lett. 123, 140403 (2019)

    2019