arXiv subjects

Ziyue Hua

Publications and source records attributed to Ziyue Hua.

At least 19 recordsLinked to original sources

arXiv2026

Experimental realization of quantum-computing-enhanced sensing

Quantum algorithms offer computational advantages, yet incorporating them into quantum sensing and converting these advantages into enhanced information acquisition remains challenging. Here, we realize quantum-computing-enhanced sensing in a spin-oscillator architecture, where a microwave cavity provides a high-dimensional quantum register and a coupled superconducting qubit serves as the sensor. The unknown signal directly generates the phase oracle operation, establishing a natural physical interface between quantum computation and sensing. We experimentally demonstrate the first Grover search in a bosonic mode and observe quantum amplitude amplification in a Hilbert space spanning more than 128 photons. For the same number of sensing iterations, our protocol extracts more information and resolves more frequency candidates than classical sequential search. Our results establish signal-driven oracles as a route for harnessing oracle-based quantum algorithms and realizing quantum-computing-enhanced sensing.

quant-ph↗

arXiv2026

Lil: Less is Less When Applying Post-Training Sparse-Attention Algorithms in Long-Decode Stage

Large language models (LLMs) demonstrate strong capabilities across a wide range of complex tasks and are increasingly deployed at scale, placing significant demands on inference efficiency. Prior work typically decomposes inference into prefill and decode stages, with the decode stage dominating total latency. To reduce time and memory complexity in the decode stage, a line of work introduces sparse-attention algorithms. In this paper, we show, both empirically and theoretically, that sparse attention can paradoxically increase end-to-end complexity: information loss often induces significantly longer sequences, a phenomenon we term ``Less is Less'' (Lil). To mitigate the Lil problem, we propose an early-stopping algorithm that detects the threshold where information loss exceeds information gain during sparse decoding. Our early-stopping algorithm reduces token consumption by up to 90% with a marginal accuracy degradation of less than 2% across reasoning-intensive benchmarks.

cs.CL↗

arXiv2026

Experimental demonstration of entanglement pumping with bosonic logical qubits

Entanglement is crucial for quantum networks and computation, yet maintaining high-fidelity entangled quantum states is hindered by decoherence and resource-intensive purification methods. Here, we experimentally demonstrate entanglement pumping, utilizing bosonic quantum error correction (QEC) codes as long-coherence-time storage qubits. By repetitively generating entanglement with short-coherence-time qubits and injecting it into error-detectable logical qubits, our approach effectively preserves entanglement. Through error-detection to discard error states and entanglement pumping to mitigate errors within the code space, we extend the existence time of entanglement by nearly 50% compared to the case without entanglement pumping. This entanglement pumping scheme can additionally serve as an erasure detection protocol for the dual-rail code. This work highlights the potential of bosonic logical qubits for scalable quantum networks and introduces a novel paradigm for efficient entanglement management.

quant-ph↗

arXiv2026

Robust and optimal control of open quantum systems

Recent advancements in quantum technologies have highlighted the importance of mitigating system imperfections, including parameter uncertainties and decoherence effects, to improve the performance of experimental platforms. However, most of the previous efforts in quantum control are devoted to the realization of arbitrary unitary operations in a closed quantum system. Here, we improve the algorithm that suppresses system imperfections and noises, providing notably enhanced scalability for robust and optimal control of open quantum systems. Through experimental validation in a superconducting quantum circuit, we demonstrate that our approach outperforms its conventional counterpart for closed quantum systems with an ultra-low infidelity of about $0.60\%$, while the complexity of this algorithm exhibits the same scaling, with only a modest increase in the prefactor. This work represents a notable advancement in quantum optimal control techniques, paving the way for realizing quantum-enhanced technologies in practical applications.

quant-ph↗

arXiv2026

Quantum Confocal Microscopy in Fock Space with a 19 dB Metrological Gain

Quantum metrology promises measurement precision beyond classical limits by exploiting large-scale quantum states, yet realizing this advantage faces two fundamental challenges: the deterministic preparation of non-trivial quantum probes and the efficient extraction of metrological information in high-dimensional Hilbert spaces. Here, we introduce quantum confocal microscopy in Fock space that simultaneously resolves both challenges. Drawing a direct analogy between classical wave optics and quantum state evolution in a bosonic mode, we construct a confocal system with two Fock-space lenses. The first lens deterministically focuses a coherent state into a quantum probe with a tightly concentrated photon-number distribution, while the second lens maps the metrological information back to the vacuum state for efficient readout. Using a superconducting circuit QED platform, we prepare focused probe states with mean photon numbers up to ${N} = 500$, achieving a 21.5$\pm$1.1 dB compression of the photon-number uncertainty relative to a coherent state, with a scalable quantum circuit of $\mathcal{O}(1)$ operational depth. We demonstrate a displacement sensitivity scaling as $N^{-0.416}$, approaching the Heisenberg scaling ($N^{-0.5}$), and achieve a record metrological gain of 19.06$\pm$0.13 dB beyond the standard quantum limit. This work establishes quantum confocal microscopy as a scalable and practical framework for quantum-enhanced precision measurement, readily extendable to other bosonic platforms and high-dimensional quantum many-body systems.

quant-ph↗

arXiv2026

Deterministic Generation of Arbitrary Fock States via Resonant Subspace Engineering

Deterministic preparation of high-excitation Fock states is a central challenge in bosonic quantum information, with control complexity that generically explodes as the Hilbert space dimension grows. Here we introduce resonant subspace engineering (RSE), a protocol that analytically confines the infinite-dimensional bosonic dynamics to a two-dimensional invariant subspace spanned by an initial coherent state and the target state. State transfer then reduces to a geodesic rotation on a synthetic Bloch sphere, governed by resonance and phase-matching conditions we derive in closed form. For single Fock states, RSE achieves $O(n^{1/4})$ scaling in both evolution time and gate depth, showing a fundamental improvement over existing deterministic schemes. The construction generalizes to $K$-component superpositions via a $(K{+}1)$-dimensional invariant subspace with full $\mathrm{SU}(K{+}1)$ controllability, requiring only 3-5 iterations of operations for superpositions spanning photon numbers 70--100. RSE provides a scalable and analytically transparent framework for large-scale bosonic state engineering and gate synthesis across single- and multimode platforms.

quant-ph↗

arXiv2026

Synthesizing File-Level Data for Unit Test Generation with Chain-of-Thoughts via Self-Debugging

Automatic unit test (UT) generation is essential for software quality assurance, but existing approaches--including symbolic execution, search-based approaches, and recent LLM-based generators--struggle to produce human-quality tests with correct, meaningful assertions and reliable chain-of-thought (CoT) explanations. We identify a gap in UT training data: repository-mined tests lack developer CoTs, while LLM-distilled CoTs are often incorrect or incomplete. To address this issue, we propose a novel data-distillation approach that uses self-debugging to produce high-quality UT training examples paired with faithful CoTs. Our approach combines (1) guided test repair, a heuristic loop (error-, failure-, and coverage-focused steps) that asks the used model to diagnose and iteratively fix generated tests, and (2) CoT compression, which compacts original and debugging CoTs into concise explanations that directly justify correct tests. We apply this pipeline to a large corpus of open-source projects to construct a dataset of 74,518 high-quality examples, and then use it for supervised fine-tuning of a base model. An empirical evaluation shows that the fine-tuned model achieves high UT generation effectiveness: it attains a pass rate of 36.17% on test assertions, a branch coverage of 43.90%, and a mutation score of 88.66%, substantially higher than state-of-the-art commercial models like o4-mini.

cs.SE↗

arXiv2026

Echoed Random Quantum Metrology

Quantum metrology typically demands the preparation of exotic quantum probe states, such as entangled or squeezed states, to surpass classical limits. However, the need for carefully calibrated system parameters and finely optimized quantum controls imposes limitations on scalability and robustness. Here, we circumvent these limitations by introducing an echoed random process that achieves sensitivity approaching the Heisenberg limit while remaining blind to the random probe state. We demonstrate that by simply driving a Kerr nonlinear mode with random pulses, the emergence of sub-Planck phase-space structures grants high sensitivity, eliminating the need for complex quantum control. The protocol is statistically robust, yielding high performance across broad driving parameter ranges while exhibiting resilience to control fluctuations and photon loss. Broadly applicable to both bosonic and qubit platforms, our work reveals a practical, hardware-efficient, scalable, and optimization-free route to quantum-enhanced metrology in high-dimensional Hilbert spaces.

quant-ph↗

arXiv2026

Principles of Optics in the Fock Space: Scalable Manipulation of Giant Quantum States

The manipulation of distinct degrees of freedom of photons plays a critical role in both classical and quantum information processing. While the principles of wave optics provide elegant and scalable control over classical light in spatial and temporal domains, engineering quantum states in Fock space has been largely restricted to few-photon regimes, hindered by the computational and experimental challenges of large Hilbert spaces. Here, we introduce ``Fock-space optics", establishing a conceptual framework of wave propagation in the quantum domain by treating photon number as a synthetic dimension. Using a superconducting microwave resonator, we experimentally demonstrate Fock-space analogues of optical propagation, refraction, lensing, dispersion, and interference with up to 180 photons. These results establish a fundamental correspondence between Schrödinger evolution in a single bosonic mode and classical paraxial wave propagation. By mapping intuitive optical concepts onto high-dimensional quantum state engineering, our work opens a path toward scalable control of large-scale quantum systems with thousands of photons and advanced bosonic information processing.

quant-ph↗

arXiv2026

Scalable Generation of Macroscopic Fock States Exceeding 10,000 Photons

The scalable preparation of bosonic quantum states with macroscopic excitations poses a fundamental challenge in quantum technologies, limited by control complexity and photon-loss rates that severely constrain prior theoretical and experimental efforts to merely dozens of excitations per mode. Here, based on the duality of the quantum state evolution in Fock state space and the optical wave-function propagation in a waveguide array, we introduce a Kerr-engineered multi-lens protocol in a single bosonic mode to deterministically generate Fock states exceeding $10,000$ photons. By optimizing phase and displacement operations across lens groups, our approach compensates for non-paraxial aberrations, achieving fidelities above $73\%$ in numerical simulations for photon numbers up to $N=100,000$. Counterintuitively, the protocol's execution time scales as $N^{-1/2}$ with the target photon number $N$, exhibiting robustness against the photon loss. Our framework enables exploration of quantum-to-classical transitions of giant Fock states, paving the way for advanced quantum metrology with significant quantum gains, and error-corrected quantum information processing in high-dimensional Hilbert spaces.

quant-ph↗

arXiv2025

High-performance quantum interconnect between bosonic modules beyond transmission loss constraints

Distributed quantum computing architectures require high-performance quantum interconnects between quantum information processing units, while previous implementations have been fundamentally limited by transmission line losses. Here, we demonstrate a low-loss interconnect between two superconducting modules using an aluminum coaxial cable, achieving a bus mode quality factor of 1.7e6. By employing SNAIL as couplers, we realize inter-modular state transfer in 0.8 μs via a three-wave mixing process. The state transfer fidelity reaches 98.2% for quantum states encoded in the first two energy levels, achieving a Bell state fidelity of 92.5%. Furthermore, we show the capability to transfer high-dimensional states by successfully transmitting binomially encoded logical states. Systematic characterization reveals that performance constraints have shifted from transmission line losses (contributing merely 0.2% infidelity) to module-channel interface effects and local Kerr nonlinearities. Our work advances the realization of quantum interconnects approaching fundamental capacity limits, paving the way for scalable distributed quantum computing and efficient quantum communications.

quant-ph↗

arXiv2025

Giant-atom quantum acoustodynamics in hybrid superconducting-phononic integrated circuits

We demonstrate a giant atom by coupling a superconducting transmon qubit to a lithium niobate phononic waveguide at two points separated by about 600 acoustic wavelengths, with a propagation delay of 125 ns. The giant atom yields non-Markovian relaxation dynamics characterized by phonon backflow and a frequency-dependent effective decay rate varying four-fold over merely 4 MHz, corresponding to a Purcell factor exceeding 40. Exploiting this frequency-dependent dissipation, we prepare quantum superposition states with high purity. Our results establish phononic integrated circuits as a versatile platform for giant-atom physics, providing highly tunable quantum devices for advanced quantum information processing.

quant-ph↗

arXiv2025

Circuit Quantum Acoustodynamics in a Scalable Phononic Integrated Circuit Architecture

Previous demonstrations of quantum acoustic systems have been limited to isolated devices, with limited capability to route phonons and interconnect multi-port acoustic elements for further extension. Here, we demonstrate a scalable architecture for circuit quantum acoustodynamics (cQAD) by integrating superconducting qubits with suspension-free phononic integrated circuits (PnICs). Coherent coupling between tunable transmon qubits and waveguide-integrated phononic cavities, including Fabry-Perot cavities via monolithic integration and microring cavities via flip-chip assembly, has been achieved, producing a pronounced enhancement of phonon emission with a Purcell factor of ~19. These devices represent elementary building blocks for scalable phononic circuits, establishing the foundation for phonon-based quantum information processors and the testbed for novel quantum acoustic phenomena.

quant-ph↗

arXiv2025

High-Fidelity Controlled-Phase Gate for Binomial Codes via Geometric Phase Engineering

High-fidelity two-logical-qubit gates are essential for realizing fault-tolerant quantum computation with bosonic codes, yet experimentally reported fidelities have rarely exceeded 90\%. Here, we propose a geometric phase engineering approach for implementing controlled-phase gates for binomially encoded logical qubits. This method leverages the structural simplicity of geometric drives to reduce the numerical optimization dimensionality while fully incorporating system nonlinearities, enabling fast and high-fidelity logical operations. As an example, we experimentally demonstrate a process fidelity of 97.4$\pm$0.8\% for a controlled-Z gate between two binomial codes, surpassing all previously reported two-logical-qubit gates in bosonic codes. This work demonstrates that geometric phase engineering provides an effective and experimentally feasible route to fast, high-fidelity logical operations in bosonic quantum processors.

quant-ph↗

arXiv2025

Extending coherence time beyond break-even point using only drives and dissipation

Quantum error correction (QEC) aims to mitigate the loss of quantum information to the environment, which is a critical requirement for practical quantum computing. Existing QEC implementations heavily rely on measurement-based feedback, however, constraints on readout fidelity, hardware latency, and system complexity often limit both performance and scalability. Autonomous QEC (AQEC) seeks to overcome these obstacles by stabilizing logical codewords using introduced drives that provide coherent control and engineered dissipation. Here, we propose an AQEC protocol, derived from quantum channel simulation, that is applicable to arbitrary error-correcting codes. As a demonstration, we implement the protocol using a binomial code encoded in a long-lived bosonic mode (lifetime > 1ms), and extend the logical qubit coherence time to 1.04 times that of the best physical qubit in the system. This is the first experimental realization of an AQEC-protected bosonic logical qubit beyond the break-even point, proving that coherence time can indeed be extended by introducing only drives and dissipation. Our results highlight the performance and scalability potential of AQEC, marking an important step toward large-scale, universal quantum computing.

quant-ph↗

arXiv2025

Experimental Implementation of a Qubit-Efficient Variational Quantum Eigensolver with Analog Error Mitigation on a Superconducting Quantum Processor

We experimentally demonstrate a qubit-efficient variational quantum eigensolver (VQE) algorithm using a superconducting quantum processor, employing minimal quantum resources with only a transmon qubit coupled to a high-coherence photonic qubit. By leveraging matrix product states to compress the quantum state representation, we simulate an N + 1-spin circular Ising model with a transverse field. Furthermore, we develop an analog error mitigation approach through zero-noise extrapolation by introducing a precise noise injection technique for the transmon qubit. As a validation, we apply our error-mitigated qubit-efficient VQE in determining the ground state energies of a 4-spin Ising model. Our results demonstrate the feasibility of performing quantum algorithms with minimal quantum resources while effectively mitigating the impact of noise, offering a promising pathway to bridge the gap between theoretical advances and practical implementations on current noisy intermediate-scale quantum devices.

quant-ph↗

arXiv2024

Validity-Preserving Delta Debugging via Generator Trace Reduction

Reducing test inputs that trigger bugs is crucial for efficient debugging. Delta debugging is the most popular approach for this purpose. When test inputs need to conform to certain specifications, existing delta debugging practice encounters a validity problem: it blindly applies reduction rules, producing a large number of invalid test inputs that do not satisfy the required specifications. This overall diminishing effectiveness and efficiency becomes even more pronounced when the specifications extend beyond syntactical structures. Our key insight is that we should leverage input generators, which are aware of these specifications, to generate valid reduced inputs, rather than straightforwardly performing reduction on test inputs. In this paper, we propose a generator-based delta debugging method, namely GReduce, which derives validity-preserving reducers. Specifically, given a generator and its execution, demonstrating how the bug-inducing test input is generated, GReduce searches for other executions on the generator that yield reduced, valid test inputs. The evaluation results on five benchmarks (i.e., graphs, DL models, JavaScript programs, SymPy, and algebraic data types) show that GReduce substantially outperforms state-of-the-art syntax-based reducers including Perses and T-PDD, and also outperforms QuickCheck, SmartCheck, as well as the state-of-the-art choice-sequence-based reducer Hypothesis, demonstrating the effectiveness, efficiency, and versatility of GReduce.

cs.SE↗

arXiv2024

InfiBench: Evaluating the Question-Answering Capabilities of Code Large Language Models

Large Language Models for code (code LLMs) have witnessed tremendous progress in recent years. With the rapid development of code LLMs, many popular evaluation benchmarks, such as HumanEval, DS-1000, and MBPP, have emerged to measure the performance of code LLMs with a particular focus on code generation tasks. However, they are insufficient to cover the full range of expected capabilities of code LLMs, which span beyond code generation to answering diverse coding-related questions. To fill this gap, we propose InfiBench, the first large-scale freeform question-answering (QA) benchmark for code to our knowledge, comprising 234 carefully selected high-quality Stack Overflow questions that span across 15 programming languages. InfiBench uses four types of model-free automatic metrics to evaluate response correctness where domain experts carefully concretize the criterion for each question. We conduct a systematic evaluation for over 100 latest code LLMs on InfiBench, leading to a series of novel and insightful findings. Our detailed analyses showcase potential directions for further advancement of code LLMs. InfiBench is fully open source at https://infi-coder.github.io/infibench and continuously expanding to foster more scientific and systematic practices for code LLM evaluation.

cs.SE↗