Searcharxiv⌕ Search

arXiv subjects

Zhao-Yun Chen

Publications and source records attributed to Zhao-Yun Chen.

At least 19 recordsLinked to original sources

Rate-1/2 Quantum LDPC Codes for Multi-tier Superconducting Hardware

Quantum error correction is essential for scalable quantum computing, while its resource overhead is governed in large part by the encoding rate, namely the number of logical qubits encoded per physical data qubit. Recent quantum low-density parity-check (qLDPC) constructions have entered the ultra-high-rate regime with encoding rates above 1/2, but their syndrome-extraction circuits generally rely on reconfigurable connectivity or long-range qubit transport, making them difficult to implement on fixed-connectivity superconducting hardware. Here we introduce Armillary codes, a family of ultra-high-rate qLDPC codes whose algebraic structure is generated by native iSWAP routing under hardware constraints. The construction jointly enforces stabilizer commutation and correct parallel syndrome extraction, while admitting radial and circumferential couplings in crossing-free routing layers. We construct explicit codes with rates above 1/2, stabilizer weight 12, Tanner-graph girth 6, and distances from 12 to 16, with layouts on 5 or 6 hardware tiers. Compared with the Gross and Mitten codes at the same distances, the Armillary codes achieve encoding rates about 6 and 2.5 times those of the Gross and Mitten codes, respectively, while maintaining lower hardware-complexity scores. In circuit-level simulations, the \([\![8688,4348,16]\!]\) code approaches the teraquop regime, achieving a logical error rate of \(1.62\times10^{-12}\) per logical qubit per round at a physical error rate of 0.1\%. These results show that the rate-\(1/2\) regime of qLDPC codes can be extended from reconfigurable platforms to superconducting hardware, providing a route toward low-overhead fault-tolerant quantum processors.

quant-ph↗

Depth-reduced quantum simulation of Lindbladian dynamics via adaptive variational quantum trajectory compression

Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors, namely restricted qubit counts and noise-limited circuit depths. In this work, we propose an efficient quantum algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum $XY$ model and the interacting disordered $XXZ$ chain demonstrate the accuracy and reduced execution gate counts of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.

quant-ph↗

Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition

Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and versatile quantum functional calculus framework for simulating non-Hermitian matrix functions. By generalizing the matrix Cauchy residue theorem, CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation (LCHS) paradigm. Beyond first-order systems, the framework naturally generalizes to complex operator functions, including second-order wave dynamics and non-Hermitian special functions such as Bessel and Airy evolutions. Furthermore, CBMD systematically suppresses the asymptotic growth of non-Hermitian components, yielding a significant reduction in the required number of amplitude amplifications compared to the naive scheme of combining monomials via linear combination of unitaries (LCU) after Taylor expansion. Notably, CBMD avoids explicit dependence on matrix diagonalizability, effectively mitigating the long-standing challenges associated with ill-conditioned eigenvectors and Jordan blocks. Our work establishes a systematic matrix calculus that bridges high-performance classical numerics and fault-tolerant quantum algorithms. It should be noted that CBMD inherits standard LCU overheads, and requires the target function to have a bounded growth order on the real axis.

quant-ph↗

PyQLAS: A Quantum-Classical Hybrid Solver Library for Linear Systems

Quantum algorithms solve a linear system at a cost that grows only polylogarithmically in its dimension, but on present-day hardware that advantage is realised only if the quantum and the classical parts of a solve are apportioned deliberately. We present PyQLAS, a quantum--classical hybrid library for linear systems that exposes this apportionment as a design parameter rather than a fixed assumption. PyQLAS builds three nested solvers around a single variational core---a variational solver, an outer residual iteration, and a Krylov-subspace projection---so that the quantum subroutine can be held at a fixed circuit width while the classical host absorbs the growth of the problem. Around them, the library supplies preconditioning at two independent levels, dimension alignment, checkpointing, and device-budget control, and a solve written against the interface runs unchanged on an exact state-vector simulator, on a local sampler, and on a real superconducting processor. The library is validated on the IEEE 118-bus power flow, a standard test system in which the linear solver is embedded in a classical Newton iteration. There, the iteration converges to the specified tolerance and reproduces the classical reference solution to within $2.3\times10^{-8}$ p.u.\ in voltage magnitude and $3.4\times10^{-6}$ degrees in voltage angle.

quant-ph↗

oracq: A Modular Framework for Implementing and Analyzing Quantum Scientific Computing Algorithms

Quantum algorithms for scientific computing are specified against access models such as block-encodings, sparse oracles, state preparations, and quantum random-access memories. Their concrete realization is deliberately left open, yet it is a research variable that changes both the numerical behavior and the resource cost of the program, so every reported conclusion is attributable to one realization. In this paper, we present oracq, a Python framework that makes this choice a managed and checkable decision. Our claim is linguistic rather than infrastructural. Algorithms are stored as persistent register-level programs whose oracle slots are declared and typed but unimplemented. A separate binding pass links compatible realizations, so one stored algorithm can be re-bound to a gate network, a QRAM-backed table, or compiled reversible arithmetic and compared across them. Typed QRAM resources, a compiler from pure Python numerical formulas to reversible fixed-point circuits, and block-encoding algebra with qubitization and QSVT-style kernels supply the constructions. Two end-to-end workflows exercise the framework, a quantum finite-volume pipeline for the compressible Euler equations and a quantum homotopy-analysis pipeline that lifts nonlinear PDEs to composable linear input models. The verification methodology separates implementation error from method error, and logical resource accounts cover programs before and after binding. The framework is openly available at https://github.com/IAI-USTC-Quantum/oracq.

quant-ph↗

Classical simulation of amplitude-damped bucket-brigade quantum random access memories via predictable branch evolution

Classical simulation of quantum random access memory (QRAM) under noise can be accelerated dramatically by branch pruning: noise histories are sampled as trajectory ensembles, and good branches, whose routing paths avoid every sampled fault, need not be evolved because their final states are analytically predictable. Under amplitude damping this predictability is not automatic, because the no-jump operator $K_0$ acts on every branch at every time slice. Here we give a complete account of damping-channel predictability in bucket-brigade QRAM simulation, for both qutrit and qubit encodings. For the qutrit encoding, $K_0$ is diagonal in the node basis, and the wait state $|W\rangle$ is its fixed point, so a good branch follows the noiseless orbit up to a scalar attenuation. In the qubit encoding, phase-kickback memory fetching between two Hadamard walls makes $K_0$ no longer diagonal, yet the resulting structure is exactly solvable in closed form. Conditional on no jump, the in-branch infidelity of a good branch is second order in the damping rate $γ$, with coherent leakage $\sim n^2γ^2/4$ per data qubit, and the closed form captures it without approximation. We also revise the pruning criterion for the qubit encoding. The resulting algorithm evolves only the bad branches plus one reference branch and shares every other cost with the full evolution it replaces. It is validated by end-to-end benchmarks with pruned-over-full speedups up to $285\times$ and by trajectory-level tests confirming every closed form to machine precision.

quant-ph↗

Precision and resource scaling of real-time flux distortion compensation for superconducting quantum control

Real-time waveform generation supports dynamic quantum circuits without pre-storing complete waveforms for every execution path. However, long-lived distortions in flux-control lines degrade gate fidelity, requiring compensation to account for the actual pulse history. A frequency-domain inversion and time-domain fitting method is proposed for resource-efficient real-time flux distortion compensation. The method fits the reconstructed compensation impulse response with a compact hybrid infinite impulse response (IIR) and finite impulse response (FIR) filter. Look-ahead parallelization enables this filter to process synthesized waveforms at 1.2GSa/s on a field-programmable gate array (FPGA). Two-qubit cross-entropy benchmarking shows that real-time IIR filtering achieves a median controlled-Z Pauli fidelity close to the software-reference value of 99.57%. Numerical analysis and FPGA synthesis indicate approximately logarithmic growth in hardware resource use with compensation timescale. Extending compensation from microsecond to hundred-microsecond timescales increases look-up table (LUT) and digital signal processing (DSP) resource use by only about 14% and 4%, respectively, while maintaining a relative arithmetic error below $10^{-4}$. This work provides a scalable hardware foundation for high-fidelity flux control in dynamic superconducting quantum circuits.

quant-ph↗

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↗

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↗

Poisson-Compiled Quantum Singular Value Transformation for Power-Exponential Dissipation

We study quantum implementations of the contraction $\exp(-T H^α)$ for $H=H^\dagger\succeq0$ and $α>0$. Poisson summation provides an exact target--alias--tail decomposition whose Fourier samples are compiled classically into a single Chebyshev polynomial, so the quantum circuit uses polynomial eigenvalue transformation rather than a frequency linear combination of unitaries. We compare block encodings of $H/\norm{H}$ and of the shifted signal $2H/\norm{H}-I$. Under ordinary single-sequence QSVT, parity forces the former to use an even extension, which is entire only for even positive integers. An exact quadratic lift for the shifted signal makes every positive integer entire and improves the fixed-scale approximation error for noninteger powers from $Θ(d^{-α})$ to $Θ(d^{-2α})$ within the stated access and parity classes. We derive matching degree bounds in the large-scale fixed-error and fixed-scale high-precision limits, including the output-normalization overhead $u_r$. Nearest-neighbor Laplacians give a unit-normalized shifted signal. We further establish a noncommutative Weyl--Poisson identity compatible with LCHS quadrature, and use the same polynomial construction to implement controlled dissipative families in amplitude--phase separation.

quant-ph↗

QuantumQA: Enhancing Scientific Reasoning via Physics-Consistent Dataset and Verification-Aware Reinforcement Learning

Large language models (LLMs) show strong capabilities in general reasoning but typically lack reliability in scientific domains like quantum mechanics, which demand strict adherence to physical constraints. This limitation arises from the scarcity of verifiable training resources and the inadequacy of coarse feedback signals in standard alignment paradigms. To address the data challenge, we introduce QuantumQA, a large-scale dataset constructed via a task-adaptive strategy and a hybrid verification protocol that combines deterministic solvers with semantic auditing to guarantee scientific rigor. Building on this foundation, we propose the verification-aware reward model (VRM) tailored for Reinforcement Learning with Verifiable Rewards (RLVR), which employs an adaptive reward fusion (ARF) mechanism to dynamically integrate deterministic signals from a scientific execution suite (SES) with multidimensional semantic evaluations for precise supervision. Experimental results demonstrate that our method consistently outperforms baselines and general-purpose preference models. Notably, our optimized 8B model achieves performance competitive with proprietary models, validating that incorporating verifiable, rule-based feedback into the reinforcement learning loop offers a parameter-efficient alternative to pure scaling.

cs.AI↗

A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations

We present a unified algorithmic framework for quantum simulation of non-unitary dynamics and matrix functions, governed by the principle of spectral aliasing derived from the Poisson Summation Formula (PSF). By reinterpreting discretization errors as spectral folding in dual domains, we synthesize two distinct algorithmic paths: (i) the Fourier-PSF path, generalizing transmutation methods for time-domain filtering, which is optimal for singular and fractional dynamics $e^{-tH^α}$, here $H\succeq 0$; and (ii) the contour-PSF path, a novel discrete contour transform based on the resolvent formalism, which achieves exponential convergence for holomorphic matrix functions via radius optimization. This dual framework resolves the smoothness-sparsity trade-off: it utilizes the Fourier basis to handle branch-point singularities where analyticity fails, and the Resolvent basis to exploit complex-plane regularity where it exists. We demonstrate the versatility of this framework by efficiently simulating diverse phenomena, from fractional anomalous diffusion to high-precision solutions of stiff differential equations, outperforming existing methods in their respective optimal regimes.

quant-ph↗

Quantum Deep Learning: A Comprehensive Review

Quantum deep learning (QDL) explores the use of both quantum and quantum-inspired resources to determine when deep learning's core capabilities, such as expressivity, generalization, and scalability, can be enhanced based on specific resource constraints. Distinct from broader quantum machine learning, QDL emphasizes compositional depth at the pipeline level and the integration of quantum or quantum-inspired components within end-to-end workflows. This review provides an operational definition of QDL and introduces a taxonomy comprising four primary paradigms: hybrid quantum-classical models, quantum deep neural networks, quantum algorithms for deep learning primitives, and quantum-inspired classical algorithms. Theoretical principles are connected to advanced architectures, software toolchains, and experimental demonstrations across superconducting, trapped-ion, photonic, semiconductor spin, and neutral-atom systems, as well as quantum annealers. Claims of quantum advantage are critically assessed by distinguishing provable complexity-theoretic separations from empirical observations. The analysis characterizes trade-offs between model expressivity, trainability, and classical simulability, while systematically detailing the bottlenecks imposed by optimization landscapes, input-output access models, and hardware constraints. Applications are surveyed in domains encompassing image classification, natural language processing, scientific discovery, quantum data processing, and quantum optimal control, underscoring fair benchmarking against optimized classical counterparts and a comprehensive assessment of resource requirements. This review serves as a tutorial entry point for graduate students while guiding readers to specialized literature. It concludes with a verification-aware roadmap to transition QDL from near-term demonstrations to scalable and fault-tolerant implementations.

quant-ph↗

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↗

Quantum homotopy analysis method with quantum-compatible linearization for nonlinear partial differential equations

Nonlinear partial differential equations (PDEs) are crucial for modeling complex fluid dynamics and are foundational to many computational fluid dynamics (CFD) applications. However, solving these nonlinear PDEs is challenging due to the vast computational resources they demand, highlighting the pressing need for more efficient computational methods. Quantum computing offers a promising but technically challenging approach to solving nonlinear PDEs. Recently, Liao proposed a framework that leverages quantum computing to accelerate the solution of nonlinear PDEs based on the homotopy analysis method (HAM), a semi-analytical technique that transforms nonlinear PDEs into a series of linear PDEs. However, the no-cloning theorem in quantum computing poses a major limitation, where directly applying quantum simulation to each HAM step results in exponential complexity growth with the HAM truncation order. This study introduces a ``quantum-compatible linearization'' approach that maps the whole HAM process into a system of linear PDEs, allowing for a one-time solution using established quantum PDE solvers. Our method preserves the exponential speedup of quantum linear PDE solvers while ensuring that computational complexity increases only polynomially with the HAM truncation order. We demonstrate the efficacy of our approach by applying it to the Burgers' equation and the Korteweg-de Vries (KdV) equation. Our approach provides a novel pathway for transforming nonlinear PDEs into linear PDEs, with potential applications to fluid dynamics. This work thus lays the foundation for developing quantum algorithms capable of solving the Navier-Stokes equations, ultimately offering a promising route to accelerate their solutions using quantum computing.

quant-ph↗

Variational quantum simulation of many-body dissipative dynamics on a superconducting quantum processor

Open quantum systems host a wide range of intriguing phenomena, yet their simulation on well-controlled quantum devices is challenging, owing to the exponential growth of the Hilbert space and the inherently non-unitary nature of the dynamics. Here we propose and experimentally demonstrate a variational quantum algorithm capable of scalable simulation of non-unitary many-body dissipative dynamics. The algorithm builds on the framework of linear combination of Hamiltonian simulation, which converts non-unitary dynamics into a weighted sum of unitary evolutions. With the further introduction of a simplified quantum circuit for loss-function evaluation, our scheme is suitable for near-term quantum hardware, with the circuit depth independent of the simulation time. We illustrate our scheme by simulating the collective dynamics of a dissipative transverse Ising model, as well as an interacting Hatano-Nelson model, on the superconducting quantum processor Wukong. Our work underlines the capability of noisy intermediate-scale quantum devices in simulating dissipative many-body dynamics and represents a step forward in exploiting their potential for solving outstanding physical problems.

quant-ph↗

Data-driven Quantum Dynamical Embedding Method for Long-term Prediction on Near-term Quantum Computers

The increasing focus on long-term time series prediction across various fields has been significantly strengthened by advancements in quantum computation. In this paper, we introduce a data-driven method designed for time series prediction with quantum dynamical embedding (QDE). This approach enables a trainable embedding of the data space into an extended state space, allowing for the recursive retrieval of time series information. Based on its independence of time series length, this method achieves depth-efficient quantum circuits that are crucial for near-term quantum computers. Numerical simulations demonstrate the model's capability to predict not only wave signals but also more complex signals such as NARMA. Prediction accuracy improves with model scaling, and notably, the model achieves better accuracy on wave signal tasks with fewer parameters compared to QRC. Additionally, the model shows promising potential for denoising classical noise in wave signals, and when combined with error mitigation techniques for typical quantum noise, it enables reliable long-term prediction of wave signals. We implement this model, restricted to 2 qubits, on the Origin ``Wukong" superconducting quantum processor as a simple proof-of-concept on NISQ devices. Furthermore, we provide theoretical analysis of the QDE's dynamical properties for the 2-qubit case and discuss its potential universality. Overall, this study represents our first step towards leveraging near-term quantum devices for time series forecasting, offering insights into integrating data-driven learning with quantum dynamical embeddings.

quant-ph↗

Low-Overhead and High-Fidelity Preparation of Logical Non-Clifford States with Multi-Level Transversal Injection

Rotation gates are widely used in various quantum algorithms. To implement fault-tolerant rotation gates, state distillation or gate synthesis is typically employed. However, the overhead of these schemes scales rapidly with increasing Clifford hierarchy levels and required fidelity, limiting their use in large-scale quantum algorithms. In this letter, we propose a method termed multi-level transversal injection (MLTI) for preparing rotation states at arbitrary Clifford hierarchy levels, which achieves high fidelity while significantly reducing overhead compared to previous methods. Unlike the linear cost scaling of state distillation, the overhead of MLTI drops with Clifford hierarchy levels and then plateaus at higher levels, slashing the required space-time volume by up to several orders of magnitude. Additionally, we introduce a method for eliminating the off-diagonal terms of rotation states without extra overhead, unifying the metrics of infidelity and trace distance. These results render the overhead for high-precision rotation gates no longer prohibitive, and thus bring the broad adoption of large-scale quantum algorithms a critical step closer to reality.

quant-ph↗