SearcharxivSearch

arXiv subjects

Hao Zhan

Publications and source records attributed to Hao Zhan.

14 recordsLinked to original sources

CompassDPO: Dynamics-Controlled Direct Preference Optimization for Robust Safety Alignment

Direct Preference Optimization (DPO) has become a standard framework for safety alignment, but its reliance on pairwise preference updates makes training sensitive to imperfect supervision. Existing robust DPO methods often address this sensitivity through global loss corrections or external data-level interventions, while largely overlooking how unreliable comparisons distort batch-level optimization dynamics. We propose CompassDPO, a reward-free DPO framework that stabilizes preference optimization through dynamics control. Using the implicit DPO reward margin as a training-time compass, CompassDPO regulates sample influence along two complementary axes: update direction and update magnitude. For directional control, it applies sparse, budgeted, and warm-up delayed loss mixing to attenuate update components that conflict with the emerging preference direction. For magnitude control, it adaptively soft-winsorizes high-loss tail contributions, reducing tail dominance while preserving useful gradients from hard examples. Both mechanisms use only signals available during standard DPO training and require no external reward model or additional supervision. Experiments on PKU-SafeRLHF across four backbones and multiple out-of-distribution safety benchmarks show that CompassDPO consistently improves robustness over vanilla DPO and strong DPO-family baselines, especially under controlled label-flip noise. Code is available at https://anonymous.4open.science/r/CompassDPO-4D00

cs.LG

CLEAR: Null-Space Projection for Cross-Modal De-Redundancy in Multimodal Recommendation

Multimodal recommendation has emerged as an effective paradigm for enhancing collaborative filtering by incorporating heterogeneous content modalities. Existing multimodal recommenders predominantly focus on reinforcing cross-modal consistency to facilitate multimodal fusion. However, we observe that multimodal representations often exhibit substantial cross-modal redundancy, where dominant shared components overlap across modalities. Such redundancy can limit the effective utilization of complementary information, explaining why incorporating additional modalities does not always yield performance improvements. In this work, we propose CLEAR, a lightweight and plug-and-play cross-modal de-redundancy approach for multimodal recommendation. Rather than enforcing stronger cross-modal alignment, CLEAR explicitly characterizes the redundant shared subspace across modalities by modeling cross-modal covariance between visual and textual representations. By identifying dominant shared directions via singular value decomposition and projecting multimodal features onto the complementary null space, CLEAR reshapes the multimodal representation space by suppressing redundant cross-modal components while preserving modality-specific information. This subspace-level projection implicitly regulates representation learning dynamics, preventing the model from repeatedly amplifying redundant shared semantics during training. Notably, CLEAR can be seamlessly integrated into existing multimodal recommenders without modifying their architectures or training objectives. Extensive experiments on three public benchmark datasets demonstrate that explicitly reducing cross-modal redundancy consistently improves recommendation performance across a wide range of multimodal recommendation models.

cs.IR

Machine learning of quantum data using optimal similarity measurements

Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sample-optimal, hardware-efficient protocol for estimating quantum similarity -- the state overlap -- using bosonic quantum interference. The sample complexity of this approach is independent of the system dimension and is information-theoretically optimal up to a constant factor. Experimentally, we implement the scheme on \emph{Prakash-1}, a quantum computing platform based on a fully programmable integrated photonic processor. By preparing and interfering qudit states on the chip to directly extract their overlap, we demonstrate classification and online learning of quantum data with high accuracy in realistic noisy experiments. Our results establish joint overlap measurements as a scalable pathway to efficient quantum data analysis and a practical building block for network-integrated quantum machine learning.

quant-ph

Experimental Efficient Influence Sampling of Quantum Processes

Characterizing quantum processes is essential for unlocking the potential of quantum devices. However, standard quantum process tomography is resource-intensive and becomes infeasible on large-scale systems. Despite alternative approaches have been successfully developed for specific scenarios, they typically rely on multi-qubit gates or extensive prior knowledge, limiting their practicability and scalability. To address these challenges and complement existing approaches, we introduce $\textit{influence sampling}$, an efficient and scalable protocol that quantifies the $\textit{influence}$ of a quantum process on all qubit subsets using only single-qubit test gates, with sample complexity independent of system size. Using a photonic platform, we demonstrate influence sampling to identify high-influence qubits, reduce the full process to a smaller effective process, i.e., a junta approximation, and then learn it. We further confirm scalability by applying the protocol to a 24-qubit system and validate the junta approximation on a two-qubit process. These results establish influence sampling as a critical characterization technique, facilitating process learning and device assessment.

quant-ph

SF-Recon: Simplification-Free Lightweight Building Reconstruction via 3D Gaussian Splatting

Lightweight building surface models are crucial for digital city, navigation, and fast geospatial analytics, yet conventional multi-view geometry pipelines remain cumbersome and quality-sensitive due to their reliance on dense reconstruction, meshing, and subsequent simplification. This work presents SF-Recon, a method that directly reconstructs lightweight building surfaces from multi-view images without post-hoc mesh simplification. We first train an initial 3D Gaussian Splatting (3DGS) field to obtain a view-consistent representation. Building structure is then distilled by a normal-gradient-guided Gaussian optimization that selects primitives aligned with roof and wall boundaries, followed by multi-view edge-consistency pruning to enhance structural sharpness and suppress non-structural artifacts without external supervision. Finally, a multi-view depth-constrained Delaunay triangulation converts the structured Gaussian field into a lightweight, structurally faithful building mesh. Based on a proposed SF dataset, the experimental results demonstrate that our SF-Recon can directly reconstruct lightweight building models from multi-view imagery, achieving substantially fewer faces and vertices while maintaining computational efficiency. Website:https://lzh282140127-cell.github.io/SF-Recon-project/

cs.CV

Unveiling Hierarchical Invariants in Multiphoton Linear Optics

Linear optical networks driven by quantum states of light are important building blocks of photonic quantum technologies. They access large bosonic Hilbert spaces through multiphoton interference. At the same time, their dynamics are generated by single-particle mode transformations, thereby defining a highly structured subset of multiphoton unitaries and setting boundary on linear optics capability. To elucidate this boundary, we reveal an underlying fine-grained symmetry structure that partitions the multiphoton operator space into invariant subspaces and generates a hierarchy of invariants. We experimentally confirm the conservation of high-order invariants and demonstrate their operational utility in characterizing state reachability and the metrological capability of multiphoton probes. Our framework provides a symmetry-based perspective for understanding and harnessing structured multiphoton dynamics across photonic quantum technologies.

quant-ph

Variational Graphical Quantum Error Correction Codes

Quantum error correction is essential for achieving fault-tolerant quantum computation. However, most typical quantum error-correcting codes are designed for generic noise models, which may fail to accurately capture the intricate noise characteristics of real quantum devices, limiting their practical performance. This work introduces a learning-based framework for the constructing of quantum error-correcting codes, termed Variational Graphical Quantum Error Correction (VGQEC) codes, which adapts to specific noise profiles of different quantum devices, enabling the design of noise-tailored codes. Specifically, inspired by Quon, a graphical language for quantum information, VGQEC codes incorporate tunable parameters embedded within their Quon graphs, allowing dynamic reconfigurations of the graph structures through parameter adjustments. As the first application of this approach, we show that this flexibility in code designs facilitates seamless transitions between various code families, exemplified by the establishment of a bridge between the five-qubit repetition code and the [[5,1,3]] code, thereby combining their respective advantages. Additionally, a VGQEC code derived from the three-qubit repetition code is fine-tuned for the amplitude damping noise, showcasing the approach's ability for noise-specific code design. Moreover, we experimentally demonstrate the effectiveness of the three-qubit VGQEC code in the low-to-medium noise regime with a photonic system, highlighting its potential for real-world applications.

quant-ph

Experimental benchmarking of quantum state overlap estimation strategies with photonic systems

Accurately estimating the overlap between quantum states is a fundamental task in quantum information processing. While various strategies using distinct quantum measurements have been proposed for overlap estimation, the lack of experimental benchmarks on estimation precision limits strategy selection in different situations. Here we compare the performance of four practical strategies for overlap estimation, including tomography-tomography, tomography-projection, Schur collective measurement and optical swap test using photonic quantum systems. We encode the quantum states on the polarization and path degrees of freedom of single photons. The corresponding measurements are performed by photon detection on certain modes following single-photon mode transformation or two-photon interference. We further propose an adaptive strategy with optimized precision in full-range overlap estimation. Our results shed new light on extracting the parameter of interest from quantum systems, prompting the design of efficient quantum protocols.

quant-ph

Boosting Photon-Number-Resolved Detection Rates of Transition-Edge Sensors by Machine Learning

Transition-Edge Sensors (TESs) are very effective photon-number-resolving (PNR) detectors that have enabled many photonic quantum technologies. However, their relatively slow thermal recovery time severely limits their operation rate in experimental scenarios compared to leading non-PNR detectors. In this work, we develop an algorithmic approach that enables TESs to detect and accurately classify photon pulses without waiting for a full recovery time between detection events. We propose two machine-learning-based signal processing methods: one supervised learning method and one unsupervised clustering method. By benchmarking against data obtained using coherent states and squeezed states, we show that the methods extend the TES operation rate to 800 kHz, achieving at least a four-fold improvement, whilst maintaining accurate photon-number assignment up to at least five photons. Our algorithms will find utility in applications where high rates of PNR detection are required and in technologies which demand fast active feed-forward of PNR detection outcomes.

quant-ph

Resource-efficient Direct Characterization of General Density Matrix

Sequential weak measurements allow the direct extraction of individual density-matrix elements instead of globally reconstructing the whole density matrix, opening a new avenue for the characterization of quantum systems. Nevertheless, the requirement of multiple coupling for each qudit of quantum systems and the lack of appropriate precision evaluation constraint its applicability extension, especially for multi-qudit quantum systems. Here, we propose a resource-efficient scheme (RES) to directly characterize the density matrix of general multi-qudit systems, which not only optimizes the measurements but also establishes a feasible estimation analysis. In this scheme, an efficient observable of quantum system is constructed such that a single meter state coupled to each qudit is sufficient to extract the corresponding density-matrix element. An appropriate model based on the statistical distribution of errors are used to evaluate the precision and feasibility of the scheme. We experimentally apply the RES to the direct characterization of general single-photon qutrit states and two-photon entangled states. The results show that the RES outperforms the sequential schemes in terms of efficiency and precision in both weak- and strong- coupling scenarios. This work sheds new light on the practical characterization of large-scale quantum systems and investigation of their non-classical properties.

quant-ph

Involutive Commutative Residuated Lattice without Unit: Logics and Decidability

We investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the Genzten-style sequent calculus of it is presented. Moreover, we prove the decidability of this logic.

math.LO

Quantum verification of NP problems with single photons and linear optics

Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the satisfiability of potentially conflict constraints (SAT). According to the well-founded exponential time hypothesis, verifying an SAT instance of size $n$ requires generally the complete solution in an $O(n)$-bit proof. In contrast, quantum verification algorithms, which encode the solution into quantum bits rather than classical bit strings, can perform the verification task with quadratically reduced information about the solution in $\tilde{O}(\sqrt{n})$ qubits. Here we realize the quantum verification machine of SAT with single photons and linear optics. By using tunable optical setups, we efficiently verify satisfiable and unsatisfiable SAT instances and achieve a clear completeness-soundness gap even in the presence of experimental imperfections. The protocol requires only unentangled photons, linear operations on multiple modes and at most two-photon joint measurements. These features make the protocol suitable for photonic realization and scalable to large problem sizes. Our results open an essentially new route towards quantum advantages and extend the computational capability of optical quantum computing.

quant-ph

The Controllability of Planning, Responsibility, and Security in Automatic Driving Technology

People hope automated driving technology is always in a stable and controllable state; specifically, it can be divided into controllable planning, controllable responsibility, and controllable information. When this controllability is undermined, it brings about the problems, e.g., trolley dilemma, responsibility attribution, information leakage, and security. This article discusses these three types of issues separately and clarifies the misunderstandings.

cs.AI

Controllable Planning, Responsibility, and Information in Automatic Driving Technology

People hope automated driving technology should be always in a stable and controllable state, accurately, which can be divided into controllable planning, responsibility, and information. Otherwise, it would bring about the problems of tram dilemma, responsibility attribution, information leakage, and security. This article discusses these three types of issues separately and clarifies some misunderstandings.

cs.CY