arXiv subjects

Shan Jin

Publications and source records attributed to Shan Jin.

At least 19 recordsLinked to original sources

arXiv2026

Near-optimal synthesis of non-Gaussian phase gates via qubit-oscillator Rabi control

Non-Gaussian gates remain a key bottleneck for universal continuous-variable (CV) quantum computation because the nonlinearities they require are difficult to engineer. To address this challenge, we develop an efficient qubit-oscillator Rabi synthesis scheme for polynomial phase gates, with a total interaction time that scales polylogarithmically with the inverse target error $\varepsilon$. Specifically, for a class of readily preparable initial states, we show that a degree-$R$ phase gate can be approximated by an analytically constructed Rabi sequence with total time $O(\log^{(R-1)/2+o(1)}(1/\varepsilon))$. This construction requires no numerical optimization and therefore extends naturally to arbitrarily large multimode systems. We further establish a total-time lower bound of $\Omega(\log^{(R-1)/2}(1/\varepsilon))$, showing that the synthesis is near optimal. As applications, we use this scheme to simulate representative CV quantum dynamics and implement a CV quantum algorithm for solving linear partial differential equations. These results establish qubit-oscillator Rabi control as an efficient, analytically compilable, and near-optimal primitive for CV quantum information processing.

quant-ph↗

arXiv2026

Quantum Optical Reinforcement Learning via Spectrum-Resolved Hong-Ou-Mandel Interference

Hong-Ou-Mandel (HOM) interference-based optical neural networks can offer complexity advantages on benchmark learning tasks, but conventional readout compresses the coincidence spectrum into a single scalar, limiting its use in complex settings such as continuous-action reinforcement learning. Here we introduce a spectrum-resolved HOM (SR-HOM) architecture that promotes the photons' spectral degrees of freedom to a trainable computational resource and use it to construct a compact optical actor-critic agent. Diagonal spectral responses generate continuous actions, while higher-order spectral correlations provide nonlinear state-action features for value estimation. Across five continuous-control benchmarks, SR-HOM outperforms parameter-matched multilayer-perceptron baselines, including a $4.4\times$ improvement in sample efficiency and a $74.0\%$ increase in best 100-episode moving-average return for LunarLanderContinuous-v3. Applied to online calibration of drifted tunable-coupler CZ and iSWAP gates for transmon qubits, simulations show it restores fidelities to $0.9917$ and $0.9952$ respectively, exceeding $99.8\%$ of their drift-free calibrated values.

quant-ph↗

arXiv2026

Secure and Privacy-Preserving Vertical Federated Learning

We propose a novel end-to-end privacy-preserving framework, instantiated by three efficient protocols for different deployment scenarios, covering both input and output privacy, for the vertically split scenario in federated learning (FL), where features are split across clients and labels are not shared by all parties. We do so by distributing the role of the aggregator in FL into multiple servers and having them run secure multiparty computation (MPC) protocols to perform model and feature aggregation and apply differential privacy (DP) to the final released model. While a naive solution would have the clients delegating the entirety of training to run in MPC between the servers, our optimized solution, which supports purely global and also global-local models updates with privacy-preserving, drastically reduces the amount of computation and communication performed using multiparty computation. The experimental results also show the effectiveness of our protocols.

cs.CR↗

arXiv2026

Detecting Data Poisoning in Code Generation LLMs via Black-Box, Vulnerability-Oriented Scanning

Code generation large language models (LLMs) are increasingly integrated into modern software development workflows. Recent work has shown that these models are vulnerable to backdoor and poisoning attacks that induce the generation of insecure code, yet effective defenses remain limited. Existing scanning approaches rely on token-level generation consistency to invert attack targets, which is ineffective for source code where identical semantics can appear in diverse syntactic forms. We present CodeScan, which, to the best of our knowledge, is the first poisoning-scanning framework tailored to code generation models. CodeScan identifies attack targets by analyzing structural similarities across multiple generations conditioned on different clean prompts. It combines iterative divergence analysis with abstract syntax tree (AST)-based normalization to abstract away surface-level variation and unify semantically equivalent code, isolating structures that recur consistently across generations. CodeScan then applies LLM-based vulnerability analysis to determine whether the extracted structures contain security vulnerabilities and flags the model as compromised when such a structure is found. We evaluate CodeScan against four representative attacks under both backdoor and poisoning settings across three real-world vulnerability classes. Experiments on 108 models spanning three architectures and multiple model sizes demonstrate 97%+ detection accuracy with substantially lower false positives than prior methods.

cs.CR↗

arXiv2026

Deterministic Generation of Arbitrary Fock States via Resonant Subspace Engineering

Deterministic preparation of high-excitation Fock states is a central challenge in bosonic quantum information, with control complexity that generically explodes as the Hilbert space dimension grows. Here we introduce resonant subspace engineering (RSE), a protocol that analytically confines the infinite-dimensional bosonic dynamics to a two-dimensional invariant subspace spanned by an initial coherent state and the target state. State transfer then reduces to a geodesic rotation on a synthetic Bloch sphere, governed by resonance and phase-matching conditions we derive in closed form. For single Fock states, RSE achieves $O(n^{1/4})$ scaling in both evolution time and gate depth, showing a fundamental improvement over existing deterministic schemes. The construction generalizes to $K$-component superpositions via a $(K{+}1)$-dimensional invariant subspace with full $\mathrm{SU}(K{+}1)$ controllability, requiring only 3-5 iterations of operations for superpositions spanning photon numbers 70--100. RSE provides a scalable and analytically transparent framework for large-scale bosonic state engineering and gate synthesis across single- and multimode platforms.

quant-ph↗

arXiv2026

Pareto Front Engineering of Dynamical Sweet Spots in Superconducting Qubits

Operating superconducting qubits at dynamical sweet spots (DSSs) suppresses decoherence from low-frequency flux noise. A key open question is how long coherence can be extended under this strategy and what fundamental limits constrain it. Here we introduce a fully parameterized, multi-objective periodic-flux modulation framework that simultaneously optimizes energy relaxation $T_1$ and pure dephasing $T_\phi$, thereby quantifying the tradeoff between them. For fluxonium qubits with realistic noise spectra, our method enhances $T_\phi$ by a factor of 3-5 compared with existing DSS strategies while maintaining $T_1$ in the hundred-microsecond range. We further prove that, although DSSs eliminate first-order sensitivity to low-frequency noise, relaxation rate cannot be reduced arbitrarily close to zero, establishing an upper bound on achievable $T_1$. At the optimized working points, we identify double-DSS regions that are insensitive to both DC and AC flux, providing robust operating bands for experiments. As applications, we design single- and two-qubit control protocols at these operating points and numerically demonstrate high-fidelity gate operations. These results establish a general and useful framework for Pareto-front engineering of DSSs that substantially improves coherence and gate performance in superconducting qubits.

quant-ph↗

arXiv2026

Explaining Synergistic Effects in Social Recommendations

In social recommenders, the inherent nonlinearity and opacity of synergistic effects across multiple social networks hinders users from understanding how diverse information is leveraged for recommendations, consequently diminishing explainability. However, existing explainers can only identify the topological information in social networks that significantly influences recommendations, failing to further explain the synergistic effects among this information. Inspired by existing findings that synergistic effects enhance mutual information between inputs and predictions to generate information gain, we extend this discovery to graph data. We quantify graph information gain to identify subgraphs embodying synergistic effects. Based on the theoretical insights, we propose SemExplainer, which explains synergistic effects by identifying subgraphs that embody them. SemExplainer first extracts explanatory subgraphs from multi-view social networks to generate preliminary importance explanations for recommendations. A conditional entropy optimization strategy to maximize information gain is developed, thereby further identifying subgraphs that embody synergistic effects from explanatory subgraphs. Finally, SemExplainer searches for paths from users to recommended items within the synergistic subgraphs to generate explanations for the recommendations. Extensive experiments on three datasets demonstrate the superiority of SemExplainer over baseline methods, providing superior explanations of synergistic effects.

cs.SI↗

arXiv2025

Enhancing the reachability of variational quantum algorithms via input-state design

Variational quantum algorithms (VQAs) face an inherent trade-off between expressivity and trainability: deeper circuits can represent richer states but suffer from noise accumulation and barren plateaus, while shallow circuits remain trainable and implementable but lack expressive power. Here, we propose a general framework to address this challenge by enhancing the VQA performance with a specially designed input state constructed using a linear combination technique. This approach systematically modified the set of states reachable by the original circuit, enhancing accuracy while preserving efficiency. We provide a rigorous proof that such framework increases the expressive capacity of any given VQA ansatz, and demonstrate its broad applicability across different ansatz families. As applications, we apply the method to ground-state preparation of the transverse-field Ising, cluster-Ising, and Fermi-Hubbard models, achieving consistently higher accuracy under the same gate budget compared with standard VQAs. These results highlight input-state design as a powerful complement to circuit design in realizing VQAs that are both expressive and trainable.

quant-ph↗

arXiv2025

Brain PathoGraph Learning

Brain graph learning has demonstrated significant achievements in the fields of neuroscience and artificial intelligence. However, existing methods struggle to selectively learn disease-related knowledge, leading to heavy parameters and computational costs. This challenge diminishes their efficiency, as well as limits their practicality for real-world clinical applications. To this end, we propose a lightweight Brain PathoGraph Learning (BrainPoG) model that enables efficient brain graph learning by pathological pattern filtering and pathological feature distillation. Specifically, BrainPoG first contains a filter to extract the pathological pattern formulated by highly disease-relevant subgraphs, achieving graph pruning and lesion localization. A PathoGraph is therefore constructed by dropping less disease-relevant subgraphs from the whole brain graph. Afterwards, a pathological feature distillation module is designed to reduce disease-irrelevant noise features and enhance pathological features of each node in the PathoGraph. BrainPoG can exclusively learn informative disease-related knowledge while avoiding less relevant information, achieving efficient brain graph learning. Extensive experiments on four benchmark datasets demonstrate that BrainPoG exhibits superiority in both model performance and computational efficiency across various brain disease detection tasks.

cs.LG↗

arXiv2025

New Physics Search at the CEPC: a General Perspective

The Circular Electron-Positron Collider (CEPC), a proposed next-generation Higgs factory, provides new opportunities to explore physics beyond the Standard Model (SM). With its clean electron-positron collision environment and the ability to collect large samples of Higgs, W, and Z bosons, the CEPC enables precision measurements and searches for new physics. This white paper outlines the CEPC's discovery potential, including studies of exotic decays of the Higgs, Z, and top quarks, dark matter and dark sector phenomena, long-lived particles, supersymmetry, and neutrino-related signatures. Advanced detector technologies and reconstruction techniques, such as one-to-one correspondence reconstruction and jet origin identification, significantly improve sensitivity to rare and weakly interacting processes. The CEPC is particularly well suited to probe the electroweak phase transition and test models of electroweak baryogenesis and dark sector interactions. In addition, global fit analyses highlight the CEPC's complementary role in constraining a wide range of new physics scenarios. These features position the CEPC as a powerful tool for exploring the next frontier in fundamental particle physics in the post-Higgs discovery era.

hep-ex↗

arXiv2025

An effcient variational quantum Korkin-Zolotarev algorithm for solving shortest vector problems

Noisy intermediate-scale quantum cryptanalysis focuses on the capability of near-term quantum devices to solve the mathematical problems underlying cryptography, and serves as a cornerstone for the design of post-quantum cryptographic algorithms. For the shortest vector problem (SVP), which is one of the computationally hard problems in lattice-based cryptography, existing near-term quantum cryptanalysis algorithms map the problem onto a fully-connected quantum Ising Hamiltonian, and obtain the solution by optimizing for the first excited state. However, as the quantum system scales with the problem size, determining the first excited state becomes intractable due to the exponentially increased complexity for large-scale SVP instances. In this paper, we propose a variational quantum Korkin-Zolotarev (VQKZ) algorithm, which significantly reduces the qubit requirement for solving the SVP. Specifically, by transforming the original SVP into a series of subproblems on projected sublattices, the proposed VQKZ algorithm enables near-term quantum devices to solve SVP instances with lattice dimensions 61.39% larger than those solvable by previous methods. Furthermore, numerical simulations demonstrate that the proposed VQKZ algorithm can significantly outperform existing methods in terms of the length of solution vectors.

quant-ph↗

arXiv2025

Fixed-point quantum continuous search algorithm with optimal query complexity

Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an uncountably infinite space, presenting unique computational challenges. In this work, we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges, achieving a quadratic speedup. Inspired by the discrete search results, we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs, demonstrating the optimality of our approach. In addition, we demonstrate how to design the internal structure of the quantum search oracle for specific problems. Furthermore, we develop a general framework to apply this algorithm to a range of problem types, including optimization and eigenvalue problems involving continuous variables.

quant-ph↗

arXiv2025

Long-range Brain Graph Transformer

Understanding communication and information processing among brain regions of interest (ROIs) is highly dependent on long-range connectivity, which plays a crucial role in facilitating diverse functional neural integration across the entire brain. However, previous studies generally focused on the short-range dependencies within brain networks while neglecting the long-range dependencies, limiting an integrated understanding of brain-wide communication. To address this limitation, we propose Adaptive Long-range aware TransformER (ALTER), a brain graph transformer to capture long-range dependencies between brain ROIs utilizing biased random walk. Specifically, we present a novel long-range aware strategy to explicitly capture long-range dependencies between brain ROIs. By guiding the walker towards the next hop with higher correlation value, our strategy simulates the real-world brain-wide communication. Furthermore, by employing the transformer framework, ALERT adaptively integrates both short- and long-range dependencies between brain ROIs, enabling an integrated understanding of multi-level communication across the entire brain. Extensive experiments on ABIDE and ADNI datasets demonstrate that ALTER consistently outperforms generalized state-of-the-art graph learning methods (including SAN, Graphormer, GraphTrans, and LRGNN) and other graph learning based brain network analysis methods (including FBNETGEN, BrainNetGNN, BrainGNN, and BrainNETTF) in neurological disease diagnosis. Cases of long-range dependencies are also presented to further illustrate the effectiveness of ALTER. The implementation is available at https://github.com/yushuowiki/ALTER.

cs.LG↗

arXiv2024

Measurements of decay branching fractions of the Higgs boson to hadronic final states at the CEPC

The Circular Electron Positron Collider (CEPC) is a large-scale particle accelerator designed to collide electrons and positrons at high energies. One of the primary goals of the CEPC is to achieve high-precision measurements of the properties of the Higgs boson, facilitated by the large number of Higgs bosons that can be produced with significantly low contamination. The measurements of Higgs boson branching fractions into $b\overline{b} /c\overline{c} /gg$ and $\tau\overline{\tau} /WW^{*} /ZZ^{*} $, where the $W$ or $Z$ bosons decay hadronically, are presented in the context of the CEPC experiment, assuming a scenario with 5600 fb$^{-1}$ of collision data at a center-of-mass energy of 240 GeV. In this study the Higgs bosons are produced in association with a $Z$ boson, with the $Z$ boson decaying into a pair of muons $(\mu^{+}\mu^{-})$, which have high efficiency and high resolution. In order to separate all decay channels simultaneously with high accuracy, the Particle Flow Network (PFN), a graph-based machine learning model, is considered. The precise classification provided by the PFN is employed in measuring the branching fractions using the migration matrix method, which accurately corrects for detector effects in each decay channel. The statistical uncertainty of the measured branching ratio is estimated to be 0.55% in $H\to b\overline{b}$ final state, and approximately 1.5%-16% in $H\to c\overline{c} /gg/\tau\overline{\tau}/WW^{*} /ZZ^{*} $ final states. In addition, the main sources of systematic uncertainties to the measurement of the branching fractions are discussed.

hep-ex↗

arXiv2024

Investigating Creation Perspectives and Icon Placement Preferences for On-Body Menus in Virtual Reality

On-body menus present a novel interaction paradigm within Virtual Reality (VR) environments by embedding virtual interfaces directly onto the user's body. Unlike traditional screen-based interfaces, on-body menus enable users to interact with virtual options or icons visually attached to their physical form. In this paper, We investigated the impact of the creation process on the effectiveness of on-body menus, comparing first-person, third-person, and mirror perspectives. Our first study ($N$ = 12) revealed that the mirror perspective led to faster creation times and more accurate recall compared to the other two perspectives. To further explore user preferences, we conducted a second study ($N$ = 18) utilizing a VR system with integrated body tracking. By combining distributions of icons from both studies ($N$ = 30), we confirmed significant preferences in on-body menu placement based on icon category (e.g., Social Media icons were consistently placed on forearms). We also discovered associations between categories, such as Leisure and Social Media icons frequently co-occurring. Our findings highlight the importance of the creation process, uncover user preferences for on-body menu organization, and provide insights to guide the development of intuitive and effective on-body interactions within virtual environments.

cs.HC↗

arXiv2023

Energy Efficient Obfuscation of Side-Channel Leakage for Preventing Side-Channel Attacks

Side-channel attacks (SCAs), which infer secret information (for example secret keys) by exploiting information that leaks from the implementation (such as power consumption), have been shown to be a non-negligible threat to modern cryptographic implementations and devices in recent years. Hence, how to prevent side-channel attacks on cryptographic devices has become an important problem. One of the widely used countermeasures to against power SCAs is the injection of random noise sequences into the raw leakage traces. However, the indiscriminate injection of random noise can lead to significant increases in energy consumption in device, and ways must be found to reduce the amount of energy in noise generation while keeping the side-channel invisible. In this paper, we propose an optimal energy-efficient design for artificial noise generation to prevent side-channel attacks. This approach exploits the sparsity among the leakage traces. We model the side-channel as a communication channel, which allows us to use channel capacity to measure the mutual information between the secret and the leakage traces. For a given energy budget in the noise generation, we obtain the optimal design of the artificial noise injection by solving the side-channel's channel capacity minimization problem. The experimental results also validate the effectiveness of our proposed scheme.

cs.CR↗

arXiv2023

Achieving quantum advantages for image filtering

Image processing is a fascinating field for exploring quantum algorithms. However, achieving quantum speedups turns out to be a significant challenge. In this work, we focus on image filtering to identify a class of images that can achieve a substantial speedup. We show that for images with efficient encoding and a lower bound on the signal-to-noise ratio, a quantum filtering algorithm can be constructed with a polynomial complexity in terms of the qubit number. Our algorithm combines the quantum Fourier transform with the amplitude amplification technique. To demonstrate the advantages of our approach, we apply it to three typical filtering problems. We highlight the importance of efficient encoding by illustrating that for images that cannot be efficiently encoded, the quantum advantage will diminish. Our work provides insights into the types of images that can achieve a substantial quantum speedup.

quant-ph↗

arXiv2023

Using a virtual reality interview simulator to explore factors influencing people's behavior

Virtual reality interview simulator (VRIS) provides an effective and manageable approach for candidates prone to being very nervous during interviews, yet, the major anxiety-inducing elements remain unknown. During an interview, the anxiety levels, overall experience, and performance of interviewees might be affected by various circumstances. By analyzing electrodermal activity and questionnaire, we investigated the influence of five variables: (I) \textit{Realism}; (II) \textit{Question type}; (III) \textit{Interviewer attitude}; (IV) \textit{Timing}; and (V) \textit{Preparation}. As such, an orthogonal design $L_8(4^1 \times 2^4)$ with eight experiments ($O A_8$ matrix) was implemented, in which 19 college students took part in the experiments. Considering the anxiety, overall experience, and performance of the interviewees, results indicate that \textit{Question type} plays a major role; secondly, \textit{Realism}, \textit{Preparation}, and \textit{Interviewer attitude} all have some degree of influence; lastly, \textit{Timing} have little to no impact. Specifically, professional interview questions elicited a greater degree of anxiety than personal ones among the categories of interview questions. This work contributes to our understanding of anxiety-stimulating factors during job interviews in virtual reality and provides cues for designing future VRIS.

cs.HC↗