arXiv subjects

Shengqi Sang

Publications and source records attributed to Shengqi Sang.

17 recordsLinked to original sources

arXiv2025

Circuit-based characterization of finite-temperature quantum phases and self-correcting quantum memory

Quantum phases at zero temperature can be characterized as equivalence classes under local unitary transformations: two ground states within a gapped phase can be transformed into each other via a local unitary circuit. We generalize this circuit-based characterization of phases to systems at finite-temperature thermal equilibrium described by Gibbs states. We construct a channel circuit that approximately transforms one Gibbs state into another provided the two are connected by a path in parameter space along which a certain correlation-decay condition holds. For finite-dimensional systems of linear size $L$ and approximation error $\epsilon$, the locality of the circuit is ${\rm polylog}({\rm poly}(L)/\epsilon)$. The correlation-decay condition, which we specify, is expected to be satisfied in the interior of many noncritical thermal phases, including those displaying discrete symmetry breaking and topological order. As an application, we show that any system in the same thermal phase as a zero-temperature topological code coherently preserves quantum information for a macroscopically long time, establishing self-correction as a universal property of thermal phases. As part of the proof, we provide explicit encoding and decoding channel circuits to encode information into, and decode it from, a system in thermal equilibrium.

quant-ph↗

arXiv2025

Pep2Prob Benchmark: Predicting Fragment Ion Probability for MS$^2$-based Proteomics

Proteins perform nearly all cellular functions and constitute most drug targets, making their analysis fundamental to understanding human biology in health and disease. Tandem mass spectrometry (MS$^2$) is the major analytical technique in proteomics that identifies peptides by ionizing them, fragmenting them, and using the resulting mass spectra to identify and quantify proteins in biological samples. In MS$^2$ analysis, peptide fragment ion probability prediction plays a critical role, enhancing the accuracy of peptide identification from mass spectra as a complement to the intensity information. Current approaches rely on global statistics of fragmentation, which assumes that a fragment's probability is uniform across all peptides. Nevertheless, this assumption is oversimplified from a biochemical principle point of view and limits accurate prediction. To address this gap, we present Pep2Prob, the first comprehensive dataset and benchmark designed for peptide-specific fragment ion probability prediction. The proposed dataset contains fragment ion probability statistics for 608,780 unique precursors (each precursor is a pair of peptide sequence and charge state), summarized from more than 183 million high-quality, high-resolution, HCD MS$^2$ spectra with validated peptide assignments and fragmentation annotations. We establish baseline performance using simple statistical rules and learning-based methods, and find that models leveraging peptide-specific information significantly outperform previous methods using only global fragmentation statistics. Furthermore, performance across benchmark models with increasing capacities suggests that the peptide-fragmentation relationship exhibits complex nonlinearities requiring sophisticated machine learning approaches.

q-bio.BM↗

arXiv2025

Mixed-state phases from local reversibility

We propose a refined definition of mixed-state phase equivalence based on locally reversible channel circuits. We show that such circuits preserve topological degeneracy and the locality of all operators including both strong and weak symmetries. Under a locally reversible channel, weak unitary symmetries are locally dressed into channel symmetries, a new generalization of symmetry for open quantum systems. For abelian higher-form symmetries, we show the refined definition preserves anomalies and spontaneous breaking of such symmetries within a phase. As a primary example, a two-dimensional classical loop ensemble is trivial under the previously adopted definition of mixed-state phases. However, it has non-trivial topological degeneracy arising from a mutual anomaly between strong and weak 1-form symmetries, and our results show that it is not connected to a trivial state via locally reversible channel circuits.

quant-ph↗

arXiv2025

Higher-form anomaly and long-range entanglement of mixed states

In open quantum systems, we directly relate anomalies of higher-form symmetries to the long-range entanglement of any mixed state with such symmetries. First, we define equivalence classes of long-range entanglement in mixed states via stochastic local channels (SLCs), which effectively ``mod out'' any classical correlations and thus distinguish phases by differences in long-range quantum correlations only. It is then shown that strong symmetries of a mixed state and their anomalies (non-trivial braiding and self-statistics) are intrinsic features of the entire phase of matter. For that, a general procedure of symmetry pullback for strong symmetries is introduced, whereby symmetries of the output state of an SLC are dressed into symmetries of the input state, with their anomaly relation preserved. This allows us to prove that states in (2+1)-D with anomalous strong 1-form symmetries exhibit long-range bipartite entanglement, and to establish a lower bound for their topological entanglement of formation, a mixed-state generalization of topological entanglement entropy. For concreteness, we apply this formalism to the toric code under Pauli-X and Z dephasing noise, as well as under ZX decoherence, which gives rise to the recently discovered intrinsically mixed-state topological order. Finally, we conjecture a connection between higher-form anomalies and long-range multipartite entanglement for mixed states in higher dimensions.

quant-ph↗

arXiv2024

Approximate quantum error correcting codes from conformal field theory

The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic 1+1D CFT codes under extensive local dephasing channels and analyze their error correctability in the thermodynamic limit. We show that (i) there is a finite decoding threshold if and only if the minimal nonzero scaling dimension in the fusion algebra generated by the jump operator of the channel is larger than $1/2$ and (ii) the number of protected logical qubits $k \geq Ω( \log \log n)$, where $n$ is the number of physical qubits. As an application, we show that the one-dimensional quantum critical Ising model has a finite threshold for certain types of dephasing noise. Our general results also imply that a CFT code with continuous symmetry saturates a bound on the recovery fidelity for covariant codes.

quant-ph↗

arXiv2024

Information dynamics in decohered quantum memory with repeated syndrome measurements: a dual approach

Measurements can detect errors in a decohered quantum memory allowing active error correction to increase the memory time. Previous understanding of this mechanism has focused on evaluating the performance of error correction algorithms based on measurement results. In this work, we instead intrinsically characterize the information dynamics in a quantum memory under repeated measurements, using coherent information and relative entropy. We consider the dynamics of a $d$-dimensional stabilizer code subject to Pauli errors and noisy stabilizer measurements and develop a $(d+1)$-dimensional statistical mechanics model for the information-theoretic diagnostics. Our model is dual to the model previously obtained for the optimal decoding algorithm, and the potential decoding transition in the quantum memory again manifests as a thermal phase transition in the statistical mechanics model. We explicitly derive the model and study the phase transition in information encoding in three examples: surface codes, repetition codes, and the XZZX code.

quant-ph↗

arXiv2024

Stability of mixed-state quantum phases via finite Markov length

For quantum phases of Hamiltonian ground states, the energy gap plays a central role in ensuring the stability of the phase as long as the gap remains finite. We propose Markov length, the length scale at which the quantum conditional mutual information (CMI) decays exponentially, as an equally essential quantity characterizing mixed-state phases and transitions. For a state evolving under a local Lindbladian, we argue that if its Markov length remains finite along the evolution, then it remains in the same phase, meaning there exists another quasi-local Lindbladian evolution that can reverse the former one. We apply this diagnostic to toric code subject to decoherence and show that the Markov length is finite everywhere except at its decodability transition, at which it diverges. CMI in this case can be mapped to the free energy cost of point defects in the random bond Ising model. This implies that the mixed state phase transition coincides with the decodability transition and also suggests a quasi-local decoding channel.

quant-ph↗

arXiv2023

Mixed-state Quantum Phases: Renormalization and Quantum Error Correction

Open system quantum dynamics can generate a variety of long-range entangled mixed states, yet it has been unclear in what sense they constitute phases of matter. To establish that two mixed states are in the same phase, as defined by their two-way connectivity via local quantum channels, we use the renormalization group (RG) and decoders of quantum error correcting codes. We introduce a real-space RG scheme for mixed states based on local channels which ideally preserve correlations with the complementary system, and we prove this is equivalent to the reversibility of the channel's action. As an application, we demonstrate an exact RG flow of finite temperature toric code in two dimensions to infinite temperature, thus proving it is in the trivial phase. In contrast, for toric code subject to local dephasing, we establish a mixed state toric code phase using local channels obtained by truncating an RG-type decoder and the minimum weight perfect matching decoder. We also discover a precise relation between mixed state phase and decodability, by proving that local noise acting on toric code cannot destroy logical information without bringing the state out of the toric code phase.

quant-ph↗

arXiv2023

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law, and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (not too entangled) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at large bond dimension. Through this statistical-mechanics lens, we argue that: i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. These results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states

quant-ph↗

arXiv2023

Channeling quantum criticality

We analyze the effect of decoherence, modelled by local quantum channels, on quantum critical states and we find universal properties of the resulting mixed state's entanglement, both between system and environment and within the system. Renyi entropies exhibit volume law scaling with a subleading constant governed by a "$g$-function" in conformal field theory (CFT), allowing us to define a notion of renormalization group (RG) flow (or "phase transitions") between quantum channels. We also find that the entropy of a subsystem in the decohered state has a subleading logarithmic scaling with subsystem size, and we relate it to correlation functions of boundary condition changing operators in the CFT. Finally, we find that the subsystem entanglement negativity, a measure of quantum correlations within mixed states, can exhibit log scaling or area law based on the RG flow. When the channel corresponds to a marginal perturbation, the coefficient of the log scaling can change continuously with decoherence strength. We illustrate all these possibilities for the critical ground state of the transverse-field Ising model, in which we identify four RG fixed points of dephasing channels and verify the RG flow numerically. Our results are relevant to quantum critical states realized on noisy quantum simulators, in which our predicted entanglement scaling can be probed via shadow tomography methods.

quant-ph↗

arXiv2023

Entanglement Dynamics of Noisy Random Circuits

The process by which open quantum systems thermalize with an environment is both of fundamental interest and relevant to noisy quantum devices. As a minimal model of this process, we consider a qudit chain evolving under local random unitaries and local depolarization channels. After mapping to a statistical mechanics model, the depolarization (noise) acts like a symmetry-breaking field, and we argue that it causes the system to thermalize within a timescale independent of system size. We show that various bipartite entanglement measures -- mutual information, operator entanglement, and entanglement negativity -- grow at a speed proportional to the size of the bipartition boundary. As a result, these entanglement measures obey an area law: Their maximal value during the dynamics is bounded by the boundary instead of the volume. In contrast, if the depolarization only acts at the system boundary, then the maximum value of the entanglement measures obeys a volume law. We complement our analysis with scalable simulations involving Clifford gates, for both one- and two-dimensional systems.

quant-ph↗

arXiv2023

Probing sign structure using measurement-induced entanglement

The sign structure of quantum states is closely connected to quantum phases of matter, yet detecting such fine-grained properties of amplitudes is subtle. Here we employ as a diagnostic measurement-induced entanglement (MIE): the average entanglement generated between two parties after measuring the rest of the system. We propose that for a sign-free state, the MIE upon measuring in the sign-free basis decays no slower than correlations in the state before measurement. Concretely, we prove that MIE is upper bounded by mutual information for sign-free stabilizer states (essentially CSS codes), which establishes a bound between scaling dimensions of conformal field theories describing measurement-induced critical points in stabilizer systems. We also show that for sign-free qubit wavefunctions, MIE between two qubits is upper bounded by a simple two-point correlation function, and we verify our proposal in several critical ground states of one-dimensional systems, including the transverse field and tri-critical Ising models. In contrast, for states with sign structure, such bounds can be violated, as we illustrate in critical hybrid circuits involving both Haar or Clifford random unitaries and measurements, and gapless symmetry-protected topological states.

quant-ph↗

arXiv2022

Ultrafast Entanglement Dynamics in Monitored Quantum Circuits

Projective measurement, a basic operation in quantum mechanics, can induce seemingly nonlocal effects. In this work, we analyze such effects in many-body systems by studying the non-equilibrium dynamics of weakly monitored quantum circuits, focusing on entanglement generation and information spreading. We find that, due to measurements, the entanglement dynamics in monitored circuits is indeed "faster" than that of unitary ones in several ways. Specifically, we find that a pair of well-separated regions can become entangled in a time scale $\ell^{2/3}$, sub-linear in their distance $\ell$. For the case of Clifford monitored circuits, this originates from super-ballistically growing stabilizer generators of the evolving state. In addition, we find initially local information can spread super-ballistically as $t^{3/2}$. Furthermore, by viewing the dynamics as a dynamical encoding process, we show that the super-ballistic growing length scale relates to an encoding time that is sublinear in system size. To quantify the information dynamics, we develop a formalism generalizing operator spreading to non-unitary dynamics, which is of independent interest.

cond-mat.stat-mech↗

arXiv2021

Measurement Protected Quantum Phases

We introduce a class of hybrid quantum circuits, with random unitaries and projective measurements, which host long-range order in the area law entanglement phase of the steady state. Our primary example is circuits with unitaries respecting a global Ising symmetry and two competing types of measurements. The phase diagram has an area law phase with spin glass order, which undergoes a direct transition to a paramagnetic phase with volume law entanglement, as well as a critical regime. Using mutual information diagnostics, we find that such entanglement transitions preserving a global symmetry are in new universality classes. We analyze generalizations of such hybrid circuits to higher dimensions, which allow for coexistence of order and volume law entanglement, as well as topological order without any symmetry restrictions.

cond-mat.stat-mech↗

arXiv2020

Entanglement Negativity at Measurement-Induced Criticality

We propose entanglement negativity as a fine-grained probe of measurement-induced criticality. We motivate this proposal in stabilizer states, where for two disjoint subregions, comparing their "mutual negativity" and their mutual information leads to a precise distinction between bipartite and multipartite entanglement. In a measurement-only stabilizer circuit that maps exactly to two-dimensional critical percolation, we show that the mutual information and the mutual negativity are governed by boundary conformal fields of different scaling dimensions at long distances. We then consider a class of "hybrid" circuit models obtained by perturbing the measurement-only circuit with unitary gates of progressive levels of complexity. While other critical exponents vary appreciably for different choices of unitary gate ensembles at their respective critical points, the mutual negativity has scaling dimension 3 across remarkably many of the hybrid circuits, which is notably different from that in percolation. We contrast our results with limiting cases where a geometrical minimal-cut picture is available.

cond-mat.stat-mech↗

arXiv2020

GripNet: Graph Information Propagation on Supergraph for Heterogeneous Graphs

Heterogeneous graph representation learning aims to learn low-dimensional vector representations of different types of entities and relations to empower downstream tasks. Existing methods either capture semantic relationships but indirectly leverage node/edge attributes in a complex way, or leverage node/edge attributes directly without taking semantic relationships into account. When involving multiple convolution operations, they also have poor scalability. To overcome these limitations, this paper proposes a flexible and efficient Graph information propagation Network (GripNet) framework. Specifically, we introduce a new supergraph data structure consisting of supervertices and superedges. A supervertex is a semantically-coherent subgraph. A superedge defines an information propagation path between two supervertices. GripNet learns new representations for the supervertex of interest by propagating information along the defined path using multiple layers. We construct multiple large-scale graphs and evaluate GripNet against competing methods to show its superiority in link prediction, node classification, and data integration.

cs.LG↗

arXiv2020

Tri-graph Information Propagation for Polypharmacy Side Effect Prediction

The use of drug combinations often leads to polypharmacy side effects (POSE). A recent method formulates POSE prediction as a link prediction problem on a graph of drugs and proteins, and solves it with Graph Convolutional Networks (GCNs). However, due to the complex relationships in POSE, this method has high computational cost and memory demand. This paper proposes a flexible Tri-graph Information Propagation (TIP) model that operates on three subgraphs to learn representations progressively by propagation from protein-protein graph to drug-drug graph via protein-drug graph. Experiments show that TIP improves accuracy by 7%+, time efficiency by 83$\times$, and space efficiency by 3$\times$.

cs.LG↗