Source author record

Ruicheng Bao

Ruicheng Bao appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

3works
7topics
3close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Hierarchical Reconstruction of Time-arrow from Multi-time Correlations

The entropy production rate (EPR), a key measure of thermodynamic irreversibility in stochastic thermodynamics, is difficult to determine directly in experiments, motivating lower-bound-based estimation from observations. However, a systematic framework for organizing increasing amounts of the irreversibility information in experimental state observables into progressively tighter bounds remains lacking. Here, we show that multi-time correlations of a class of state observations naturally encode this information to provide a hierarchy. By defining a reconstruction operation as a combination of correlations, we obtain a sequence of lower bounds on the EPR. Correlations of higher order capture the thermodynamic information at greater temporal depth, thereby capturing more irreversibility and yielding tighter bounds. Under ideal conditions, this hierarchy converges to the full EPR in the limit of infinitely dense observations over a finite time window.

preprint2026arXiv

Initial-State Typicality in Quantum Relaxation

Relaxation in open quantum systems is fundamental to quantum science and technologies. Yet, the influence of the initial state on relaxation remains a central, largely unanswered question. Here, by systematically characterizing the relaxation behavior of generic initial states, we uncover a typicality phenomenon in high-dimensional open quantum systems: relaxation becomes nearly initial-state-independent as system size increases under verifiable conditions. Crucially, we prove this typicality for thermalization processes above a size-independent temperature. Our findings extend the typicality to open quantum dynamics, in turn identifying a class of systems where two widely used quantities -- the Liouvillian gap and the maximal relaxation time -- merit re-examination. We formalize this with two new concepts: the 'typical strong Mpemba effect' and the 'typical relaxation time'. Beyond these conceptual advances, our results provide practical implications: a scalable route to accelerating relaxation and a typical mixing-time benchmark that complements conventional worst-case metrics for quantum simulations and state preparation.

preprint2026arXiv

Physically natural metric-measure Lindbladian ensembles and their learning hardness

In open quantum systems, a basic question at the interface of quantum information, statistical physics, and many-body dynamics is how well can one infer the structure of noise and dissipation generators from finite-time measurement statistics alone. Motivated by this question, we study the learnability and cryptographic applications of random open-system dynamics generated by Lindblad-Gorini-Kossakowski-Sudarshan (GKSL) master equations. Working in the affine hull of the GKSL cone, we introduce physically motivated ensembles of random local Lindbladians via a linear parametrisation around a reference generator. On top of this geometric structure, we extend statistical query (SQ) and quantum-process statistical query (QPStat) frameworks to the open-system setting and prove exponential (in the parameter dimension $M$) lower bounds on the number of queries required to learn random Lindbladian dynamics. In particular, we establish average-case SQ-hardness for learning output distributions in total variation distance and average-case QPStat-hardness for learning Lindbladian channels in diamond norm. To support these results physically, we derive a linear-response expression for the ensemble-averaged total variation distance and verify the required nonvanishing scaling in a random local amplitude-damping chain. Finally, we design two Lindbladian physically unclonable function (Lindbladian-PUF) protocols based on random Lindbladian ensembles with distribution-level and tomography-based verification, thereby providing open-system examples where learning hardness can be translated into cryptographic security guarantees.