Searcharxiv⌕ Search

arXiv subjects

Shaowei Li

Publications and source records attributed to Shaowei Li.

At least 19 recordsLinked to original sources

Demonstration of a Qubit Control Scheme Compatible with Superconducting Digital Signals

Superconducting quantum computing faces a critical scalability bottleneck arising from the escalating complexity of traditional analog control infrastructure. Single-Flux-Quantum(SFQ) systems operate at cryogenic temperatures and offer a potential route to addressing these challenges. Using microwave signals at qubit-dependent frequencies to trigger SFQ pulses requires many independent analog microwave sources, limiting the potential to reduce control wiring and increase integration density. A scalable SFQ control system therefore needs a scheme that can address qubits with different transition frequencies using a common clock. Here, we propose and experimentally demonstrate a control scheme for implementing both single- and two-qubit gates. The scheme uses guiding waveforms to rapidly generate bipolar high-speed pulse sequences on a common clock, providing a basis for future implementation in SFQ control systems. Numerically, this scheme achieves a simulated fidelity of 99.99% for 40ns $R(φ, \fracπ{2})$ gates with arbitrary initial phases and 99.9% for 100ns controlled-Z(CZ) gates. Experimentally, by utilizing an arbitrary waveform generator(AWG) operated at a fixed sampling rate of 25GSa/s to deliver the bipolar high-speed pulse sequences, we successfully demonstrate 40ns single-qubit gates with an average gate fidelity of 99.94% estimated using cross-entropy benchmarking(XEB) and 120ns CZ gates with 99.63% fidelity. These results demonstrate the feasibility of common-clock encoded pulse control for both single- and two-qubit gates.

quant-ph↗

Hardware-Aware Realization of Deterministic Quantum-Walk Search on Complete Bipartite Graphs

Complete bipartite graphs offer a canonical platform for deterministic quantum search with quadratic speedup. We report the first experimental realization of deterministic discrete-time quantum-walk search over complete bipartite graphs, enabled by high-fidelity operations and a dynamical-phase compensation scheme, using a digital gate-based processor rather than an evolution-based platform. By compiling the search circuits to the native gate set and square-lattice topology, we implement full-space encoding to realize instances of graph sizes $N = 4$ and $8$, with success probabilities of 97.6% and 70.8% for finding the marked vertex, respectively. We also realize resource-efficient exact instances up to size $N = 16$, the largest achieving 66% success probability. Separately, a reduced invariant-subspace encoding preserves the dynamics of the deterministic search algorithm on two qubits for nominal problem sizes up to $N = 256$, with the success probability approaching 50%. Resource analyses of logical, hardware-compiled, and fault-tolerant-gate-set-synthesized circuits show that circuit depth and size scale as $\sqrt{N}$, with hardware overheads entering only as constant prefactors. For application-scale graphs ($N \sim 10^5$), an effective gate-fidelity model requires per-gate infidelity near $10^{-7}$. These results establish a concrete algorithm-to-hardware pathway for deterministic structured quantum search on gate-based quantum processors.

quant-ph↗

A Control Line Multiplexing Framework for Scalable Quantum Computing

Universal fault-tolerant superconducting quantum computers are expected to require millions of physical qubits; yet extending the prevailing dedicated-control-line paradigm to this scale would exceed the wiring density and cooling-power budget of dilution refrigerators. Microwave frequency-division multiplexing (FDM) revolutionized classical communications by enabling many independent channels to share common transmission infrastructure. Translating this principle to superconducting quantum control, however, requires an all-microwave architecture and experimental validation of frequency-multiplexed gate control. Recent work in quantum error correction has demonstrated microwave-based readout, single-qubit gates and leakage suppression, whereas two-qubit gates remain predominantly driven by unipolar pulses and thus constitute the missing element of an all-microwave architecture. Here, we propose a periodically extensible hybrid multiplexing framework in which all gate operations are frequency-division multiplexed using polychromatic microwave pulses and band-pass filters, thereby reducing the required control-line count by one to two orders of magnitude. In a 1:4 demonstration, we achieve average errors of $(6.4\pm0.2)\times10^{-3}$ for parallel FDM CZ gates and $(10.6\pm0.2)\times10^{-4}$ for parallel FDM $XY(π/2)$ gates, without statistically significant multiplexing-induced degradation. Together with on-chip DC sources, this FDM-based gate-control scheme completes the last missing module in a scalable multiplexed-control architecture toward universal fault-tolerant quantum computing.

quant-ph↗

ForgetMimic: Motion Unlearning for Reinforcement Learning Humanoid Control

Humanoid control, leveraging human demonstrations, has achieved diverse, agile, and natural locomotion behaviors through reinforcement learning (RL). While this paradigm has yielded remarkable performance in physical humanoid control, how to eliminate specific motions from learned policies remains insufficiently explored. Addressing this issue is motivated by pressing safety and privacy concerns: the removal of malicious, poisoned, or suboptimal motions, as well as copyright-protected motions subject to the right to be forgotten under regulations such as the GDPR, is of critical importance. To this end, we propose {ForgetMimic}, the first motion-level unlearning method designed specifically for physical-world humanoid control. The core idea of ForgetMimic is as follows: given a policy $π_θ$ trained on $N$ motions, our method degrades performance on a target subset of $K$ motions while preserving the effectiveness of the remaining $N-K$ motions. Furthermore, we identify and resolve two key training mechanisms in robot control that lead to unlearning failure. We conduct extensive experiments on the Unitree G1 and H2 humanoid robots across 12 motions, including Dance, Fight, Flip, and others. Experimental results demonstrate that ForgetMimic effectively eliminates memory of designated motions while maintaining the normal operation of all other motions.

cs.RO↗

One- and two-dimensional cluster states for topological phase simulation and measurement-based quantum computation

Quantum entanglement is a fundamental resource for quantum information processing and serves as a critical benchmark for quantum hardware performance. Cluster states are a special class of entangled states that serve as universal resources for measurement-based quantum computation and possess an intrinsic symmetry-protected topological order, which confers robustness against symmetry-respecting noise. Here we report the scalable preparation and verification of genuine multipartite cluster states on the 105-qubit Zuchongzhi 3.1 superconducting processor. We achieve one-dimensional cluster states of up to 95 qubits and two-dimensional cluster states of up to 72 qubits. The symmetry-protected topological cluster states exhibit input-state-dependent robustness under symmetry-breaking perturbations due to an operational parity structure that enhances the performance of measurement-based quantum computation. Furthermore, we use our two-dimensional cluster states to implement the Deutsch-Jozsa algorithm within the measurement-based quantum computation framework, achieving higher output-state fidelity compared with traditional circuit-based models and a query efficiency advantage over classical approaches. Our work establishes a scalable platform that combines large-scale entanglement generation, symmetry-protected topological order and practical quantum algorithms to enable robust, fault-tolerant measurement-based quantum computation.

quant-ph↗

High fidelity control of superconducting qubits with optical transmitted signal

Superconducting circuits exhibit remarkable potential for constructing large-scale quantum simulation and computation systems, featuring numerous qubits, extended coherence time, and precise control. Nevertheless, the growing number of signal cables poses a challenge in dilution refrigerators due to space and heat load constraints. To overcome this issue, we experimentally implemented an optically-assisted transmission line as an alternative to coaxial cables. By modulating microwave signals on laser intensities at room temperature and regenerating the signals at a cryogenic plate within the dilution refrigerator, we demonstrated full control of superconducting qubits using photocurrent. We demonstrate and benchmark both single-qubit and two-qubit gates on frequency tunable transmon qubits, achieving fidelities of 99.915% $\pm$ 0.005% and 99.676% $\pm$ 0.041%, respectively, which have reached the requirement of the surface code.

quant-ph↗

$τ_0$-VLA: a Hierarchical Robot Foundation Model with World-Model-Guided Test-Time Computation

Long-horizon robot manipulation requires a robot to both execute individual skills reliably and sequence them coherently over extended tasks. Most hierarchical vision-language-action (VLA) models make each such decision with a single forward pass, leaving no mechanism to allocate additional computation to difficult or consequential choices. We introduce $τ_0$-VLA, a hierarchical robot foundation model that formulates high-level subtask generation as a compute-scalable inference problem through world-model-guided test-time computation. At each inference step, the high-level policy uses execution memory to generate a subtask and, when needed, searches over alternatives before committing to its output. A low-level policy then executes the generated subtask across multiple robot embodiments. The policy is trained on 40,115 hours of heterogeneous real-world data with multimodal co-training. Across in-domain and distribution-shifted settings, allocating additional test-time computation substantially improves next-subtask prediction accuracy, and these gains translate into higher closed-loop success on long-horizon robot manipulation tasks.

cs.RO↗

Surface code logical operations on a superconducting quantum processor

Fault-tolerant quantum computation requires logical operations that manipulate encoded information while preserving quantum error-correction protection. In planar surface-code architectures, code deformation and lattice surgery provide a local, measurement-based route to such operations. Here we experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor. We first implement a reusable primitive layer comprising merge and split, patch expansion and shrinkage, and deformations mediated by domain walls and twist defects. We then compose these primitives to realize logical state routing, the logical controlled-NOT gate, and the single-qubit Hadamard and phase gates, which together form a Clifford-generating set. All operations are implemented on distance-three rotated surface-code patches with multi-round syndrome extraction and neural-network decoding, without post-selection. Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.

quant-ph↗

FGRPO: Federated GRPO with Adaptive Aggregation on Non-IID Data

Recent advances in language models have established reinforcement learning as the primary paradigm for eliciting self-correction and long-chain reasoning. While group relative policy optimization (GRPO) offers superior scalability by eliminating the critic network, deploying it on a central infrastructure entails collecting a large volume of data from distributed owners, which poses significant privacy risks. To address these concerns, we introduce federated GRPO (FGRPO), a framework designed to decentralize the fine-tuning of reasoning models across heterogeneous data owners. To effectively mitigate the instability caused by divergent reward scales across heterogeneous tasks, FGRPO incorporates an adaptive aggregation mechanism based on relative performance gain. By characterizing each client's improvement relative to its personalized historical baseline, the framework dynamically prioritizes effective learning trajectories regardless of local task difficulty. FGRPO ensures robust convergence on non-IID data while preserving data privacy.

cs.LG↗

DECA: Decentralizing Block-Wise Adam for Efficient LLM Full-Parameter Fine-Tuning on Non-IID Data

Fine-tuning large language models (LLMs) in privacy-sensitive and resource-constrained environments remains challenging. Since training data are often distributed across multiple clients, decentralized fine-tuning offers a natural paradigm for collaborative adaptation without a central server. However, enabling full-parameter fine-tuning (FPFT) in this decentralized setting is difficult: FPFT provides strong adaptation capacity but incurs prohibitive resource consumption for billion-scale models. Existing decentralized LLM fine-tuning methods therefore mainly rely on parameter-efficient updates, which improve efficiency but may restrict downstream performance. Moreover, client data are typically non-IID, making decentralized optimization more vulnerable to client drift and unstable convergence. To address these challenges, we propose DECA, a resource-efficient decentralized FPFT framework for LLMs on non-IID data. DECA partitions model parameters into disjoint blocks and performs sequential block-wise Adam optimization, reducing resource consumption while preserving decentralized full-parameter adaptation. To stabilize training, DECA further introduces first- and second-order block-wise moment estimates with fresh local gradient statistics and consensus-derived discrepancy signals. We provide rigorous theoretical analysis and extensive experiments, showing that DECA achieves fast convergence, strong downstream performance, and significant resource efficiency.

cs.LG↗

Algorithmic Quantum Simulations of Quantum Thermodynamics

Characterizing quantum phases-of-matter at finite-temperature is essential for understanding complex materials and large-scale thermodynamic phenomena. Here, we develop algorithmic protocols for simulating quantum thermodynamics on quantum hardware through quantum kernel function expansion (QKFE), producing the free energy as an analytic function of temperature with uniform convergence. These protocols are demonstrated by simulating transverse field Ising and XY models with superconducting qubits. In both analogue and digital implementations of the QKFE algorithms, we exhibit quantitative agreement of our quantum simulation experiments with the exact results. Our approach provides a general framework for computing thermodynamic potentials on programmable quantum devices, granting access to key thermodynamic properties such as entropy, heat capacity and criticality, with far-reaching implications for material design and drug development.

quant-ph↗

Spectroscopic Determination of Site-Selective Ligand Binding on Single Anisotropic Nanocrystals

Organic surface ligands are integral components of nanocrystals and nanoparticles that have a strong influence on their physicochemical properties, their interaction with the environment, and their ability to self-assemble and order into higher-order structures. These hybrid nanomaterials are tunable with applications in catalysis, directed self-assembly, next-generation optoelectronics, and chemical and quantum sensing. Critically, future advances depend on our ability to rationally engineer their surface chemistry. However, fundamental knowledge of ligand-nanoparticle behavior is limited by uncertainty in where and how these ligands bind to surfaces. For nanoparticles, in particular, few characterization techniques offer both the high spatial resolution and the precise chemical mapping needed to identify specific ligand binding sites. In this study, we utilized synchrotron infrared nanospectroscopy (SINS), atomic force microscopy (AFM), and scanning tunneling microscopy (STM) together with first-principles computer simulations to validate the site-selective adsorption of organic ligands on a shaped nanocrystal surface. Specifically, we demonstrate that the sterically encumbered isocyanide ligands (CNAr^{Mes2}) preferentially bind to the high curvature features of Ag nanocubes (NCs), where low-coordinate Ag atoms are present. In contrast, isocyanide ligands that do not exhibit these steric properties show no surface selectivity. SINS serves as an effective tool to validate these surface binding interactions at the near-single molecule level. These results indicate that steric effects can be successfully harnessed to design bespoke organic ligands for fine-tuning nanocrystal surface chemistry and the properties of the nanocrystal ligand shell.

cond-mat.mtrl-sci↗

Scalable fluxonium qubit architecture with tunable interactions between non-computational levels

The fluxonium qubit has emerged as a promising candidate for superconducting quantum computing due to its long coherence times and high-fidelity gates. Nonetheless, further scaling up and improving performance remain critical challenges for establishing fluxoniums as a viable alternative to transmons. A key obstacle lies in developing scalable coupling architectures. In this work, we introduce a scalable fluxonium architecture that enables decoupling of qubit states while maintaining tunable couplings between non-computational states. Beyond the well-studied ZZ crosstalk, we identify that always-on interactions involving non-computational levels can significantly degrade the fidelities of initialization, control, and readout in large systems, thereby impeding scalability. Based on two possible physical realizations of the architecture, we demonstrate that the issue can be mitigated by implementing tunable couplings for fluxonium plasmon transitions, meanwhile enabling fast, high-fidelity gates with passive ZZ suppression. This comparative analysis enables us to establish general principles for realizing the architecture while understanding and addressing implementation-specific challenges.

quant-ph↗

Calibrating quantum gates up to 52 qubits in a superconducting processor

Benchmarking large-scale quantum gates, typically involving multiple native two-qubit and singlequbit gates, is crucial in quantum computing. Global fidelity, encompassing information about intergate correlations, offers a comprehensive metric for evaluating and optimizing gate performance, unlike the fidelities of individual local native gates. In this work, utilizing the character-average benchmarking protocol implementable in a shallow circuit, we successfully benchmark gate fidelities up to 52 qubits. Notably, we achieved a fidelity of 63.09$\pm $0.23% for a 44-qubit parallel CZ gate. Utilizing the global fidelity of the parallel CZ gate, we explore the correlations among local CZ gates by introducing an inter-gate correlation metric, enabling one to simultaneously quantify crosstalk error when benchmarking gate fidelity. Finally, we apply our methods in gate optimization. By leveraging global fidelity for optimization, we enhance the fidelity of a 6-qubit parallel CZ gate from 87.65% to 92.04% and decrease the gate correlation from 3.53% to 3.22%, compared to local gate fidelitybased optimization. The experimental results align well with our established composite noise model, incorporating depolarizing and ZZ-coupling noises, and provide valuable insight into further study and mitigation of correlated noise.

quant-ph↗

Computational Analysis of Interface-Driven Spin-Orbit Coupling in Molecular Adsorbates on Transition Metal Dichalcogenides

Spin-orbit coupling (SOC) lifts molecular orbital degeneracy, enabling bi-level electronic platforms suitable for next-generation digital devices. However, common light-atom molecular feedstocks exhibit weak SOC due to the absence of heavy elements. To enhance SOC without synthesizing new materials, we leverage interfacial interactions between molecules and transition-element-based solid-state materials. This computational study investigates SOC splitting in metal-phthalocyanine adsorbed on transition metal dichalcogenides (TMDs) using density functional theory (DFT). The enhanced SOC splitting is attributed to strong orbital hybridization at the molecule-substrate interface. Specifically, Zn-phthalocyanine (ZnPC) on monolayer MoS2 achieves a notable SOC splitting of ~8 meV. Furthermore, when ZnPC forms self-assembled chains on MoS2, the splitting increases to ~20 meV, driven by the formation of hybrid bands modulated by molecular periodicity. These findings highlight the role of interfacial and intermolecular interactions in inducing and enhancing SOC in surface-adsorbed molecules, providing a new strategy for molecular spintronic materials without complex synthetic efforts.

cond-mat.mtrl-sci↗

Single-Molecule Vibrational Characterization of Binding Geometry Effects on Isocyanide-Metal Interactions

Isocyanide-metal binding is governed by sigma-donation and pi-back-bonding, which affects the energy of the isocyanide stretching mode-a characteristic probe for ligand-metal interactions. While extensive correlations exist between structure and spectroscopy in molecular isocyanide-metal systems, isocyanide interactions with metallic crystalline surfaces, where ligands often bind in various geometries, remain poorly understood. Conventional vibrational spectroscopies, such as infrared and Raman, lack the molecular-scale resolution needed to distinguish these inhomogeneous configurations. In contrast, inelastic electron tunneling spectroscopy with scanning tunneling microscopy (STM-IETS) enables direct visualization of ligand adsorption geometries and their vibrational signatures. Using STM-IETS, here we investigate a matal-adsorbed m-terphenyl isocyanie ligand and find that adsorption geometry on Cu(100) induces a significant shift in isocyanide stretching frequency, even greater than replacing Cu(100) with Ag(111). Density functional theory confirms this shift arises from atomic-scale variations in isocyanide-metal binding. This study elucidates how atomic-scale binding influences the vibrational signatures of isocyanide ligands-an often-overlooked factor in understanding isocyanide-metal interactions.

cond-mat.mes-hall↗

In situ Qubit Frequency Tuning Circuit for Scalable Superconducting Quantum Computing: Scheme and Experiment

Frequency tunable qubit plays a significant role for scalable superconducting quantum processors. The state-of-the-art room-temperature electronics for tuning qubit frequency suffers from unscalable limit, such as heating problem, linear growth of control cables, etc. Here we propose a scalable scheme to tune the qubit frequency by using in situ superconducting circuit, which is based on radio frequency superconducting quantum interference device (rf-SQUID). We demonstrate both theoretically and experimentally that the qubit frequency could be modulated by inputting several single pulses into rf-SQUID. Compared with the traditional scheme, our scheme not only solves the heating problem, but also provides the potential to exponentially reduce the number of cables inside the dilute refrigerator and the room-temperature electronics resource for tuning qubit frequency, which is achieved by a time-division-multiplex (TDM) scheme combining rf-SQUID with switch arrays. With such TDM scheme, the number of cables could be reduced from the usual $\sim 3n$ to $\sim \log_2{(3n)} + 1$ for two-dimensional quantum processors comprising $n$ qubits and $\sim 2n$ couplers. Our work paves the way for large-scale control of superconducting quantum processor.

quant-ph↗

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62% and 99.18%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on Zuchongzhi 3.0 highlight its superior performance, achieving one million samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately $6.4\times 10^9$ years to replicate the task. This leap in processing power places the classical simulation cost six orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Nature 634, 328(2024)], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

quant-ph↗