arXiv subjects

Yangyang Fei

Publications and source records attributed to Yangyang Fei.

7 recordsLinked to original sources

arXiv2026

Separate Control of Transient Leakage Exposure and Endpoint Leakage in Fast Transmon Gates

Leakage to noncomputational states limits the speed of single-qubit gates in weakly anharmonic transmons. Conventional pulse-shaping methods, including derivative removal by adiabatic gate (DRAG), primarily suppress the leakage remaining at the end of a gate. Here we demonstrate that endpoint leakage and the transient leakage population that accumulates during the gate represent distinct control objectives. Endpoint leakage is associated with the drive spectrum at the anharmonicity, whereas transient exposure depends on spectral weight over a finite frequency band and governs the additional leakage induced by dephasing. A spectral null at the leakage transition therefore suppresses the endpoint amplitude without necessarily reducing transient exposure. Based on this distinction, we introduce a path--endpoint separation pulse that combines transient-path shaping with a two-tone endpoint correction. For a $10$ ns $R_X(\pi/2)$ gate with an anharmonicity magnitude of $0.2$ GHz, numerical simulations show a $21\%$ reduction in transient exposure relative to cosine DRAG and a corresponding $20\%$ reduction in dephasing-induced excess leakage. The two correction tones further suppress residual leakage through the $|2\rangle$ and $|3\rangle$ channels, lowering the coherent endpoint leakage from approximately $7\times10^{-7}$ to $3\times10^{-8}$ without increasing transient exposure. These results establish transient exposure and endpoint leakage as complementary targets for the design of fast transmon gates.

quant-ph↗

arXiv2026

Raw-Curve Quantum Fingerprints: A Mahalanobis Authentication Framework with Drift Early Warning and Adversarial Detection

Quantum cloud platforms are poised to deliver powerful computing capabilities, but users have no direct means to verify which physical device executes their workload. This lack of transparency enables hardware substitution attacks, where a malicious adversary could redirect a job to a substituted or inferior processor. We present a general authentication framework that addresses this problem by constructing multi-dimensional quantum fingerprints from raw measurement data. Without any curve fitting, we directly concatenate the raw statistics of complementary experiments into a high-dimensional feature vector that preserves subtle device-specific information. A Mahalanobis nearest-neighbor classifier achieves 100\% benign authentication accuracy on three superconducting processors over a three-week chronological split. The classifier naturally yields an authentication confidence $C_{\mathrm{claimed}}$ which reveals device-specific safety margins and motivates per-device alert thresholds. We assess the framework's robustness under two distinct scenarios. Under additive isotropic Gaussian noise, $C_{\mathrm{claimed}}$ decays predictably at a rate explained by inverse covariance traces, enabling an early warning mechanism. Against white-box adversarial perturbations, the same confidence threshold detects $L_2$ targeted attacks with near-perfect success and reveals device-dependent empirical thresholds for $L_\infty$ attacks, while untargeted and sparse attacks are ineffective. The proposed framework thus unifies fingerprint extraction, drift-resilient authentication, proactive health monitoring, and adversarial defense, offering a practical step toward trustworthy quantum cloud computing.

quant-ph↗

arXiv2026

MPI-Q: A Message Communication Library for Large-Scale Classical-Quantum Heterogeneous Hybrid Distributed Computing

The classical-quantum system heterogeneity (different data characteristics, execution paradigms and synchronization mechanism etc.) renders existing distributed communication mechanisms (e.g. MPI, NCCL etc.) inadequate. This bottleneck severely impairs operational synergy and programming efficiency. Thus, the performance of hybrid applications on classical-quantum heterogeneous infrastructures is directly limited. To address these challenges, this paper proposes a message-passing library tailored for large-scale classical-quantum heterogeneous distributed computing, referred to as MPI-Q. The design centers on three mechanisms. First, it defines a heterogeneous hybrid communication domain that achieves unified management of classical and quantum processes in heterogeneous hybrid systems. Second, it uses a lightweight communication path that allows classical control nodes to send device-ready waveform data directly to quantum MonitorProcesses, avoiding unnecessary relay stages. Third, it establishes a heterogeneous hybrid synchronization mechanism to tackle the problem of timing control for multi-node quantum operations. While retaining the traditional MPI programming model, MPI-Q achieves extension toward quantum subsystems. Experiments on distributed GHZ state preparation demonstrate that this model exhibits near-linear scalability, achieving a maximum speedup of 18.76 times on 24 quantum nodes. This proves that the library can effectively support large-scale heterogeneous hybrid distributed computing applications, filling the technical gap in this field.

cs.DC↗

arXiv2026

Tunable Nonlocal $ZZ$ Interaction for Remote Controlled-Z Gates Between Distributed Fixed-Frequency Qubits

Scaling superconducting quantum processors toward fault-tolerant operation will likely require architectures that extend beyond monolithic chips. Modular processors connected by low-loss superconducting links provide a promising route, but implementing entangling gates between remote fixed-frequency qubits remains challenging. Here we propose a distributed architecture in which two synchronously controlled double-transmon couplers mediate the interaction between fixed-frequency transmons in separate packages connected by a 25-cm coaxial cable. The scheme activates a tunable nonlocal $ZZ$ interaction on demand while suppressing residual static coupling, allowing the superconducting link to function as a gate-native interconnect rather than solely as a state-transfer channel. Circuit-level simulations show an on/off ratio exceeding $10^6$ and a remote controlled-Z gate with a projected coherent fidelity of $99.99\%$ under experimentally relevant parameters. Open-system simulations further indicate that, within the representative Markovian noise model considered here, endpoint-qubit decoherence is the largest contribution to gate infidelity, while photon loss in the retained cable modes remains smaller but non-negligible. These results identify DTC-mediated tunable nonlocal coupling as a promising gate primitive for modular superconducting processors based on fixed-frequency qubits.

quant-ph↗

arXiv2025

Generalized Repetition Codes and Their Application to HARQ

The inherent uncertainty of communication channels implies that any coding scheme has a non-zero probability of failing to correct errors, making retransmission mechanisms essential. To ensure message reliability and integrity, a dual-layer redundancy framework is typically employed: error correction codes mitigate noise-induced impairments at the physical layer, while cyclic redundancy checks verify message integrity after decoding. Retransmission is initiated if verification fails. This operational model can be categorized into two types of repeated communication models: Type-I systems repeatedly transmit identical codewords, whereas Type-II systems transmit distinct coded representations of the same message. The core challenge lies in maximizing the probability of correct message decoding within a limited number of transmission rounds through verification-based feedback mechanisms. In this paper, we consider a scenario where the same error-correcting code is used for repeated transmissions, and we specifically propose two classes of generalized repetition codes (GRCs), corresponding to the two repeated communication models. In contrast to classical theory, we regard GRCs as error-correcting codes under multiple metrics--that is, GRCs possess multiple minimum distances. This design enables GRCs to perform multi-round error correction under different metrics, achieving stronger error-correction capabilities than classical error-correcting codes. However, the special structure of GRCs makes their construction more challenging, as it requires simultaneously optimizing multiple minimum distances. To address this, we separately investigate the bounds and constructions for Type-I and Type-II GRCs, and obtain numerous optimal Type-I and Type-II GRCs.

cs.IT↗

arXiv2025

Time-frequency-correlated Native CCZ Gate in Superconducting Circuits

Practical quantum advantage hinges on executing deep quantum circuits within the coherence limits of noisy intermediate-scale quantum processors. The absence of native, high-fidelity multi-qubit gates remains a major bottleneck, as their decomposition into single- and two-qubit gates leads to prohibitive depth and error overhead. Here, we propose a hardware-efficient protocol that directly implements a native controlled-controlled-Z (CCZ) gate in a tunable-coupler superconducting circuit. Our theoretical protocol activates a resonant three-qubit interaction via a time-frequency correlated virtual process, explicitly relying on the dynamic resonant exchange within the $|101\rangle \leftrightarrow |020\rangle$ transition manifold. This approach is compatible with standard tunable-coupler architectures without requiring additional control resources. Through a systematic calibration workflow combining pulse shaping and active cancellation of residual phases, we demonstrate a gate fidelity exceeding 99\% within $165\,\mathrm{ns}$ -- significantly outperforming decomposed sequences. Comprehensive error budgeting confirms that the gate performance remains robust against realistic experimental imperfections. Furthermore, we show that this scheme can be naturally extended to a continuous $\mathrm{CCPhase}(\theta)$ gate set. This work provides a direct, high-fidelity route to three-qubit entanglement, offering promising prospects for efficient execution of quantum algorithms on near-term superconducting hardware.

quant-ph↗

arXiv2022

Factoring integers with sublinear resources on a superconducting quantum processor

Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance.

quant-ph↗