Searcharxiv⌕ Search

arXiv subjects

Trung V. Phan

Publications and source records attributed to Trung V. Phan.

At least 19 recordsLinked to original sources

Field-Driven Active Matter Physics and Material Applications

Active matter consists of energy-consuming units that generate motion, making it a powerful platform for exploring nonequilibrium physics and engineering adaptive materials. Robotic active matter brings this physics into programmable, macroscopic agents with controllable actuation, sensing, and response, but its scalability is limited by onboard power, communication, and control complexity. Field-driven active matter addresses these limitations by shifting part of the control burden from individual agents to external or environmental fields, such as magnetic, electric, acoustic, optical, and fluidic fields, which can power, guide, and couple many agents simultaneously. Beyond applications in targeted navigation, adaptive collaboration, and flexible transport, field-driven robotic active matter offers a controllable testbed for nonequilibrium phenomena that are difficult to isolate in molecular or colloidal active matter, including tunable interactions, programmable phase transitions, solid-fluid switching, hyperuniform order, and reconfigurable collective motion. Here, we present field-driven active matter as a bridge between active matter physics and functional material engineering, organized through a unified field-to-information-to-physics-to-function framework that links field-mediated interactions, information processing, and memory to collective transport, reconfiguration, and mechanical performance. By distributing control between agents and fields, field-driven active matter offers a pathway toward intelligent materials capable of sensing, adaptation, computation, reconfiguration, and performing complex tasks, while expanding both the scientific scope of nonequilibrium physics and the practical capabilities of engineered matter.

cond-mat.soft↗

A Numerical Approach to Quantization

We introduce a numerical approach that simultaneously searches for matrix quantizations and compatible Poisson structures on classical geometric surfaces. Our method identifies irreducible Hermitian matrix representations and a trainable Poisson multiplier by minimizing a loss function that penalizes violations of the Casimir and commutation constraints. Through numerical investigations and subsequent theoretical analysis, we establish a no-go theorem showing that, for Weyl quantized fuzzy spheres with nondegenerate axial spectrum, the matrix dimension cannot exceed the degree of the nonconstant polynomial axial Poisson multiplier. We further extend our approach to nonpolynomial Poisson multipliers, demonstrating its versatility and potential to drive novel discoveries. Although here we focus on Weyl quantized fuzzy spheres, the framework is extensible to general geometric manifolds and quantization schemes. Our approach also provides a practical starting point for investigating Schild string theory and the quantization of spacetime histories.

quant-ph↗

Geometry-Agnostic Data-Driven Discovery of Extreme Scenarios

We introduce a two-stage data-driven neural framework for discovering dynamically admissible extreme scenarios. Rather than assuming prior knowledge of the governing equations, the first stage infers the effective dynamical constraints directly from observational data. When the underlying physical system possesses suitable symmetries, the learned dynamics can be represented in a geometry-agnostic form, independent of any fixed grid, coordinate system, dimensionality, and intrinsic curvature. In the second stage, a physics-informed neural-search uses this learned dynamics to uncover rare, high-impact coherent structures that may not have appeared in the original observations. We demonstrate this framework through representative examples of increasing dimensionality and geometric complexity. Starting from a traditionally learned Duffing dynamics, we find a homoclinic pulse as a plausible localized extreme scenario. Next, since the same equation also appears in the stationary nonlinear Schrodinger system, with the coordinate interpreted as space instead of time, this pulse becomes a standing soliton. We then retrain the first stage using a geometry-agnostic neural representation, enabling the learned dynamics to be lifted to higher-dimensional space to obtain higher-dimensional solitary profile, known as Townes soliton. Finally, with a Liouville system, we demonstrate that dynamics learned from data on a (1+1)-dimensional Lorentzian quasi-manifold can be transferred to a (2+0)-dimensional Euclidean manifold to identify an instanton. Our approach can be applied to other coherent spatiotemporal structures, including kinks, rogue waves, compactons, peakons, and potentially even singularities, with applications in risk analysis, nonlinear forecasting, and anomaly detection.

cs.LG↗

Quantum Topological Data Analysis Beyond Betti Numbers: Complexity Hardness $\&$ An Algorithm for Torsion Witness

Recent advances have revealed an interplay between quantum computing and topological data analysis (TDA). Most quantum TDA has focused on Betti numbers, which characterize the connectivity and ``holes'' of a dataset. Homology, however, contains additional information in the form of torsion: a nontrivial cycle can become trivial after being repeated finitely, revealing global constraints on how cycles combine and wrap around one another. Beyond applications in biomolecular studies, torsion appears in physical settings including homological quantum rotor codes, discrete charges, and gauge sectors. We study torsion from both classical and quantum perspectives. Given a graph $G$ and its clique complex $K = \mathrm{Cl}(G)$, we first prove that, for fixed $r$ and prime $p$, deciding whether $H_r(K,\mathbb{Z})$ contains $p$-torsion is NP-hard. As a corollary, when a homological rotor code is specified by $G$, deciding whether the code has a finite-dimensional logical sector of a given order is NP-hard. We discuss related problems, including the Bockstein homomorphism, Smith normal form, lattice saturation, and cohomology. Second, for a finite set of primes $P$, we develop a quantum algorithm that serves as a one-sided torsion witness. For fixed $r$, it outputs WITNESS or INCONCLUSIVE, i.e. WITNESS certifies that either $H_r(K,\mathbb{Z})$ or $H_{r-1}(K,\mathbb{Z})$ contains $p$-torsion for some $p\in P$ while INCONCLUSIVE makes no claim about its presence or absence. We identify a regime in which the algorithm achieves a near-quadratic quantum speedup over the corresponding classical algorithm under the same input model. Our NP-hardness result complements recent hardness results for estimating Betti numbers, adding a complexity-theoretic perspective to quantum TDA. Together, these results demonstrate that integral homology, beyond its Betti numbers, can be computationally challenging.

quant-ph↗

A Shape-Preserving Shell Theorem

We identify all radial interaction potentials that generalize Newton's exterior shell theorem, for which a uniformly distributed spherical shell is indistinguishable from a point-source up to strength renormalization and radial rescaling. We call these shape-preserving shell interactions, extending Gurzadyan's cosmological theorem which considers strength renormalization alone. We further expand the theory from monopolar to multipolar sources and establish the corresponding classification in arbitrary spatial dimensions. We find potential families beyond the spherical property subclass and show that the classifications for multipolar shape-preserving interactions form a nested hierarchy, with each lower-rank class being a subset of the next higher-rank class.

physics.class-ph↗

Quantum Advantage in Topological Data Analysis via Mayer Homology

Prior work has explored quantum algorithms for topological data analysis (TDA), revealing the possibility of exponential quantum speedups in estimating the ratios of Betti numbers to the dimension of the combinatorial Laplacian. However, this quantity is only non-vanishing and efficient-to-quantumly-estimate when Betti numbers are exponentially large, a case for which concrete examples are rarely known. Furthermore, certain randomized classical algorithms are sometimes efficient in this regime. Thus, the prospect of achieving quantum advantage in conventional TDA appears fairly narrow. Here, we address these challenges to the quantum advantage in TDA by developing quantum algorithms for Mayer homology, which generalize simplicial homology to $N$-nilpotent boundary operators ($\partial^N =0$) and have recently been successfully applied to real-world TDA contexts. We introduce an efficient quantum algorithm for estimating Mayer Betti numbers and their persistent counterparts. We then prove that for high-order simplices, Mayer Betti numbers are often exponentially large in the dense regime, which ameliorates the normalization bottleneck of conventional quantum TDA. In the same regime, we argue that existing dequantization algorithms developed for conventional TDA, when applied to Mayer homology, generally lose theoretical guaranties, facing certain structural barriers that prevent their practical utilities. We also provide logical resource estimates revealing that a quantum computer with roughly a few hundred qubits and sixty million Toffoli gates could solve Mayer homology problems beyond the capabilities of known classical approaches. Finally, we discuss real-world applications of Mayer homology in genomics, supersymmetry, drug discovery, and neuroscience, revealing the potential of our quantum algorithm to deliver real-world impacts via Mayer homology.

quant-ph↗

DeepFaith: Evidence-Grounded LLMs for Faithful Incident Reporting in Multi-Stage APT Defense

Advanced Persistent Threats (APTs) are difficult to detect and interpret due to their multi-stage and stealthy nature. While recent autonomous defense systems leverage provenance graphs and learning-based models for detection and mitigation, their outputs remain largely machine-oriented and difficult for analysts to interpret. Large language models (LLMs) offer a promising interface for report generation, but often produce hallucinated or weakly grounded content. In this paper, we propose DeepFaith, an evidence-grounded framework for faithful incident reporting in multi-stage APT defense. DeepFaith transforms structured outputs from autonomous defense and explainability modules into natural-language reports that are explicitly aligned with underlying system evidence. The framework integrates a unified evidence representation, evidence-grounded prompting, faithfulness-aware generation, and post-generation verification to ensure that all generated statements are supported. Experiments in a realistic enterprise testbed demonstrate that DeepFaith improves faithfulness from 0.68 to 0.92, reduces unsupported claims from 0.32 to 0.08, and increases temporal consistency from 0.6 to 0.88, while maintaining concise reports and lower error rates than existing template-based and LLM-based solutions. These results show that evidence-grounded generation enables reliable, interpretable, and actionable reporting for security operations centers.

cs.CR↗

Adaptive High-Level Tight Control of Prostate Cancer: A Path from From Terminal Disease to Chronic Condition

Metastatic prostate cancer is one of the leading causes of cancer-related morbidity and mortality worldwide. It is characterized by a high mortality rate and a poor prognosis. In this work, we explore how a clinical oncologist can apply a Stackelberg game-theoretic framework to prolong metastatic prostate cancer survival, or even make it chronic in duration. We utilize a Bayesian optimization approach to identify the optimal adaptive chemotherapeutic treatment policy for a single drug (Abiraterone) to maximize the time before the patient begins to show symptoms. We show that, with precise adaptive optimization of drug delivery, it is possible to significantly prolong the cancer suppression period, potentially converting metastatic prostate cancer from a terminal disease to a chronic disease for most patients, as supported by clinical and analytical evidence. We suggest that clinicians might explore the possibility of implementing a high-level tight control (HLTC) treatment, in which the trigger signals (i.e. biomarker levels) for drug administration and cessation are both high and close together, typically yield the best outcomes, as demonstrated through both computation and theoretical analysis. This simple insight could serve as a valuable guide for improving current adaptive chemotherapy treatments in other hormone-sensitive cancers.

q-bio.QM↗

Learning the APT Kill Chain: Temporal Reasoning over Provenance Data for Attack Stage Estimation

Advanced Persistent Threats (APTs) evolve through multiple stages, each exhibiting distinct temporal and structural behaviors. Accurate stage estimation is critical for enabling adaptive cyber defense. This paper presents StageFinder, a temporal-graph learning framework for multi-stage attack progression inference from fused host and network provenance data. Provenance graphs are encoded using a graph neural network to capture structural dependencies among processes, files, and connections, while a long short-term memory (LSTM) model learns temporal dynamics to estimate stage probabilities aligned with the MITRE ATT&CK framework. The model is pretrained on the DARPA OpTC dataset and fine-tuned on labeled DARPA Transparent Computing data. Experimental results demonstrate that StageFinder achieves a macro F1-score of 0.96 and reduces prediction volatility by 31% compared to state-of-the-art baselines (Cyberian, NetGuardian). These results highlight the effectiveness of fused provenance-temporal learning for accurate and stable APT stage inference.

cs.CR↗

DeepStage: Learning Autonomous Defense Policies Against Multi-Stage APT Campaigns

This paper presents DeepStage, a deep reinforcement learning (DRL) framework for adaptive and stage-aware defense against Advanced Persistent Threats (APTs). The enterprise environment is formulated as a partially observable Markov decision process (POMDP), in which host provenance and network telemetry are fused into unified provenance graphs. Building on our prior work (StageFinder), DeepStage employs a graph neural network encoder and an LSTM-based stage estimator to infer probabilistic attacker stages aligned with the MITRE ATT&CK framework. The resulting stage beliefs, together with graph embeddings, are used to guide a hierarchical Proximal Policy Optimization (PPO) agent that selects defense actions across monitoring, access control, containment, and remediation. Experiments in a realistic enterprise testbed with CALDERA-driven APT playbooks show that DeepStage achieves an average F1-score of 0.887 and a mitigation success rate of 84.7%, outperforming a risk-aware DRL baseline by 21.8% in F1-score and 16.2% in mitigation success. The results demonstrate effective stage-aware and cost-efficient autonomous cyber defense.

cs.CR↗

DeepXplain: XAI-Guided Autonomous Defense Against Multi-Stage APT Campaigns

Advanced Persistent Threats (APTs) are stealthy, multi-stage attacks that require adaptive and timely defense. While deep reinforcement learning (DRL) enables autonomous cyber defense, its decisions are often opaque and difficult to trust in operational environments. This paper presents DeepXplain, an explainable DRL framework for stage-aware APT defense. Building on our prior DeepStage model, DeepXplain integrates provenance-based graph learning, temporal stage estimation, and a unified XAI pipeline that provides structural, temporal, and policy-level explanations. Unlike post-hoc methods, explanation signals are incorporated directly into policy optimization through evidence alignment and confidence-aware reward shaping. To the best of our knowledge, DeepXplain is the first framework to integrate explanation signals into reinforcement learning for APT defense. Experiments in a realistic enterprise testbed show improvements in stage-weighted F1-score (0.887 to 0.915) and success rate (84.7% to 89.6%), along with higher explanation confidence (0.86), improved fidelity (0.79), and more compact explanations (0.31). These results demonstrate enhanced effectiveness and trustworthiness of autonomous cyber defense.

cs.CR↗

Generalizing Shell Theorem to Constant Curvature Spaces in All Dimensions and Topologies

A gravitational potential has the spherical property when the field outside any uniform spherical shell is indistinguishable from that of a point mass at the center. We present the general potentials that possess this property on constant curvature spaces, using the Euler-Poisson-Darboux identity for spherical means. Our results are consistent with known findings in flat three-dimensional space and reduce to Gurzadyan's cosmological theorem when the rescaling factor is exactly $1$. Our approach naturally extends to nontrivial spatial topologies.

physics.class-ph↗

Quantum Kaczmarz Algorithm for Solving Linear Algebraic Equations

We introduce a quantum linear system solving algorithm based on the Kaczmarz method, a widely used workhorse for large linear systems and least-squares problems that updates the solution by enforcing one equation at a time. Its simplicity and low memory cost make it a practical choice across data regression, tomographic reconstruction, and optimization. In contrast to many existing quantum linear solvers, our method does not rely on oracle access to query entries, relaxing a key practicality bottleneck. In particular, when the rank of the system of interest is sufficiently small and the rows of the matrix of interest admit an appropriate structure, we achieve circuit complexity $\mathcal{O}\left(\frac{1}{\varepsilon}\log m\right)$, where $m$ is the number of variables and $\varepsilon$ is the target precision, without dependence on the sparsity $s$, and could possibly be without explicit dependence on condition number $κ$. This shows a significant improvement over previous quantum linear solvers where the dependence on $κ,s$ is at least linear. At the same time, when the rows have an arbitrary structure and have at most $s$ nonzero entries, we obtain the circuit depth $\mathcal{O}\left(\frac{1}{\varepsilon}\log s\right)$ using extra $\mathcal{O}(s)$ ancilla qubits, so the depth grows only logarithmically with sparsity $s$. When the sparsity $s$ grows as $\mathcal{O}(\log m)$, then our method can achieve an exponential improvement with respect to circuit depth compared to existing quantum algorithms, while using (asymptotically) the same amount of qubits.

quant-ph↗

Self-Image Multiplicity in a Concave Cylindrical Mirror

Concave mirrors are fundamental optical elements, yet some easily observed behaviors are rarely addressed in standard textbooks, such as the formation of multiple reflected images. Here we investigate self-imaging -- where the observer is also the observed object -- using a concave cylindrical mirror. We predict the number of self-images visible from different observation points and classify space into regions by image count. We then test these predictions with an inexpensive stainless-steel concave cylindrical mirror commonly found in teaching labs. This activity links geometrical optics principles to direct observation and provides a ready-to-use classroom demonstration and student exercise.

physics.optics↗

Informational Memory Shapes Collective Behavior in Intelligent Swarms

We present an experimental and theoretical study of 2-D swarms in which collective behavior emerges from both direct local mechanical coupling between agents and from the exchange and processing of information between agents. Each agent, an air-table drone endowed with internal memory and a binary decision variable, updates its state by integrating a time series of memories of local past collisions. This internal computation transforms the drone swarm into a dynamical information network in which history-dependent feedback drives spontaneous complete spin polarization, pitchfork bifurcated spin collectives, and chaotic switching between collective states. By tuning the depth of memory and the decision algorithm, we uncover a memory-induced phase transition that breaks spin symmetry at the population level. A minimal theoretical model maps these dynamics onto an effective potential landscape sculpted by informational feedback, revealing how temporally correlated computation can replace instantaneous forces as the driver of collective organization, informed by experiments. These results position physically interacting drone swarms as a model system for exploring the physics of informational drone ensembles whose emergent behavior arises from the interplay between physical interaction and information processing.

physics.soc-ph↗

Quantum Algorithm for Estimating Ollivier-Ricci Curvature

We introduce a quantum algorithm for computing the Ollivier Ricci curvature, a discrete analogue of the Ricci curvature defined via optimal transport on graphs and general metric spaces. This curvature has seen applications ranging from signaling fragility in financial networks to serving as basic quantities in combinatorial quantum gravity. For inputs given as a point cloud with pairwise distances, we show that our algorithm can achieve an exponential speedup over the best-known classical methods for two particular classes of problem. Our work is another step toward quantum algorithms for geometrical problems that are capable of delivering practical value while also informing fundamental theory.

quant-ph↗

Digitization Can Stall Swarm Transport: Commensurability Locking in Quantized-Sensing Chains

We present a minimal model for autonomous robotic swarms in one- and higher-dimensional spaces, where identical, field-driven agents interact pairwise to self-organize spacing and independently follow local gradients sensed through quantized digital sensors. We show that the collective response of a multi-agent train amplifies sensitivity to weak gradients beyond what is achievable by a single agent. We discover a fractional transport phenomenon in which, under a uniform gradient, collective motion freezes abruptly whenever the ratio of intra-agent sensor separation to inter-agent spacing satisfies a number-theoretic commensurability condition. This commensurability locking persists even as the number of agents tends to infinity. We find that this condition is exactly solvable on the rationals -- a dense subset of real numbers -- providing analytic, testable predictions for when transport stalls. Our findings establish a surprising bridge between number theory and emergent transport in swarm robotics, informing design principles with implications for collective migration, analog computation, and even the exploration of number-theoretic structure via physical experimentation.

cond-mat.soft↗

Fractatomic Physics: An Invitation with Atomic Stability and Rydberg States in Fractal Spaces

We explore the physical quantum properties of atoms in fractal spaces, both as a theoretical generalization of normal integer-dimensional Euclidean spaces and as an experimentally realizable setting. We identify the threshold of fractality at which Ehrenfest atomic instability emerges, where the Schrödinger equation describing the wave-function of a single electron orbiting around an atom becomes scale-free, and discuss the potential of observing this phenomena in laboratory settings. We then study the Rydberg states of stable atoms using the Wentzel-Kramers-Brillouin approximation, along with a proposed extension for the Langer modification, in general fractal dimensionalities. We show that fractal space atoms near instability explode in size even at low-number excited state, making them highly suitable to induce strong entanglements and foster long-range many-body interactions. We argue that atomic physics in fractal spaces -- ``fractatomic physics'' -- is a rich research avenue deserving of further theoretical and experimental investigations.

quant-ph↗