Searcharxiv⌕ Search

arXiv subjects

Chao Yin

Publications and source records attributed to Chao Yin.

At least 37 records · Page 2Linked to original sources

Stepwise Decomposition and Dual-stream Focus: A Novel Approach for Training-free Camouflaged Object Segmentation

While promptable segmentation (\textit{e.g.}, SAM) has shown promise for various segmentation tasks, it still requires manual visual prompts for each object to be segmented. In contrast, task-generic promptable segmentation aims to reduce the need for such detailed prompts by employing only a task-generic prompt to guide segmentation across all test samples. However, when applied to Camouflaged Object Segmentation (COS), current methods still face two critical issues: 1) \textit{\textbf{semantic ambiguity in getting instance-specific text prompts}}, which arises from insufficient discriminative cues in holistic captions, leading to foreground-background confusion; 2) \textit{\textbf{semantic discrepancy combined with spatial separation in getting instance-specific visual prompts}}, which results from global background sampling far from object boundaries with low feature correlation, causing SAM to segment irrelevant regions. To address the issues above, we propose \textbf{RDVP-MSD}, a novel training-free test-time adaptation framework that synergizes \textbf{R}egion-constrained \textbf{D}ual-stream \textbf{V}isual \textbf{P}rompting (RDVP) via \textbf{M}ultimodal \textbf{S}tepwise \textbf{D}ecomposition Chain of Thought (MSD-CoT). MSD-CoT progressively disentangles image captions to eliminate semantic ambiguity, while RDVP injects spatial constraints into visual prompting and independently samples visual prompts for foreground and background points, effectively mitigating semantic discrepancy and spatial separation. Without requiring any training or supervision, RDVP-MSD achieves a state-of-the-art segmentation result on multiple COS benchmarks and delivers a faster inference speed than previous methods, demonstrating significantly improved accuracy and efficiency. The codes will be available at \href{https://github.com/ycyinchao/RDVP-MSD}{https://github.com/ycyinchao/RDVP-MSD}

cs.CV↗

Time Independence Does Not Limit Information Flow. I. The Free-Particle Case

The speed of information propagation in long-range interacting quantum systems is limited by Lieb-Robinson-type bounds, whose tightness can be established by finding specific quantum state-transfer protocols. Previous works have given quantum state-transfer protocols that saturate the corresponding Lieb-Robinson bounds using time-dependent Hamiltonians. Are speed limits for quantum information propagation different for time-independent Hamiltonians? In a step towards addressing this question, we present and analyze two optimal time-independent state-transfer protocols for free-particle systems, which utilize continuous-time single-particle quantum walks with hopping strength decaying as a power law. We rigorously prove and numerically confirm that our protocols achieve quantum state transfer, with controllable error over an arbitrarily long distance in any spatial dimension, at the speed limits set by the free-particle Lieb-Robinson bounds. This shows that time independence does not limit information flow for long-range free-particle Hamiltonians.

quant-ph↗

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate "bottleneck" region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions $L, R$ with $N_L, N_R$ qubits, respectively, coupled only through an intermediate region $C$ with $N_C$ qubits, for any $δ> 0$ we show a lower bound of $Ω(N_R^{1-δ}/\sqrt{N_L}N_C)$ on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between $L$ and $C,R$ that can be generated in time $t$ by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from $O(N_L t)$ to $O(\sqrt{N_L} t)$. As a special case, when applied to the star graph (i.e., one vertex connected to $N$ leaves), we obtain an $Ω(\sqrt{N^{1-δ}})$ lower bound on the routing time and on the time to prepare $N/2$ Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time $Θ(\sqrt{N})$ using Hamiltonian quantum routing, obtaining a speed-up over gate-based routing, which takes time $Θ(N)$.

quant-ph↗

Baichuan 2: Open Large-scale Language Models

Large language models (LLMs) have demonstrated remarkable performance on a variety of natural language tasks based on just a few examples of natural language instructions, reducing the need for extensive feature engineering. However, most powerful LLMs are closed-source or limited in their capability for languages other than English. In this technical report, we present Baichuan 2, a series of large-scale multilingual language models containing 7 billion and 13 billion parameters, trained from scratch, on 2.6 trillion tokens. Baichuan 2 matches or outperforms other open-source models of similar size on public benchmarks like MMLU, CMMLU, GSM8K, and HumanEval. Furthermore, Baichuan 2 excels in vertical domains such as medicine and law. We will release all pre-training model checkpoints to benefit the research community in better understanding the training dynamics of Baichuan 2.

cs.CL↗

Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-all Interactions

The $N$-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. We consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore useful for quantum error correction, interaction-rate enhancement, and transmitting information using power-law interactions. The naive protocol based on parallelizing CNOT gates takes $\mathrm{O}(1)$-time of Hamiltonian evolution. In this work, we propose a fast protocol that achieves GHZ encoding with high accuracy. The evolution time $\mathrm{O}(\log^2N/N)$ almost saturates the theoretical limit $Ω(\log N/N)$. Moreover, the final state is close to the ideal encoded one with high fidelity $> 1-10^{-3}$, up to large system sizes $N\lesssim 2000$. The protocol only requires a few stages of time-independent Hamiltonian evolution; the key idea is to use the data qubit as control, and to use fast spin-squeezing dynamics generated by e.g. two-axis-twisting.

quant-ph↗

Theory of metastable states in many-body quantum systems

We present a mathematical theory of metastable pure states in closed many-body quantum systems with finite-dimensional Hilbert space. Given a Hamiltonian, a pure state is defined to be metastable when all sufficiently local operators either stabilize the state, or raise its average energy. We prove that short-range entangled metastable states are necessarily eigenstates (scars) of a perturbatively close Hamiltonian. Given any metastable eigenstate of a Hamiltonian, in the presence of perturbations, we prove the presence of prethermal behavior: local correlation functions decay at a rate bounded by a time scale nonperturbatively long in the inverse metastability radius, rather than Fermi's Golden Rule. Inspired by this general theory, we prove that the lifetime of the false vacuum in certain $d$-dimensional quantum models grows at least as fast as $\exp(ε^{-d} )$, where $ε\rightarrow 0$ is the relative energy density of the false vacuum; this lower bound matches, for the first time, explicit calculations using quantum field theory. We identify metastable states at finite energy density in the PXP model, along with exponentially many metastable states in "helical" spin chains and the two-dimensional Ising model. Our inherently quantum formalism reveals precise connections between many problems, including prethermalization, robust quantum scars, and quantum nucleation theory, and applies to systems without known semiclassical and/or field theoretic limits.

math-ph↗

A polynomial-time classical algorithm for noisy quantum circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the computational basis). Our approach is based upon the intuition that noise exponentially damps non-local correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by only keeping track of the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasi-polynomial time, so long as the distribution anti-concentrates. A number of practical implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: for constant noise rates, any quantum circuit for which error mitigation is efficient on most input states, is also classically simulable on most input states.

quant-ph↗

Frobenius light cone and the shift unitary

We bound the time necessary to implement the shift unitary on a one-dimensional ring, both using local Hamiltonians and those with power-law interactions. This time is constrained by the Frobenius light cone; hence we prove that (for certain power law exponents) shift unitaries cannot be implemented in the same amount of time needed to prepare long-range Bell pairs. We note an intriguing similarity between the proof of our results, and the hardness of preparing symmetry-protected topological states with symmetry-preserving Hamiltonians.

quant-ph↗

Eigenstate localization in a many-body quantum system

We prove the existence of extensive many-body Hamiltonians with few-body interactions and a many-body mobility edge: all eigenstates below a nonzero energy density are localized in an exponentially small fraction of "energetically allowed configurations" within Hilbert space. Our construction is based on quantum perturbations to a classical low-density parity check code. In principle, it is possible to detect this eigenstate localization by measuring few-body correlation functions in efficiently preparable mixed states.

cond-mat.stat-mech↗

Spatial Signatures of Electron Correlation in Least-Squares Tensor Hyper-Contraction

Least Squares Tensor Hypercontraction (LS-THC) has received some attention in recent years as an approach to reduce the significant computational costs of wavefunction based methods in quantum chemistry. However, previous work has demonstrated that the LS-THC factorization performs disproportionately worse in the description of wavefunction components (e.g. cluster amplitudes $\hat{T}_2$) than Hamiltonian components (e.g. electron repulsion integrals $(pq|rs)$). This work develops novel theoretical methods to study the source of these errors in the context of the real-space $\hat{T}_2$ kernel, and reports, for the first time, the existence of a "correlation feature" in the errors of the LS-THC representation of the "exchange-like" correlation energy $E_X$ and $\hat{T}_2$ that is remarkably consistent across ten molecular species, three correlated wavefunctions, and four basis sets. This correlation feature portends the existence of a "pair-point kernel" missing in the usual LS-THC representation of the wavefunction, which critically depends upon pairs of grid points situated close to atoms and with inter-pair distances between one and two Bohr radii. These findings point the way for future LS-THC developments to address these shortcomings.

physics.chem-ph↗

A Single-Loop Algorithm for Decentralized Bilevel Optimization

Bilevel optimization has gained significant attention in recent years due to its broad applications in machine learning. This paper focuses on bilevel optimization in decentralized networks and proposes a novel single-loop algorithm for solving decentralized bilevel optimization with a strongly convex lower-level problem. Our approach is a fully single-loop method that approximates the hypergradient using only two matrix-vector multiplications per iteration. Importantly, our algorithm does not require any gradient heterogeneity assumption, distinguishing it from existing methods for decentralized bilevel optimization and federated bilevel optimization. Our analysis demonstrates that the proposed algorithm achieves the best-known convergence rate for bilevel optimization algorithms. We also present experimental results on hyperparameter optimization problems using both synthetic and MNIST datasets, which demonstrate the efficiency of our proposed algorithm.

math.OC↗

Locality bounds for quantum dynamics at low energy

We discuss the generic slowing down of quantum dynamics in low energy density states of spatially local Hamiltonians. Beginning with quantum walks of a single particle, we prove that for certain classes of Hamiltonians (deformations of lattice-regularized $H\propto p^{2k}$), the ``butterfly velocity" of particle motion at low energies has an upper bound that must scale as $E^{(2k-1)/2k}$, as expected from dimensional analysis. We generalize these results to obtain bounds on the typical velocities of particles in many-body systems with repulsive interactions, where for certain families of Hubbard-like models we obtain similar scaling.

math-ph↗

Heisenberg-limited metrology with perturbing interactions

We show that it is possible to perform Heisenberg-limited metrology on GHZ-like states, in the presence of generic spatially local, possibly strong interactions during the measurement process. An explicit protocol, which relies on single-qubit measurements and feedback based on polynomial-time classical computation, achieves the Heisenberg limit. In one dimension, matrix product state methods can be used to perform this classical calculation, while in higher dimensions the cluster expansion underlies the efficient calculations. The latter approach is based on an efficient classical sampling algorithm for short-time quantum dynamics, which may be of independent interest.

quant-ph↗

Speed limits and locality in many-body quantum dynamics

We review the mathematical speed limits on quantum information processing in many-body systems. After the proof of the Lieb-Robinson Theorem in 1972, the past two decades have seen substantial developments in its application to other questions, such as the simulatability of quantum systems on classical or quantum computers, the generation of entanglement, and even the properties of ground states of gapped systems. Moreover, Lieb-Robinson bounds have been extended in non-trivial ways, to demonstrate speed limits in systems with power-law interactions or interacting bosons, and even to prove notions of locality that arise in cartoon models for quantum gravity with all-to-all interactions. We overview the progress which has occurred, highlight the most promising results and techniques, and discuss some central outstanding questions which remain open. To help bring newcomers to the field up to speed, we provide self-contained proofs of the field's most essential results.

quant-ph↗

Mixed-State Entanglement Measures in Topological Order

Quantum entanglement is a particularly useful characterization of topological orders which lack conventional order parameters. In this work, we study the entanglement in topologically ordered states between two arbitrary spatial regions, using two distinct mixed-state entanglement measures: the so-called "computable cross-norm or realignment" (CCNR) negativity, and the more well-known partial-transpose (PT) negativity. We first generally compute the entanglement measures: We obtain general expressions both in (2+1)D Chern-Simons field theories under certain simplifying conditions, and in the Pauli stabilizer formalism that applies to lattice models in all dimensions. While the field-theoretic results are expected to be topological and universal, the lattice results contain nontopological/nonuniversal terms as well. This raises the important problem of continuum-lattice comparison which is crucial for practical applications. When the two spatial regions and the remaining subsystem do not have triple intersection, we solve the problem by proposing a general strategy for extracting the topological and universal terms in both entanglement measures. Examples in the (2+1)D $Z_2$ toric code model are also presented. In the presence of trisection points, however, our result suggests that the subleading piece in the PT negativity is not topological and depends on the local geometry of the trisections, which is in harmonics with a technical subtlety in the field-theoretic calculation.

cond-mat.str-el↗

Locality and error correction in quantum dynamics with measurement

The speed of light $c$ sets a strict upper bound on the speed of information transfer in both classical and quantum systems. In nonrelativistic quantum systems, the Lieb-Robinson Theorem imposes an emergent speed limit $v \hspace{-0.2mm} \ll \hspace{-0.2mm} c$, establishing locality under unitary evolution and constraining the time needed to perform useful quantum tasks. We extend the Lieb-Robinson Theorem to quantum dynamics with measurements. In contrast to the expectation that measurements can arbitrarily violate spatial locality, we find at most an $(M \hspace{-0.5mm} +\hspace{-0.5mm} 1)$-fold enhancement to the speed $v$ of quantum information, provided the outcomes of measurements in $M$ local regions are known. This holds even when classical communication is instantaneous, and extends beyond projective measurements to weak measurements and other nonunitary channels. Our bound is asymptotically optimal, and saturated by existing measurement-based protocols. We tightly constrain the resource requirements for quantum computation, error correction, teleportation, and generating entangled resource states (Bell, GHZ, quantum-critical, Dicke, W, and spin-squeezed states) from short-range-entangled initial states. Our results impose limits on the use of measurements and active feedback to speed up quantum information processing, resolve fundamental questions about the nature of measurements in quantum dynamics, and constrain the scalability of a wide range of proposed quantum technologies.

quant-ph↗

Polynomial-time classical sampling of high-temperature quantum Gibbs states

The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout science, ranging from simulating quantum chemistry to discovering the thermodynamic phase diagram of quantum materials or high-density neutron stars. We present a classical algorithm that samples from a high-temperature quantum Gibbs state in a computational (product state) basis. The runtime grows polynomially with the number of particles, while error vanishes polynomially. This algorithm provides an alternative strategy to existing quantum Monte Carlo methods for overcoming the sign problem. Our result implies that measurement-based quantum computation on a Gibbs state can provide exponential speed up only at sufficiently low temperature, and further constrains what tasks can be exponentially faster on quantum computers.

quant-ph↗

Prethermalization and the local robustness of gapped systems

We prove that prethermalization is a generic property of gapped local many-body quantum systems, subjected to small perturbations, in any spatial dimension. More precisely, let $H_0$ be a Hamiltonian, spatially local in $d$ spatial dimensions, with a gap $Δ$ in the many-body spectrum; let $V$ be a spatially local Hamiltonian consisting of a sum of local terms, each of which is bounded by $ε\ll Δ$. Then, the approximation that quantum dynamics is restricted to the low-energy subspace of $H_0$ is accurate, in the correlation functions of local operators, for stretched exponential time scale $τ\sim \exp[(Δ/ε)^a]$ for any $a<1/(2d-1)$. This result does not depend on whether the perturbation closes the gap. It significantly extends previous rigorous results on prethermalization in models where $H_0$ was frustration-free. We infer the robustness of quantum simulation in low-energy subspaces, the existence of athermal ``scarred" correlation functions in gapped systems subject to generic perturbations, the long lifetime of false vacua in symmetry broken systems, and the robustness of quantum information in non-frustration-free gapped phases with topological order.

cond-mat.str-el↗