arXiv subjects

Qianqian Liu

Publications and source records attributed to Qianqian Liu.

At least 19 recordsLinked to original sources

arXiv2026

Non-monotonic evolution of multipartite entanglement under the Unruh effect

We investigate the behavior of tetrapartite entanglement in a four-qubit Dicke state under relativistic motion by employing the Unruh-DeWitt detector model, where one detector undergoes uniform acceleration. We show that the entanglement exhibits a non-monotonic evolution: it first decreases and subsequently increases toward a finite value as the acceleration grows. In contrast to the conventional view that the Unruh effect leads to a monotonic degradation of multipartite entanglement, our results demonstrate that it can instead enhance multipartite entanglement within a finite parameter regime. This behavior reveals a dual role of the Unruh effect in multipartite systems. Our findings therefore provide a refined understanding of relativistic multipartite quantum correlations, indicating that Dicke states constitute more robust multipartite quantum resources against Unruh-induced decoherence and may offer advantages for relativistic quantum information processing tasks.

gr-qc↗

arXiv2026

Topology-dependent relativistic degradation of multipartite entanglement

The influence of relativistic motion on quantum entanglement is commonly attributed to acceleration-induced thermal noise. Here we show that, for asymmetric multipartite states, the topology of entanglement can become equally important. Considering a three-qubit Star state in the Unruh-DeWitt detector framework, we compare two inequivalent acceleration configurations in which either the central or a peripheral qubit undergoes uniform acceleration. We demonstrate that these physically equivalent accelerations lead to qualitatively different entanglement dynamics: acceleration of a peripheral qubit induces a revival of one-tangle that is absent when the central qubit accelerates, whereas genuine tripartite entanglement decays monotonically but with markedly different robustness. Our results uncover a topology-dependent mechanism for relativistic entanglement degradation, showing that the response of multipartite quantum correlations is determined jointly by Unruh thermalization and the structural role of the accelerated subsystem. This work identifies asymmetric quantum networks as a distinct platform for controlling relativistic quantum resources.

quant-ph↗

arXiv2026

Quantum advantage prediction in turbulent free-space quantum illumination

Quantum illumination offers a significant theoretical advantage for target detection in high background noise environments. However, its practical deployment in free-space channels is hindered by atmospheric turbulence. Stochastic fluctuations in atmospheric turbulence inevitably degrade the quantum signature, rendering the real-time evaluation of quantum advantage under such dynamic conditions a critical yet unresolved challenge. To circumvent the reliance on costly direct turbulence measurements, we propose a physics-driven framework that integrates Kolmogorov-Arnold networks directly bridge macroscopic meteorological observations with microscopic quantum channel dynamics. Trained on 105,120 samples from 12 climatically diverse sites and validated on 26,280 unseen samples from three extreme boundary conditions (arid continental, tropical maritime, high-altitude plateau), our approach establishes a physically consistent mapping from standard meteorological variables to the temporal evolution of the quantum advantage. This end-to-end system dynamically quantifies the degradation of quantum advantage across diverse turbulence conditions. Our results provide a rigorous theoretical and data-driven pathway for environmental adaptation, facilitating the transition of quantum radar networks from proof-of-principle demonstrations to all-weather operational systems.

quant-ph↗

arXiv2025

Graphs with large maximum forcing number

For a graph $G$ with order $2n$ and a perfect matching, let $f(G)$ and $F(G)$ denote the minimum and maximum forcing number of $G$ respectively. Then $0\leq f(G)\leq F(G)\leq n-1$. Liu and Zhang [10] ever proposed a conjecture: $e(G)\geq \frac{n^2}{n-F(G)}$, where $e(G)$ denotes the number of edges of $G$. In this paper we confirm this conjecture and obtain $F(G)\leq n-\frac{n^2}{e(G)}$. If $F(G)=n-1$, Liu and Zhang [9] proved that any two perfect matchings of $G$ can be obtained from each other by a series of matching switches along 4-cycles. If $G$ is bipartite and $F(G)\geq n-k$, $1\leq k\leq n-1$, we show that any two perfect matchings of $G$ can be obtained from each other by a series of matching switches along even cycles of length at most $2(k+1)$. Finally, we ask whether $f(G)\geq \lceil\frac{n}{k}\rceil-1$ holds for such bipartite graphs $G$, and give positive answers for the cases $k=1,2$. Further we show all minimum forcing numbers of the bipartite graphs $G$ of order $2n$ and with $F(G)=n-2$ form an integer interval $[\lfloor\frac{n}{2}\rfloor, n-2]$.

math.CO↗

arXiv2025

DiscoX: Benchmarking Discourse-Level Translation task in Expert Domains

The evaluation of discourse-level translation in expert domains remains inadequate, despite its centrality to knowledge dissemination and cross-lingual scholarly communication. While these translations demand discourse-level coherence and strict terminological precision, current evaluation methods predominantly focus on segment-level accuracy and fluency. To address this limitation, we introduce DiscoX, a new benchmark for discourse-level and expert-level Chinese-English translation. It comprises 200 professionally-curated texts from 7 domains, with an average length exceeding 1700 tokens. To evaluate performance on DiscoX, we also develop Metric-S, a reference-free system that provides fine-grained automatic assessments across accuracy, fluency, and appropriateness. Metric-S demonstrates strong consistency with human judgments, significantly outperforming existing metrics. Our experiments reveal a remarkable performance gap: even the most advanced LLMs still trail human experts on these tasks. This finding validates the difficulty of DiscoX and underscores the challenges that remain in achieving professional-grade machine translation. The proposed benchmark and evaluation system provide a robust framework for more rigorous evaluation, facilitating future advancements in LLM-based translation.

cs.CL↗

arXiv2025

StructVRM: Aligning Multimodal Reasoning with Structured and Verifiable Reward Models

Existing Vision-Language Models often struggle with complex, multi-question reasoning tasks where partial correctness is crucial for effective learning. Traditional reward mechanisms, which provide a single binary score for an entire response, are too coarse to guide models through intricate problems with multiple sub-parts. To address this, we introduce StructVRM, a method that aligns multimodal reasoning with Structured and Verifiable Reward Models. At its core is a model-based verifier trained to provide fine-grained, sub-question-level feedback, assessing semantic and mathematical equivalence rather than relying on rigid string matching. This allows for nuanced, partial credit scoring in previously intractable problem formats. Extensive experiments demonstrate the effectiveness of StructVRM. Our trained model, Seed-StructVRM, achieves state-of-the-art performance on six out of twelve public multimodal benchmarks and our newly curated, high-difficulty STEM-Bench. The success of StructVRM validates that training with structured, verifiable rewards is a highly effective approach for advancing the capabilities of multimodal models in complex, real-world reasoning domains.

cs.AI↗

arXiv2025

Adaptive time-stepping and maximum-principle preserving Lagrangian schemes for gradient flows

We develop in this paper an adaptive time-stepping approach for gradient flows with distinct treatments for conservative and non-conservative dynamics. For the non-conservative gradient flows in Lagrangian coordinates, we propose a modified formulation augmented by auxiliary terms to guarantee positivity of the determinant, and prove that the corresponding adaptive second-order Backward Difference Formulas (BDF2) scheme preserves energy stability and the maximum principle under the time-step ratio constraint $0<r_n\le r_{\max}\le\frac{3}{2}$. On the other hand, for the conservative Wasserstein gradient flows in Lagrangian coordinates, we propose an adaptive BDF2 scheme which is shown to be energy dissipative, and positivity preserving under the time-step ratio constraint $0<r_n\le r_{\max}\le\frac{3+\sqrt{17}}{2}$ in 1D and $0<r_n\le r_{\max}\le \frac{5}{4}$ in 2D, respectively. We also present ample numerical simulations in 1D and 2D to validate the efficiency and accuracy of the proposed schemes.

math.NA↗

arXiv2024

The maximum forcing numbers of quadriculated tori

Klein and Randic (1985) proposed the concept of forcing number, which has an application in chemical resonance theory. Let $G$ be a graph with a perfect matching $M$. The forcing number of $M$ is the smallest cardinality of a subset of $M$ that is contained only in one perfect matching $M$. The maximum forcing number of $G$ is the maximum value of forcing numbers over all perfect matchings of $G$. Kleinerman (2006) obtained that the maximum forcing number of $2n\times 2m$ quadriculated torus is $nm$. By improving Kleinerman's approach, we obtain the maximum forcing numbers of all 4-regular quadriculated graphs on torus except one class.

math.CO↗

arXiv2024

Components of domino tilings under flips in quadriculated tori

In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defined on the set of all tilings of R where two tilings are adjacent if we change one from the other by a flip (a 90-degree rotation of a pair of side-by-side dominoes). If R is simply-connected, then its flip graph is connected. By using homology and cohomology, Saldanha, Tomei, Casarin and Romualdo obtained a criterion to decide if two tilings are in the same component of flip graph of quadriculated surface. By a graph-theoretic method, we obtain that the flip graph of a non-bipartite quadriculated torus consists of two isomorphic components. As an application, we obtain that the forcing numbers of all perfect matchings of each non-bipartite quadriculated torus form an integer-interval. For a bipartite quadriculated torus, the components of the flip graph is more complicated, and we use homology to obtain a general lower bound for the number of components of its flip graph.

math.CO↗

arXiv2024

A new flow dynamic approach for Wasserstein gradient flows

We develop in this paper a new regularized flow dynamic approach to construct efficient numerical schemes for Wasserstein gradient flows in Lagrangian coordinates. Instead of approximating the Wasserstein distance which needs to solve constrained minimization problems, we reformulate the problem using the Benamou-Brenier's flow dynamic approach, leading to algorithms which only need to solve unconstrained minimization problem in $L^2$ distance. Our schemes automatically inherit some essential properties of Wasserstein gradient systems such as positivity-preserving, mass conservative and energy dissipation. We present ample numerical simulations of Porous-Medium equations, Keller-Segel equations and Aggregation equations to validate the accuracy and stability of the proposed schemes. Compared to numerical schemes in Eulerian coordinates, our new schemes can capture sharp interfaces for various Wasserstein gradient flows using relatively smaller number of unknowns.

math.NA↗

arXiv2024

Weak effects of electron-phonon interactions on the lattice thermal conductivity of wurtzite GaN with high electron concentrations

Wurtzite gallium nitride (GaN) has great potential for high-frequency and high-power applications due to its excellent electrical and thermal transport properties. However, enhancing the performance of GaN-based power electronics relies on heavy doping. Previous studies showed that electron-phonon interactions have strong effects on the lattice thermal conductivity of GaN due to the Fröhlich interaction. Surprisingly, our investigation reveals weak effects of electron-phonon interactions on the lattice thermal conductivity of n-type GaN at ultra-high electron concentrations and the impact of the Fröhlich interaction can be ignored. The small phonon-electron scattering rate is attributed to the limited scattering channels, quantified by the Fermi surface nesting function. In contrast, there is a significant reduction in the lattice thermal conductivity of p-type GaN at high hole concentrations due to the relatively larger Fermi surface nesting function. Meanwhile, as p-type GaN has relatively smaller electron-phonon matrix elements, the reduction in lattice thermal conductivity is still weaker than that observed in p-type silicon. Our work provides a deep understanding of thermal transport in doped GaN and the conclusions can be further extended to other wide-bandgap semiconductors, including $β$-Ga2O3, AlN, and ZnO.

cond-mat.mtrl-sci↗

arXiv2024

Convergence analysis of a second order numerical scheme for the Flory-Huggins-Cahn-Hilliard-Navier-Stokes system

We present an optimal rate convergence analysis for a second order accurate in time, fully discrete finite difference scheme for the Cahn-Hilliard-Navier-Stokes (CHNS) system, combined with logarithmic Flory-Huggins energy potential. The numerical scheme has been recently proposed, and the positivity-preserving property of the logarithmic arguments, as well as the total energy stability, have been theoretically justified. In this paper, we rigorously prove second order convergence of the proposed numerical scheme, in both time and space. Since the CHNS is a coupled system, the standard $\ell^\infty (0, T; \ell^2) \cap \ell^2 (0, T; H_h^2)$ error estimate could not be easily derived, due to the lack of regularity to control the numerical error associated with the coupled terms. Instead, the $\ell^\infty (0, T; H_h^1) \cap \ell^2 (0, T; H_h^3)$ error analysis for the phase variable and the $\ell^\infty (0, T; \ell^2)$ analysis for the velocity vector, which shares the same regularity as the energy estimate, is more suitable to pass through the nonlinear analysis for the error terms associated with the coupled physical process. Furthermore, the highly nonlinear and singular nature of the logarithmic error terms makes the convergence analysis even more challenging, since a uniform distance between the numerical solution and the singular limit values of is needed for the associated error estimate. Many highly non-standard estimates, such as a higher order asymptotic expansion of the numerical solution (up to the third order accuracy in time and fourth order in space), combined with a rough error estimate (to establish the maximum norm bound for the phase variable), as well as a refined error estimate, have to be carried out to conclude the desired convergence result.

math.NA↗

arXiv2024

Optimal quantum strategy for locating Unruh channels

From the perspective of quantum information theory, the effect of Unruh radiation on a two-level accelerated detector can be modeled as a quantum channel. In this work, we employ the tools of channel-position finding to locate Unruh channels. The signal-idler and idler-free protocols are explored to determine the position of the target Unruh channel within a sequence of background channels. We derive the fidelity-based bounds for the ultimate error probability of each strategy and obtain the conditions where the signal-idler protocol is superior to the protocol involving idler-free states. It is found that the lower bound of the error probability for the signal-idler scheme exhibits clear advantages in all cases, while the idler-free scheme can only be implemented when the temperature of the two channels is very close and the number of initial states is insufficient. Interestingly, it is shown that the optimal detection protocol relies on the residual correlations shared between the emitted probe state and the retained idler modes.

gr-qc↗

arXiv2024

Joint Service Caching, Communication and Computing Resource Allocation in Collaborative MEC Systems: A DRL-based Two-timescale Approach

Meeting the strict Quality of Service (QoS) requirements of terminals has imposed a signiffcant challenge on Multiaccess Edge Computing (MEC) systems, due to the limited multidimensional resources. To address this challenge, we propose a collaborative MEC framework that facilitates resource sharing between the edge servers, and with the aim to maximize the long-term QoS and reduce the cache switching cost through joint optimization of service caching, collaborative offfoading, and computation and communication resource allocation. The dual timescale feature and temporal recurrence relationship between service caching and other resource allocation make solving the problem even more challenging. To solve it, we propose a deep reinforcement learning (DRL)-based dual timescale scheme, called DGL-DDPG, which is composed of a short-term genetic algorithm (GA) and a long short-term memory network-based deep deterministic policy gradient (LSTM-DDPG). In doing so, we reformulate the optimization problem as a Markov decision process (MDP) where the small-timescale resource allocation decisions generated by an improved GA are taken as the states and input into a centralized LSTM-DDPG agent to generate the service caching decision for the large-timescale. Simulation results demonstrate that our proposed algorithm outperforms the baseline algorithms in terms of the average QoS and cache switching cost.

cs.NI↗

arXiv2023

Report on 2023 CyberTraining PI Meeting, 26-27 September 2023

This document describes a two-day meeting held for the Principal Investigators (PIs) of NSF CyberTraining grants. The report covers invited talks, panels, and six breakout sessions. The meeting involved over 80 PIs and NSF program managers (PMs). The lessons recorded in detail in the report are a wealth of information that could help current and future PIs, as well as NSF PMs, understand the future directions suggested by the PI community. The meeting was held simultaneously with that of the PIs of the NSF Cyberinfrastructure for Sustained Scientific Innovation (CSSI) program. This co-location led to two joint sessions: one with NSF speakers and the other on broader impact. Further, the joint poster and refreshment sessions benefited from the interactions between CSSI and CyberTraining PIs.

cs.CR↗

arXiv2023

Quantum properties of fermionic fields in multi-event horizon spacetime

We investigate the properties of quantum entanglement and mutual information in the multi-event horizon Schwarzschild-de Sitter (SdS) spacetime for massless Dirac fields. We obtain the expression for the evolutions of the quantum state near the black hole event horizon (BEH) and cosmological event horizon (CEH) in the SdS spacetime. Under the Nariai limit, the physically accessible entanglement and mutual information are maximized, and the physically inaccessible correlations are zero. With the increase in temperature of either horizon, the physically accessible correlations experience degradation. Notably, the initial state remains entangled and can be utilized in entanglement-based quantum information processing tasks, which differs form the scalar field case. Furthermore, the degradation of physically accessible correlations is more pronounced for small-mass black holes. In contrast, the physically inaccessible correlations separated by the CEH monotonically increase with the radiation temperature, and such correlations are not decisively influenced by the effect of particle creation at the BEH. Moreover, a similar phenomenon is observed for the inaccessible correlations separated by the BEH. This result differs from the single event spacetime, in which the physically inaccessible entanglement is a monotonic function of the Hawking temperature.

gr-qc↗

arXiv2022

Error estimates and blow-up analysis of a finite-element approximation for the parabolic-elliptic Keller-Segel system

The Keller-Segel equations are widely used for describing chemotaxis in biology. Recently, a new fully discrete scheme for this model was proposed in [46], mass conservation, positivity and energy decay were proved for the proposed scheme, which are important properties of the original system. In this paper, we establish the error estimates of this scheme. Then, based on the error estimates, we derive the finite-time blowup of nonradial numerical solutions under some conditions on the mass and the moment of the initial data.

math.NA↗

arXiv2022

Components of domino tilings under flips in quadriculated cylinder and torus

In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the set of all tilings of $R$ such that two tilings are adjacent if we change one to another by a flip (a $90^{\circ}$ rotation of a pair of side-by-side dominoes). It is well-known that $\mathcal{T}(R)$ is connected when $R$ is simply connected. By using graph theoretical approach, we show that the flip graph of $2m\times(2n+1)$ quadriculated cylinder is still connected, but the flip graph of $2m\times(2n+1)$ quadriculated torus is disconnected and consists of exactly two isomorphic components. For a tiling $t$, we associate an integer $f(t)$, forcing number, as the minimum number of dominoes in $t$ that is contained in no other tilings. As an application, we obtain that the forcing numbers of all tilings in $2m\times (2n+1)$ quadriculated cylinder and torus form respectively an integer interval whose maximum value is $(n+1)m$.

math.CO↗