arXiv subjects

Peng Duan

Publications and source records attributed to Peng Duan.

At least 19 recordsLinked to original sources

arXiv2026

Overcoming the Speed-Fidelity Trade-off in Fast CZ Gates via Cyclic Control

High-fidelity quantum gates are essential for scalable quantum computation. However, at short durations, short-timescale waveform distortions break the time-reflection symmetry of control pulses, preventing the precise closure of cyclic evolution. This mechanism renders conventional symmetric protocols intrinsically over-constrained. Conventional strategies typically rely on smoothing the pulse envelopes or embedding the interaction pulse within a longer qubit pulse to bypass short-timescale distortions, which inevitably leads to a persistent speed-fidelity trade-off. To overcome this limitation, we introduce a cyclic control strategy based on parameter-space expansion, which restores controllability by incorporating an additional degree of freedom. We experimentally demonstrate this approach in a superconducting controlled-Z gate, achieving robust suppression of coherent errors without increasing gate duration, reducing the average coherent error from 0.27% to 0.12% across multiple two-qubit gates, as validated by cross-entropy benchmarking. Our results establish a general route to fast, high-fidelity cyclic quantum gates beyond the conventional speed-fidelity trade-off.

quant-ph↗

arXiv2026

Routing Codes: High-Rate Quantum LDPC Codes with Short, Parallel Non-Local Connectivity

Quantum low-density parity-check (qLDPC) codes are promising candidates for realizing large-scale fault-tolerant quantum computing. Although many codes with favorable theoretical parameters have been developed, their practical adoption must take hardware implementability into account. For mainstream quantum platforms such as superconductors and neutral atoms, the connectivity, the length of non-local couplings, and the complexity of wiring or atom rearrangement are key factors that dictate the difficulty of hardware realization. Here, we propose a new family of qLDPC codes, termed routing codes. Within this family, we find explicit instances whose encoding rates are competitive to those of bivariate bicycle (BB) codes, while systematically reducing qubit connectivity, shortening the length of non-local couplings, and, crucially, making all non-local couplings mutually parallel. This parallelism translates into quantifiable benefits, substantially reducing wiring crossings in superconducting multi-layer architectures and simplifying the scheduling of atom movement in neutral-atom arrays. The weight-7 routing codes maintain a high threshold of 0.7\% and reduce the physical qubit overhead by approximately a factor of 8, compared to surface codes achieving a same logical error rate. Further increasing the weight to 11 yields a [[200, 24, 14]] and [[200, 16, 17]] codes with an encoding rate over 23 times that of the surface code, at the cost of a higher logical error rate. These results establish routing codes as a hardware-centric qLDPC family that bridges the gap between theoretical optimality and near-term physical feasibility.

quant-ph↗

arXiv2026

DFPF-Net: Dynamically Focused Progressive Fusion Network for Remote Sensing Change Detection

Change detection (CD) has extensive applications and is a crucial method for identifying and localizing target changes. In recent years, various CD methods represented by convolutional neural network (CNN) and transformer have achieved significant success in effectively detecting difference areas in bi-temporal remote sensing images. However, CNN still exhibit limitations in local feature extraction when confronted with pseudo changes caused by different object types across global scales. Although transformers can effectively detect true change regions due to their long-range dependencies, the shadows cast by buildings under varying lighting conditions can introduce localized noise in these areas. To address these challenges, we propose the dynamically focused progressive fusion network (DFPF-Net) to simultaneously tackle global and local noise influences. On one hand, we utilize a pyramid vision transformer (PVT) as a weight-shared siamese network to implement change detection, efficiently fusing multi-level features extracted from the pyramid structure through a residual based progressive enhanced fusion module (PEFM). On the other hand, we propose the dynamic change focus module (DCFM), which employs attention mechanisms and edge detection algorithms to mitigate noise interference across varying ranges. Extensive experiments on four datasets demonstrate that DFPF-Net outperforms mainstream CD methods.

eess.IV↗

arXiv2025

Single-Step Phase-Engineered Pulse for Active Readout Cavity Reset in Superconducting Circuits

In a circuit QED architecture, we experimentally demonstrate a hardware-efficient and qubit-state-dependent Single-Step Phase-Engineered (SSPE) pulse scheme for actively depopulating a readout cavity. The protocol appends a reset segment with tailored amplitude and phase to a standard square readout pulse. Within the linear-response regime, the optimal reset amplitude scales proportionally with the readout amplitude, while the optimal reset phase remains invariant, significantly simplifying the experimental calibration procedure. Time-resolved measurements of the cavity photon number dynamics demonstrate that the SSPE scheme significantly outperforms the CLEAR protocol in terms of reset speed. Crucially, this approach enables arbitrarily fast, overshoot-free depletion of the cavity photon population, with the ultimate reset rate constrained by the finite analog bandwidth of the measurement chain. Furthermore, a comprehensive evaluation of the QND nature demonstrates that the SSPE scheme introduces no additional non-QND measurement errors. It exhibits non-QNDness comparable to both the free-decay and CLEAR protocols, with residual errors predominantly governed by state switching induced by qubit relaxation during the readout process. Thses results establish the SSPE scheme as a practical and scalable approach for achieving rapid and smooth cavity reset in superconducting quantum circuits.

quant-ph↗

arXiv2025

Inverse designed Hamiltonians for perfect state transfer and remote entanglement generation, and applications in superconducting qubits

Hamiltonian inverse engineering enables the design of protocols for specific quantum evolutions or target state preparation. Perfect state transfer (PST) and remote entanglement generation are notable examples, as they serve as key primitives in quantum information processing. However, Hamiltonians obtained through conventional methods often lack robustness against noise. Assisted by inverse engineering, we begin with a noise-resilient energy spectrum and construct a class of Hamiltonians, referred to as the dome model, that significantly improves the system's robustness against noise, as confirmed by numerical simulations. This model introduces a tunable parameter $m$ that modifies the energy-level spacing and gives rise to a well-structured Hamiltonian. It reduces to the conventional PST model at $m=0$ and simplifies to a SWAP model involving only two end qubits in the large-$m$ regime. To address the challenge of scalability, we propose a cascaded strategy that divides long-distance PST into multiple consecutive PST steps. Our work is particularly suited for demonstration on superconducting qubits with tunable couplers, which enable rapid and flexible Hamiltonian engineering, thereby advancing the experimental potential of robust and scalable quantum information processing.

quant-ph↗

arXiv2025

Spectator Leakage Suppression via Invariant Subspace Engineering for CZ Gates in Superconducting Quantum Circuits

Spectator leakage poses a fundamental challenge to scalable quantum computing, particularly as frequency collisions become unavoidable in multi-qubit processors. We introduce a leakage mitigation strategy based on dynamically reshaping the system Hamiltonian. Our technique utilizes a tunable coupler to enforce a block-diagonal structure on the effective Hamiltonian governing near-resonant spectator interactions, confining the gate dynamics to a two-dimensional invariant subspace and thus preventing leakage by construction. On a multi-qubit superconducting processor, we experimentally demonstrate that this dynamic control scheme suppresses leakage rates to the order of $10^{-4}$, across a wide near-resonant detuning range and with up to three simultaneous spectator qubits. These results demonstrate a robust and scalable method that resolves the critical trade-off between dense frequency packing and high-fidelity gate operation. Our work establishes dynamic Hamiltonian engineering as an essential technology for building fault-tolerant quantum computers.

quant-ph↗

arXiv2025

Remote entanglement generation via enhanced quantum state transfer

Achieving robust and scalable remote quantum entanglement is a fundamental challenge for the development of distributed quantum networks and modular quantum computing systems. Along this, perfect state transfer (PST) and fractional state transfer (FST) have emerged as promising schemes for quantum state transfer and remote entanglement generation using only nearest-neighbor couplings. However, the current implementations suffer from quantum loss and limited parameter tunability. In this work, we propose a new quantum state transfer scheme based on a zig-zag configuration, which introduces a controlling parameter for PST and FST. We show that this new parameter can suppress the population in the intermediate qubits, thereby reducing losses. We experimentally demonstrate the dynamics of different configurations on a superconducting quantum processor, achieving an $18\%$ reduction in error for remote Bell state generation in a 1D ($1\times5$) qubit chain, and exhibit robustness against certain types of noise. Then we extend our approach to a 2D network, successfully generating a W state among the four corner qubits. These results highlight the potential of our enhanced quantum state transfer scheme for scalable and noise-resilient quantum communication and computing.

quant-ph↗

arXiv2025

Experimental robustness benchmarking of quantum neural networks on a superconducting quantum processor

Quantum machine learning (QML) models, like their classical counterparts, are vulnerable to adversarial attacks, hindering their secure deployment. Here, we report the first systematic experimental robustness benchmark for 20-qubit quantum neural network (QNN) classifiers executed on a superconducting processor. Our benchmarking framework features an efficient adversarial attack algorithm designed for QNNs, enabling quantitative characterization of adversarial robustness and robustness bounds. From our analysis, we verify that adversarial training reduces sensitivity to targeted perturbations by regularizing input gradients, significantly enhancing QNN's robustness. Additionally, our analysis reveals that QNNs exhibit superior adversarial robustness compared to classical neural networks, an advantage attributed to inherent quantum noise. Furthermore, the empirical upper bound extracted from our attack experiments shows a minimal deviation ($3 \times 10^{-3}$) from the theoretical lower bound, providing strong experimental confirmation of the attack's effectiveness and the tightness of fidelity-based robustness bounds. This work establishes a critical experimental framework for assessing and improving quantum adversarial robustness, paving the way for secure and reliable QML applications.

quant-ph↗

arXiv2025

Demonstrating Coherent Quantum Routers for Bucket-Brigade Quantum Random Access Memory on a Superconducting Processor

Quantum routers (QRouters) are essential components of bucket-brigade quantum random access memory (QRAM), enabling quantum applications such as Grover's search and quantum machine learning. Despite significant theoretical advances, achieving scalable and coherent QRouters experimentally remains challenging. Here, we demonstrate coherent quantum routers using a superconducting quantum processor, laying a practical foundation for scalable QRAM systems. The quantum router at the core of our implementation utilizes the transition composite gate (TCG) scheme, wherein auxiliary energy levels temporarily mediate conditional interactions, substantially reducing circuit depth compared to traditional gate decompositions. Moreover, by encoding routing addresses in the non-adjacent qutrit states $|0\rangle$ and $|2\rangle$, our design inherently enables eraser-detection capability, providing efficient post-selection to mitigate routing errors. Experimentally, we achieve individual QRouter fidelities up to 95.74%, and validate scalability through a two-layer quantum routing network achieving an average fidelity of 82.40%. Our results represent a significant advancement in quantum routing technology, providing enhanced fidelity, built-in error resilience, and practical scalability crucial for the development of future QRAM and large-scale quantum computing architectures.

quant-ph↗

arXiv2024

Realizing Scalable Conditional Operations through Auxiliary Energy Levels

In the noisy intermediate-scale quantum (NISQ) era, flexible quantum operations are essential for advancing large-scale quantum computing, as they enable shorter circuits that mitigate decoherence and reduce gate errors. However, the complex control of quantum interactions poses significant experimental challenges that limit scalability. Here, we propose a transition composite gate scheme based on transition pathway engineering, which digitally implements conditional operations with reduced complexity by leveraging auxiliary energy levels. Experimentally, we demonstrate the controlled-unitary (CU) family and its applications. In entangled state preparation, our CU gate reduces the circuit depth for three-qubit Greenberger-Horne-Zeilinger (GHZ) and W states by approximately 40-44% compared to circuits using only CZ gates, leading to fidelity improvements of 1.5% and 4.2%, respectively. Furthermore, with a 72% reduction in circuit depth, we successfully implement a quantum comparator-a fundamental building block for quantum algorithms requiring conditional logic, which has remained experimentally challenging due to its inherent circuit complexity. These results demonstrate the scalability and practicality of our scheme, laying a solid foundation for the implementation of large-scale quantum algorithms in future quantum processors.

quant-ph↗

arXiv2024

Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers

Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD) by leveraging quantum algorithms for higher efficiency. This paper introduces a comprehensive QCFD method, including an iterative method "Iterative-QLS" that suppresses error in quantum linear solver, and a subspace method to scale the solution to a larger size. We implement our method on a superconducting quantum computer, demonstrating successful simulations of steady Poiseuille flow and unsteady acoustic wave propagation. The Poiseuille flow simulation achieved a relative error of less than $0.2\%$, and the unsteady acoustic wave simulation solved a 5043-dimensional matrix. We emphasize the utilization of the quantum-classical hybrid approach in applications of near-term quantum computers. By adapting to quantum hardware constraints and offering scalable solutions for large-scale CFD problems, our method paves the way for practical applications of near-term quantum computers in computational science.

physics.comp-ph↗

arXiv2024

Demonstrating a universal logical gate set in error-detecting surface codes on a superconducting quantum processor

Fault-tolerant quantum computing (FTQC) is essential for achieving large-scale practical quantum computation. Implementing arbitrary FTQC requires the execution of a universal gate set on logical qubits, which is highly challenging. Particularly, in the superconducting system, two-qubit gates on surface code logical qubits have not been realized. Here, we experimentally implement a logical CNOT gate along with arbitrary single-qubit rotation gates on distance-2 surface codes using the superconducting quantum processor \textit{Wukong}, thereby demonstrating a universal logical gate set. In the experiment, we demonstrate the transversal CNOT gate on a two-dimensional topological processor based on a tailored encoding circuit, at the cost of removing the ancilla qubits required for stabilizer measurements. Furthermore, we fault-tolerantly prepare logical Bell states and observe a violation of CHSH inequality, confirming the entanglement between logical qubits. Using the logical CNOT gate and an ancilla logical state, arbitrary single-qubit rotation gates are realized through gate teleportation. All logical gates are characterized on a complete state set and their fidelities are evaluated by logical Pauli transfer matrices. The demonstration of a universal logical gate set and the entangled logical states highlights significant aspects of FTQC on superconducting quantum processors.

quant-ph↗

arXiv2023

CAMEL: Physically Inspired Crosstalk-Aware Mapping and gatE scheduLing for Frequency-Tunable Quantum Chips

Crosstalk represents a formidable obstacle in quantum computing. When quantum gates are executed parallelly, the resonance of qubit frequencies can lead to residual coupling, compromising the fidelity. Existing crosstalk solutions encounter difficulties in mitigating crosstalk and decoherence when dealing with parallel two-qubit gates in frequency-tunable quantum chips. Inspired by the physical properties of frequency-tunable quantum chips, we introduce a Crosstalk-Aware Mapping and gatE Scheduling (CAMEL) approach to address these challenges. CAMEL aims to mitigate crosstalk of parallel two-qubit gates and suppress decoherence. Utilizing the features of the tunable coupler, the CAMEL approach integrates a pulse compensation method for crosstalk mitigation. Furthermore, we present a compilation framework, including two steps. Firstly, we devise a qubit mapping approach that accounts for both crosstalk and decoherence. Secondly, we introduce a gate timing scheduling approach capable of prioritizing the execution of the largest set of crosstalk-free parallel gates to shorten quantum circuit execution times. Evaluation results demonstrate the effectiveness of CAMEL in mitigating crosstalk compared to crosstalk-agnostic methods. Furthermore, in contrast to approaches serializing crosstalk gates, CAMEL successfully suppresses decoherence. Finally, CAMEL exhibits better performance over dynamic-frequency awareness in low-complexity hardware.

quant-ph↗

arXiv2023

Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms

Quantum Random Access Memory (QRAM) is a critical component for enabling data queries in superposition, which is the cornerstone of quantum algorithms. Among various QRAM architectures, the bucket-brigade model stands out due to its noise resilience. This paper presents a hardware-efficient native gate set {iSCZ, C-iSCZ} for implementing bucket-brigade QRAM on superconducting platforms. The experimental feasibility of the proposed gate set is demonstrated, showing high fidelity and reduced complexity. By leveraging the complementary control property in QRAM, our approach directly substitutes the conventional {SWAP, CSWAP} gates with the new gate set, eliminating decomposition overhead and significantly reducing circuit depth and gate count.

quant-ph↗

arXiv2023

Experimental Implementation of Short-Path Non-adiabatic Geometric Gates in a Superconducting Circuit

The non-adiabatic geometric quantum computation (NGQC) has attracted a lot of attention for noise-resilient quantum control. However, previous implementations of NGQC require long evolution paths that make them more vulnerable to incoherent errors than their dynamical counterparts.In this work, we experimentally realize a universal short-path non-adiabatic geometric gate set (SPNGQC) with a 2-times shorter evolution path on a superconducting quantum processor. Characterizing with both quantum process tomography and randomized benchmarking methods, we report an average single-qubit gate fidelity of 99.86% and a two-qubit gate fidelity of 97.9%. Additionally, we demonstrate superior robustness of single-qubit SP-NGQC gate to Rabi frequency error in some certain parameter space by comparing their performance to those of the dynamical gates and the former NGQC gates.

quant-ph↗

arXiv2021

Experimental Determination of Multi-Qubit Ground State via a Cluster Mean-Field Algorithm

A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over its environment cluster. The products of eigenstates from different clusters construct a compressed Hilbert space, in which an effective Hamiltonian is diagonalized to determine certain eigenstates of the whole Hamiltonian. The CMF method is numerically verified in multi-spin chains and experimentally studied in a fully-connected three-spin network, both yielding an excellent prediction of their ground states.

quant-ph↗

arXiv2021

Quantify the Non-Markovian Process with Intervening Projections in a Superconducting Processor

A Markov assumption considers a physical system memoryless to simplify its dynamics. Whereas memory effect or the non-Markovian phenomenon is more general in nature. In the quantum regime, it is challenging to define or quantify the non-Markovianity because the measurement of a quantum system often interferes with it. We simulate the open quantum dynamics in a superconducting processor, then characterize and quantify the non-Markovian process. With the complete set of intervening projections and the final measurement of the qubit, a restricted process tensor can be determined to account for the qubit-environment interaction. We apply the process tensor to predict the quantum state with memory effect, yielding an average fidelity of $99.86\%\pm 1.1\unicode{x2030}$. We further derive the Choi state of the rest process conditioned on history operations and quantify the non-Markovianity with a clear operational interpretation.

quant-ph↗

arXiv2021

Experimental Determination of Electronic States via Digitized Shortcut-to-Adiabaticity and Sequential Digitized Adiabaticity

A combination of the digitized shortcut-to-adiabaticity (STA) and the sequential digitized adiabaticity is implemented in a superconducting quantum device to determine electronic states in two example systems, the H2 molecule and the topological Bernevig-Hughes-Zhang (BHZ) model. For H2, a short internuclear distance is chosen as a starting point, at which the ground and excited states are obtained via the digitized STA. From this starting point, a sequence of internuclear distances is built. The eigenstates at each distance are sequentially determined from those at the previous distance via the digitized adiabaticity, leading to the potential energy landscapes of H2. The same approach is applied to the BHZ model, and the valence and conduction bands are excellently obtained along the X-Γ-X linecut of the first Brillouin zone. Furthermore, a numerical simulation of this method is performed to successfully extract the ground states of hydrogen chains with the lengths of 3 to 6 atoms.

quant-ph↗