SearcharxivSearch

arXiv subjects

Younghun Kim

Publications and source records attributed to Younghun Kim.

16 recordsLinked to original sources

Safety-Aligned Weights Are Not Enough: Refusal-Teacher-Guided Finetuning Enhances Safety and Downstream Performance under Harmful Finetuning Attacks

While Finetuning-as-a-Service (FaaS) enables customization of Large Language Models (LLMs) using user data, this service is vulnerable to safety degradation when user data includes harmful prompts, a threat known as harmful finetuning attacks. To defend against this, prior work first constructs safety-aligned LLM and then finetunes the LLM on user data. However, we observe that the safety-aligned weights provide weak initialization for downstream task learning, leading to suboptimal safety and utility. Motivated by this limitation, we shift the safe FaaS finetuning paradigm from finetuning safety-aligned weights to finetuning base weights under explicit safety-teacher guidance. Specifically, we propose a Refusal-Teacher (Ref-Teacher)-guided finetuning framework. Our approach directly finetunes the base LLM under the guidance of a safety-aligned Ref-Teacher, which filters harmful prompts from user data and distills safety into the base LLM during finetuning. Extensive experiments demonstrate that our paradigm effectively reduces harmful outputs while improving finetuning performance on user-specific tasks.

cs.CL

Detecting AI-Generated Videos with Spiking Neural Networks

Modern AI-generated videos are photorealistic at the single-frame level, leaving inter-frame dynamics as the main remaining axis for detection. Existing detectors typically handle this temporal evidence in three ways: feeding the full frame sequence to a generic temporal backbone, reducing one dominant temporal cue to fixed video-level descriptors, or comparing temporal features to real-video statistics through a detection metric. These strategies degrade sharply under cross-generator evaluation, where artifact type and timescale vary across generators. On caption-paired benchmark, GenVidBench, we identify two signatures that prior detectors do not jointly exploit: AI-generated videos exhibit smoother frame-to-frame temporal residuals at the pixel level, and more compact trajectories in the semantic feature space, indicating a temporal smoothness gap at both levels. We further observe that, when raw video is fed into a Spiking Neural Networks (SNNs), fake clips elicit firing predominantly at object and motion boundaries, unlike real clips, suggesting that the SNN responds to temporal artifacts localized at edges. These cues are sparse, asynchronous, and concentrated at moments of change, which makes SNNs a natural choice for this task: their event-driven, sparsely-activated dynamics align with the structure of the residual signal in a way that dense ANN backbones do not. Building on this observation, we propose MAST, a detector that processes multi-channel temporal residuals with a spike-driven temporal branch alongside a frozen semantic encoder for cross-generator generalization. On the GenVideo benchmark, MAST achieves 93.14\% mean accuracy across 10 unseen generators under strict cross-generator evaluation, matching or surpassing the strongest ANN-based detectors and demonstrating the practical applicability of SNNs to AI-generated video detection.

cs.CV

LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density

Long-lived logical qubits are essential for fault-tolerant quantum computation. However, the practical performance of traditional error correction protocols relies on performing specific syndrome circuits, causing vulnerability to hardware defects and imposing rigid connectivity constraints. Recent theoretical findings have proposed that flexible subroutine circuits within the LUCI framework can maintain space-time distance in the presence of isolated or broken components, albeit at the expense of temporal distance. However, these approaches have solely targeted defect avoidance and have not yet been demonstrated to suppress errors with reduced temporal distances on physical hardware. In this work, we propose a reset-free scenario for the LUCI framework and experimentally benchmark it on IBM quantum hardware. By asymmetrically scaling the $X$ or $Z$ distance, we compare our reset-free approach against the standard surface code and successfully demonstrate error suppression ratios for targeted logical Pauli errors. Remarkably, despite a nearly halved syndrome density in time, which requires two subroutine rounds for full syndrome extraction, the LUCI framework remains competitive with the rotated surface code implementation. In the LUCI framework, we observe error suppression of $1.75(10)$ for logical $X$ errors and $1.93(12)$ for logical $Z$ errors, whereas the standard approach yields $ 1.58(13)$ and $2.44(7)$, respectively. These results demonstrate that dynamic codes outperform standard methods by avoiding highly noisy components, even without physical defects, while preserving logical boundaries. Our findings challenge the conventional dependency on static fault-tolerant architectures by verifying the feasibility and efficacy of the LUCI framework on physical hardware and pave the way for hybrid, hardware-compatible code designs in quantum computing.

quant-ph

EGMOF: Efficient Generation of Metal-Organic Frameworks Using a Hybrid Diffusion-Transformer Architecture

Designing materials with targeted properties remains challenging due to the vastness of chemical space and the scarcity of property-labeled data. While recent advances in generative models offer a promising way for inverse design, most approaches require large datasets and must be retrained for every new target property. Here, we introduce the EGMOF (Efficient Generation of MOFs), a hybrid diffusion-transformer framework that overcomes these limitations through a modular, descriptor-mediated workflow. EGMOF decomposes inverse design into two steps: (1) a one-dimensional diffusion model (Prop2Desc) that maps desired properties to chemically meaningful descriptors followed by (2) a transformer model (Desc2MOF) that generates structures from these descriptors. This modular hybrid design enables minimal retraining and maintains high accuracy even under small-data conditions. On a hydrogen uptake dataset, EGMOF achieved over 94% validity and 91% hit rate, representing significant improvements of up to 39% in validity and 29% in hit rate compared to existing methods, while remaining effective with only 1,000 training samples. Moreover, our model successfully performed conditional generation across 29 diverse property datasets, including CoREMOF, QMOF, and text-mined experimental datasets, whereas previous models have not. This work presents a data-efficient, generalizable approach to the inverse design of diverse MOFs and highlights the potential of modular inverse design workflows for broader materials discovery.

cond-mat.mtrl-sci

Time-Dynamic Circuits for Fault-Tolerant Shift Automorphisms in Quantum LDPC Codes

Quantum low-density parity-check (qLDPC) codes have emerged as a promising approach for realizing low-overhead logical quantum memories. Recent theoretical developments have established shift automorphisms as a fundamental building block for completing the universal set of logical gates for qLDPC codes. However, practical challenges remain because the existing SWAP-based shift automorphism yields logical error rates that are orders of magnitude higher than those for fault-tolerant idle operations. In this work, we address this issue by dynamically varying the syndrome measurement circuits to implement the shift automorphisms without reducing the circuit distance. We benchmark our approach on both twisted and untwisted weight-6 generalized toric codes, including the gross code family. Our time-dynamic circuits for shift automorphisms achieve performance comparable to the idle operations under the circuit-level noise model (SI1000). Specifically, the dynamic circuits achieve more than an order of magnitude reduction in logical error rates relative to the SWAP-based scheme for the gross code at a physical error rate of $10^{-3}$, employing the BP-OSD decoder. Our findings improve both the error resilience and the time overhead of the shift automorphisms in qLDPC codes. Furthermore, our work can lead to alternative syndrome extraction circuit designs, such as leakage removal protocols, providing a practical pathway to utilizing dynamic circuits that extend beyond surface codes towards qLDPC codes.

quant-ph

Almost fault-tolerant quantum machine learning with drastic overhead reduction

Errors in the current generation of quantum processors pose a significant challenge towards practical-scale implementations of quantum machine learning (QML) as they lead to trainability issues arising from noise-induced barren plateaus, as well as performance degradations due to the noise accumulation in deep circuits even when QML models are free from barren plateaus. Quantum error correction (QEC) protocols are being developed to overcome hardware noise, but their extremely high spacetime overheads, mainly due to magic state distillation, make them infeasible for near-term practical implementation. This work proposes the idea of partial quantum error correction (QEC) for quantum machine learning (QML) models and identifies a sweet spot where distillations are omitted to significantly reduce overhead. By assuming error-corrected two-qubit Controlled-$Z$s (Clifford operations), we demonstrate that the QML models remain trainable even when single-qubit gates are subjected to $\approx0.2\%$ depolarizing noise, corresponding to a gate error rate of $\approx0.13\%$ under randomized benchmarking. Further analysis based on various noise models, such as phase-damping and thermal-dissipation channels at low temperature, indicates that the QML models are trainable independent of the mean angle of over-rotation, or can even be improved by thermal damping that purifies a quantum state away from depolarizations. While it may take several years to build quantum processors capable of fully fault-tolerant QML, our work proposes a resource-efficient solution for trainable and high-accuracy QML implementations in noisy environments.

quant-ph

Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware

Large scale quantum circuits are required to exploit the advantages of quantum computers. Despite significant advancements in quantum hardware, scalability remains a challenge, with errors accumulating as more qubits and gates are added. To overcome this limitation, quantum error-correction codes have been introduced. Although the success of quantum error correction codes has been demonstrated on superconducting quantum processors and neutral atom-based systems, there have been no experimental reports of error suppression using flag qubits on a quantum processor. IBM's quantum hardware features a non-topological coupling map, and past developments of quantum error correction codes on this platform have primarily explored the use of flag qubits. Here, we report the successful implementation of a syndrome extraction circuit with flag qubits on IBM quantum computers. Moreover, we demonstrate its effectiveness by considering the repetition code as a test code among the quantum error-correcting codes. Even though the data qubit is not adjacent to the syndrome qubit, logical error rates diminish as the distance of the repetition code increases from three to nine. Even when two flag qubits exist between the data and syndrome qubits, the logical error rates decrease as the distance increases similarly. This confirms the successful implementation of the syndrome extraction circuit with flag qubits on the IBM quantum computer.

quant-ph

SELFI: Selective Fusion of Identity for Generalizable Deepfake Detection

Face identity provides a powerful signal for deepfake detection. Prior studies show that even when not explicitly modeled, classifiers often learn identity features implicitly. This has led to conflicting views: some suppress identity cues to reduce bias, while others rely on them as forensic evidence. To reconcile these views, we analyze two hypotheses: (1) whether face identity alone is discriminative for detecting deepfakes, and (2) whether such identity features generalize poorly across manipulation methods. Our experiments confirm that identity is informative but context-dependent. While some manipulations preserve identity-consistent artifacts, others distort identity cues and harm generalization. We argue that identity features should neither be blindly suppressed nor relied upon, but instead be explicitly modeled and adaptively controlled based on per-sample relevance. We propose \textbf{SELFI} (\textbf{SEL}ective \textbf{F}usion of \textbf{I}dentity), a generalizable detection framework that dynamically modulates identity usage. SELFI consists of: (1) a Forgery-Aware Identity Adapter (FAIA) that extracts identity embeddings from a frozen face recognition model and projects them into a forgery-relevant space via auxiliary supervision; and (2) an Identity-Aware Fusion Module (IAFM) that selectively integrates identity and visual features using a relevance-guided fusion mechanism. Experiments on four benchmarks show that SELFI improves cross-manipulation generalization, outperforming prior methods by an average of 3.1\% AUC. On the challenging DFDC dataset, SELFI exceeds the previous best by 6\%. Code will be released upon paper acceptance.

cs.CV

Quantum Computing Based Design of Multivariate Porous Materials

Multivariate (MTV) porous materials exhibit unique structural complexities based on diverse spatial arrangements of multiple building block combinations. These materials possess potential synergistic functionalities that exceed the sum of their individual components. However, the exponentially increasing design complexity of these materials poses challenges for accurate ground-state configuration prediction and design. To address this, a Hamiltonian model was developed for quantum computing that integrates compositional, structural, and balance constraints, enabling efficient optimization of the MTV configurations. The model employs a graph-based representation to encode linkers as qubits. To validate our model, a variational quantum circuit was constructed and executed using the Sampling VQE algorithm. Simulations on experimentally known MTV porous materials successfully reproduced their ground-state configurations, demonstrating the validity of our model. Furthermore, VQE calculations were performed on real quantum hardware for validation purposes, signaling a first step toward a practical quantum algorithm for the rational design of porous materials.

quant-ph

New Design of three-qubit system with three transmons and a single fixed-frequency resonator coupler

The transmon, which has a short gate time and remarkable scalability, is the most commonly utilized superconducting qubit, based on the Cooper pair box as a qubit or coupler in superconducting quantum computers. Lattice and heavy-hexagon structures are well-known large-scale configurations for transmon-based quantum computers that classical computers cannot simulate. These structures share a common feature: a resonator coupler that connects two transmon qubits. Although significant progress has been made in implementing quantum error correction and quantum computing using quantum error mitigation, fault-tolerant quantum computing remains unachieved due to the inherent vulnerability of these structures. This raises the question of whether the transmon-resonator-transmon structure is the best option for constructing a transmon-based quantum computer. To address this, we demonstrate that the average fidelity of CNOT gates can exceed 0.98 in a structure where a resonator coupler mediates the coupling of three transmon qubits. This result suggests that our novel structure could be a key method for increasing the number of connections among qubits while preserving gate performance in a transmon-based quantum computer.

quant-ph

Magic State Injection on IBM Quantum Processors Above the Distillation Threshold

The surface code family is a promising approach to implementing fault-tolerant quantum computations. Universal fault-tolerance requires error-corrected non-Clifford operations, in addition to Clifford gates, and for the former, it is imperative to experimentally demonstrate additional resources known as magic states. Another challenge is to efficiently embed surface codes into quantum hardware with connectivity constraints. This work simultaneously addresses both challenges by employing a qubit-efficient rotated heavy-hexagonal surface code for IBM quantum processors (\texttt{ibm\_fez}) and implementing the magic state injection protocol. Our work reports error thresholds for both logical bit- and phase-flip errors, of $\approx0.37\%$ and $\approx0.31\%$, respectively, which are higher than the threshold values previously reported with traditional embedding. The post-selection-based preparation of logical magic states $|H_L\rangle$ and $|T_L\rangle$ achieve fidelities of $0.8806\pm0.0002$ and $0.8665\pm0.0003$, respectively, which are both above the magic state distillation threshold. Additionally, we report the minimum fidelity among injected arbitrary single logical qubit states as $0.8356\pm0.0003$. Our work demonstrates the potential for realising non-Clifford logical gates by producing high-fidelity logical magic states on IBM quantum devices.

quant-ph

Transversal CNOT gate with multi-cycle error correction

A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that classical computers cannot accomplish within a reasonable time frame, achieving quantum advantage. However, the vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems. Quantum error correction codes such as Stabilizer codes offer a promising path forward for fault-tolerant quantum computing, however their realisation on quantum hardware is an on-going area of research. In particular, fault-tolerant quantum processing must employ logical gates on logical qubits with error suppression with realistically large size codes. This work has implemented a transversal CNOT gate between two logical qubits constructed using the Repetition code with flag qubits, and demonstrated error suppression with increasing code size under multiple rounds of error detection. By performing experiments on IBM quantum devices through cloud access, our results show that despite the potential for error propagation among logical qubits during the transversal CNOT gate operation, increasing the number of physical qubits from 21 to 39 and 57 can suppress errors, which persists over 10 rounds of error detection. Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.

quant-ph

PECI-Net: Bolus segmentation from video fluoroscopic swallowing study images using preprocessing ensemble and cascaded inference

Bolus segmentation is crucial for the automated detection of swallowing disorders in videofluoroscopic swallowing studies (VFSS). However, it is difficult for the model to accurately segment a bolus region in a VFSS image because VFSS images are translucent, have low contrast and unclear region boundaries, and lack color information. To overcome these challenges, we propose PECI-Net, a network architecture for VFSS image analysis that combines two novel techniques: the preprocessing ensemble network (PEN) and the cascaded inference network (CIN). PEN enhances the sharpness and contrast of the VFSS image by combining multiple preprocessing algorithms in a learnable way. CIN reduces ambiguity in bolus segmentation by using context from other regions through cascaded inference. Moreover, CIN prevents undesirable side effects from unreliably segmented regions by referring to the context in an asymmetric way. In experiments, PECI-Net exhibited higher performance than four recently developed baseline models, outperforming TernausNet, the best among the baseline models, by 4.54\% and the widely used UNet by 10.83\%. The results of the ablation studies confirm that CIN and PEN are effective in improving bolus segmentation performance.

cs.CV

Design of Quantum error correcting code for biased error on heavy-hexagon structure

Surface code is an error-correcting method that can be applied to the implementation of a usable quantum computer. At present, a promising candidate for a usable quantum computer is based on superconductor-specifically transmon. Because errors in transmon-based quantum computers appear biasedly as Z type errors, tailored surface and XZZX codes have been developed to deal with the type errors. Even though these surface codes have been suggested for lattice structures, since transmons-based quantum computers, developed by IBM, have a heavy-hexagon structure, it is natural to ask how tailored surface code and XZZX code can be implemented on the heavy-hexagon structure. In this study, we provide a method for implementing tailored surface code and XZZX code on a heavy-hexagon structure. Even when there is no bias, we obtain $ 0.231779 \%$ as the threshold of the tailored surface code, which is much better than $ 0.210064 \%$ and $ 0.209214 \%$ as the thresholds of the surface code and XZZX code, respectively. Furthermore, we can see that even though a decoder, which is not the best of the syndromes, is used, the thresholds of the tailored surface code and XZZX code increase as the bias of the Z error increases. Finally, we show that in the case of infinite bias, the threshold of the surface code is $ 0.264852\%$, but the thresholds of the tailored surface code and XZZX code are $ 0.296157 \% $ and $ 0.328127 \%$ respectively.

quant-ph

Time Series Using Exponential Smoothing Cells

Time series analysis is used to understand and predict dynamic processes, including evolving demands in business, weather, markets, and biological rhythms. Exponential smoothing is used in all these domains to obtain simple interpretable models of time series and to forecast future values. Despite its popularity, exponential smoothing fails dramatically in the presence of outliers, large amounts of noise, or when the underlying time series changes. We propose a flexible model for time series analysis, using exponential smoothing cells for overlapping time windows. The approach can detect and remove outliers, denoise data, fill in missing observations, and provide meaningful forecasts in challenging situations. In contrast to classic exponential smoothing, which solves a nonconvex optimization problem over the smoothing parameters and initial state, the proposed approach requires solving a single structured convex optimization problem. Recent developments in efficient convex optimization of large-scale dynamic models make the approach tractable. We illustrate new capabilities using synthetic examples, and then use the approach to analyze and forecast noisy real-world time series. Code for the approach and experiments is publicly available.

stat.ML

Ferroelectricity Driven by Twisting of Silicate Tetrahedral Chains

Conventional perovskite-type ferroelectrics are based on octahedral units of oxygen, and often comprise toxic Pb to achieve robust ferroelectricity. Here, we report the ferroelectricity in a silicate-based compound, Bi2SiO5 (BSO), induced by a structural instability of the corresponding silicate tetrahedral chains. A low-energy phonon mode condenses at ~ 673 K to induce the proper ferroelectric phase transition. Polarization switching was observed in a BSO single crystal with a coercive field of 30 kV/cm and a spontaneous polarization of 0.3 microC/cm2 along a direction normal to the cleavage plane. The in-plane polarization was estimated by first principles calculations to be 23 microC/cm2. The present findings provide a new guideline for designing ferroelectric materials based on SiO4 tetrahedral units, which is ubiquitously found in natural minerals.

cond-mat.mtrl-sci