Searcharxiv⌕ Search

arXiv subjects

Xianquan Yan

Publications and source records attributed to Xianquan Yan.

10 recordsLinked to original sources

Relaxation Critical Dynamics of Strong-to-Weak Spontaneous Symmetry Breaking

Strong-to-weak spontaneous symmetry breaking (SW-SSB) is unique to mixed states: strong symmetry is broken while weak symmetry is preserved, requiring two order parameters. We study the critical relaxation of both order parameters in a monitored $\mathbb{Z}_2$ circuit, which maps exactly onto two nested bond-percolation problems. The initial state acts as a temporal boundary condition for each problem, wired if the state is ordered in the corresponding order parameter and free otherwise. An SW-SSB initial state wires only the strong-symmetry order parameter, a configuration that no pure state realizes. Each autocorrelation exponent is the sum of an initial scaling dimension, set by the initial state, and an observation dimension, set by the observation time, whereas the equal-time correlator gives only the observation dimension. For the SW-SSB state, the initial dimension is $1/3$ for the weak-symmetry order parameter and $0$ for the strong-symmetry one, each at its own critical point. These initial dimensions also set how fast a stored bit is lost. The probability of decoding the initial value of a single qubit from the system alone decays as a power law, whereas system and environment together retain it. Stabilizer simulations confirm the theoretical prediction, and we propose an experimental protocol that measures these exponents without postselection. Our results reveal a form of boundary criticality inaccessible to pure states.

quant-ph↗

Restoring quantum neural network trainability through reusable calibration

Quantum neural networks (QNNs) rely on measured quantum observables to guide optimization, but hardware noise can suppress the parameter-dependent signals essential for learning. Here, we develop a structure-preserving error-mitigation framework that improves QNN trainability through reusable calibration of the quantum circuit's effective noise response. By calibrating a reference circuit with the same gate architecture as the trainable circuit, we construct regularized estimators of local quantum features that remain fixed throughout training. We quantify how calibration errors and response mismatches affect the recovery of both observables and their derivatives. Numerical simulations demonstrate enhanced loss-landscape contrast, faster convergence, and improved classification performance, and an IBM Quantum experiment confirms improved closed-loop variational optimization under hardware noise. We further demonstrate calibration reuse in a modular QNN comprising 25 independent four-qubit channels, corresponding to 100 qubits in aggregate. Our results establish reusable feature calibration as a practical approach to improving noise-limited quantum machine learning without repeated calibration at every training step.

quant-ph↗

Close and Sort: Exact Maximum-Likelihood Aggregation of Cyclic Rank-Two Preferences

Pairwise probabilities arise in rank aggregation, recommendation, and human or LLM evaluation, yet converting them into a maximum-likelihood list is a weighted Kemeny problem and is NP-hard in general. Known exact algorithms for rank-two tournaments use only comparison signs and do not optimize this likelihood. We show that the weighted problem is exactly solvable when the skew-symmetric log-odds matrix $W_{ij}=\log(p_{ij}/p_{ji})$ has rank two, including when the induced preferences contain cycles. Writing $W_{ij}=\det(h_i,h_j)$ and adding the closing vector $h_0=-\sum_i h_i$ turns the objective into twice the signed area of a closed polygon. This geometry yields CloseSort, which polar-sorts the $n+1$ edge vectors, cuts after $h_0$, and returns a global maximum-likelihood order in $O(n\log n)$ time from the factors. The same geometry identifies the runner-up and gives a stability certificate beyond exact rank two. When the smallest determinant $δ$ of two consecutive edges in the closed angular cycle is positive, it is exactly the best-to-runner-up log-likelihood gap. For $W=W_0+E$, the CloseSort order of $W_0$ has regret at most $\sum_{i<j}|E_{ij}|$ on $W$ and remains optimal whenever this sum is below $δ$, a worst-case tight threshold. In 5,120 determinant-logit simulations, increasing the observations per pair from 4 to 64 raises the fraction on which rank-two projection outperforms the empirical plug-in optimum from 68.6% to 85.7%. On 3,600 Arena-Hard LLM-judge profiles drawn from 63 systems and ten judges, the leading rank-two component captures 89.2% of the log-odds energy. On profiles containing a directed majority triangle, CloseSort reduces normalized regret by 44% relative to Borda and improves the mean normalized objective over each of eight baselines. With factors supplied, it is 8,407 times faster than exact dynamic programming on 18-item rankings.

cs.DS↗

When Greedy Is Sorting: Exact and Certified Ideal Rankings for Novelty Metrics

The ideal ranking that normalizes novelty metrics is NP-hard to compute in general, so widely used $α$-nDCG evaluators approximate its denominator with a greedy rule that rescans every remaining document at each rank. We identify a regime in which this ideal ranking is exact and cheap for both $α$-DCG and intent-aware expected reciprocal rank (ERR-IA). When each document is positively judged for at most one intent, each metric reduces to the classical allocation of a fixed budget across chains of decreasing marginal gains. A metric-specific virtual-score transformation followed by a multiway merge, which we call ChainMerge, returns the globally optimal top-$K$ ranking in $O(G+K\log G)$ time from $G$ preordered intent groups, or in $O(n+K\log G)$ time from $n$ globally preordered candidates, instead of the $Θ(nK)$ of the greedy rule. When intent judgments overlap, exact $α$-DCG optimization is NP-hard under the standard logarithmic discount and $α=0.5$, even when every document has three intents and every intent occurs in two documents. For arbitrary overlap, a polynomial-size LP over nested ranking prefixes upper-bounds the ideal score and certifies the optimality gap of any feasible ranking. In the official TREC Web 2009-2012 judgments, 64.8% of positive documents serve a single intent, yet only 20 of 198 complete queries do so throughout. Beyond this exact regime, the LP certifies 189 of the 198 greedy denominators as globally optimal, and the resulting score intervals preserve the winner in all eight matched comparison groups. On 65,238 MIND-small candidates, ChainMerge returns identical optimal objectives 17-1,011 times faster than the greedy rule. For $α$-DCG, these results trace the hardness of the ideal ranking to intent overlap.

cs.IR↗

Observing the magic Mpemba effect in localized dynamics on a digital quantum computer

The Mpemba effect challenges the intuition that states closer to equilibrium must relax faster. We ask whether an analogous magic-ordering reversal can occur in the generation of quantum magic (nonstabilizerness), a key resource for universal quantum computation: can a state with less initial magic overtake one with more and reach its asymptotic value sooner? Here, we uncover interaction-induced dephasing as a distinct mechanism for this magic Mpemba effect, requiring neither transport nor conventional thermalization. For tilted product states in an interacting $\ell$-bit model, a random-phase analysis predicts a reversal of the magic ordering: states with less initial magic attain higher saturated magic, independent of their spatial pattern. Exact simulations of the $\ell$-bit model and localized spin chains further show that these states also saturate earlier. We observe both features on IBM superconducting quantum processors. An effective $\ell$-bit implementation accesses long dephasing times at fixed circuit depth by encoding time in gate angles, while a microscopic spin model exhibits the reversal universally across initial patterns in the localized regime but only selectively in the ergodic regime. These results establish interaction-induced dephasing as a route to anomalous quantum-resource relaxation beyond transport-driven thermalizing dynamics.

quant-ph↗

KnottedGraph: Scalable knotted-graph topology for scientific and mathematical discovery

Scientific data span heterogeneous structures, including coordinates, networks, surfaces, volumes and fields, yet their topology can be quantified within a common framework through graph connectivity, cycle structure, genus and spatial embedding. Graph- and homology-based summaries do not determine spatial embedding, while standard knot and link polynomials require extensions to accommodate branching graphs. Here, we introduce KnottedGraph, a computational framework that converts such scientific representations to knotted graphs that retain graph connectivity and spatial embedding together. It constructs projected diagrams and PD codes, enabling various topological analyses, including Yamada-polynomial evaluation for topological classification. For scalable exact evaluation, it combines partial resolutions that leave the same unresolved connections and optimizes their processing order; the resulting algorithm is verified against published topological invariants of knotted graphs with up to 500 crossings. This scalability enables us to introduce an LLM-assisted mathematical-discovery methodology, in which computational topological data generated across knotted-graph families are used to identify candidate closed-form formulas. With this approach, we identify analytical Yamada-polynomials for generic graph motif families exhibiting Abelian and non-Abelian word sequences. Together, these scalable capabilities make knotted-graph topology computationally accessible across scientific domains, enabling large-scale classification and introducing a route from topological data to LLM-assisted AI4Math discovery.

cs.MS↗

Topological classification through knotted graphs: Fermi surface dispersions and Lifshitz transitions

Knot theory has provided a rich topological taxonomy for band structures, but its reach is fundamentally limited: knot invariants classify only 1D nodal lines at gap closure, and cannot encode the full dispersion or rich Fermi surface structure of realistic materials. Here we show that knotted graphs (knots that admit graph-like intersections in 3D space) - which have so far been elusive in condensed matter literature - provide a unified topological language for classifying the entire band dispersion, and even the eigenstate topology in some contexts. We propose a new framework beyond the existing Yamada polynomials that can topologically characterize the intricacies of realistic Fermi surfaces completely, crucially including how their multiple disconnected pieces are nested. This yields the Yamada set, a boundary-resolved extension which organizes the full topological evolution across energy into a Yamada sequence: a compact dispersion-level fingerprint directly tied to experimental signatures of Lifshitz transitions. Our framework is demonstrated with DFT-based band structures of real materials. Beyond dispersion-level classifications, this framework can be extended to non-Hermitian exceptional surfaces, where Berry-curvature flux further equips the knotted-graph skeleton with a directed Abelian edge flow that also captures the eigenstate topology.

cond-mat.mes-hall↗

Practical Error Suppression and Mitigation for Reliable Quantum Computing

Quantum computing is entering a transitional regime between noisy intermediate-scale quantum (NISQ) processing and early fault-tolerant quantum computation (FTQC), in which increasingly capable hardware is beginning to support repeated syndrome measurements, partial error correction, and logical-qubit operations, while residual physical and logical errors remain non-negligible. In this regime, error suppression, error mitigation, and quantum error correction are increasingly better viewed as complementary layers of a unified error-reduction strategy rather than as separate approaches, with each acting at a different stage of the quantum computation to improve simulation reliability. Thus, in this review, we provide a practical and forward-looking overview of the principal hardware error sources and the corresponding error suppression and mitigation methods for reducing their impact across the current NISQ-FTQC transition. We discuss hardware-aware circuit design, coherent-error suppression, readout mitigation, noise extrapolation, classical inference, and software-supported workflows, with particular emphasis on their implementation on actual quantum processors. We further examine how error mitigation techniques can be adapted to encoded and logical-qubit settings so that they can operate alongside quantum error correction to suppress residual logical errors and improve the accuracy of computation in the early fault-tolerant regime.

quant-ph↗

HSG-12M: A Large-Scale Benchmark of Spatial Multigraphs from the Energy Spectra of Non-Hermitian Crystals

AI is transforming scientific research by revealing new ways to understand complex physical systems, but its impact remains constrained by the lack of large, high-quality domain-specific datasets. A rich, largely untapped resource lies in non-Hermitian quantum physics, where the energy spectra of crystals form intricate geometries on the complex plane -- termed as Hamiltonian spectral graphs. Despite their significance as fingerprints for electronic behavior, their systematic study has been intractable due to the reliance on manual extraction. To unlock this potential, we introduce Poly2Graph: a high-performance, open-source pipeline that automates the mapping of 1-D crystal Hamiltonians to spectral graphs. Using this tool, we present HSG-12M: a dataset containing 11.6 million static and 5.1 million dynamic Hamiltonian spectral graphs across 1401 characteristic-polynomial classes, distilled from 177 TB of spectral potential data. Crucially, HSG-12M is the first large-scale dataset of spatial multigraphs -- graphs embedded in a metric space where multiple geometrically distinct trajectories between two nodes are retained as separate edges. This simultaneously addresses a critical gap, as existing graph benchmarks overwhelmingly assume simple, non-spatial edges, discarding vital geometric information. Benchmarks with popular GNNs expose new challenges in learning spatial multi-edges at scale. Beyond its practical utility, we show that spectral graphs serve as universal topological fingerprints of polynomials, vectors, and matrices, forging a new algebra-to-graph link. HSG-12M lays the groundwork for data-driven scientific discovery in condensed matter physics, new opportunities in geometry-aware graph learning and beyond.

cs.LG↗

Deterministic scale-invariant dynamics in a logistic Game-of-Life model

Scale invariance is a hallmark of criticality in complex dynamical systems. While random external inputs or tunable stochastic interactions are typically required to produce critical behavior, it remains unclear whether scale-invariant dynamics can emerge from purely deterministic interactions. Here, we address this question by studying the asymptotic dynamics of the logistic Game of Life (GOL), a deterministic-parameter extension of Conway's GOL. In this system, we identify three distinct asymptotic phases separated by two fundamentally different critical points. The first critical point, associated with an unusual form of self-organized criticality, separates a sparse-static phase from a sparse-dynamic phase. The second critical point corresponds to a deterministic percolation transition between the sparse-dynamic phase and a third, dense-dynamic phase. In addition, we observe power-law cluster size distributions with unconventional critical exponents not found in standard equilibrium systems. Overall, our work paves the way for studying emergent scale invariance in purely deterministic systems.

cond-mat.stat-mech↗