arXiv subjects

Boxi Li

Publications and source records attributed to Boxi Li.

15 recordsLinked to original sources

arXiv2026

Counterdiabatic Driving under Variational Frame Dressing

Counterdiabatic (CD) driving accelerates adiabatic protocols by prescribing auxiliary control fields, but often fails to map them to physically available operations. We derive a general formalism for such a mapping. We formulate CD driving in a variational dressed frame, where an unconstrained auxiliary generator reshapes the effective adiabatic problem while simultaneously forcing the applied correction to stay restricted to the native laboratory controls. This yields a laboratory-frame commutator equation that can be solved without constructing instantaneous eigenstates or the adiabatic and dressed-frame unitaries. The additional dressed-frame freedom reveals solutions that are inaccessible in the conventional adiabatic frame. We illustrate this mechanism in three settings: suppression of spectator errors in a multi-qubit chain driven by a single quadrature, an analytical acceleration of adiabatic Bell-state preparation with a fixed entangling interaction, and implementation of a fast adiabatic holonomic gate in a degenerate tripod manifold with correction pulses confined to the native couplings. Our results provide a systematic nonperturbative framework for constructing implementable counterdiabatic protocols beyond the conventional adiabatic frame.

quant-ph↗

arXiv2026

Simple analytical flux-tuned iSWAP pulses for leakage suppression

Fast, high-fidelity two-qubit gates are a key requirement for fault-tolerant quantum computation. Tunable coupler architectures provide a flexible approach for implementing entangling gates through flux control with large on-off ratios, but fast flux modulation can induce diabatic transitions and population leakage to non-computational states, limiting gate performance. Here we present an analytical flux control method enabling derivative removal by adiabatic gate ($\Phi$-DRAG) for suppressing leakage in flux tunable two-qubit gates. We show that $\Phi$-DRAG differs fundamentally from conventional microwave implementations and derive modified flux modulation protocols that suppress leakage below $10^{-4}$ for fast entangling gates. The method remains effective across a range of asymmetry between qubit anharmonicities and different circuit parameters, enabling high-fidelity two-qubit gates within the fifteen nanosecond range.

quant-ph↗

arXiv2026

Improving Single Excitation Fidelity in Rydberg Superatoms for Efficient Single Photon Emission

Deterministic single photon emission from a Rydberg ensemble coupled to an optical cavity requires high-fidelity preparation of collective single excitations. In such a setup imperfect Rydberg blockade can lead to unwanted double excitations, which degrade photon indistinguishability. In this work we adapt the Derivative Removal by Adiabatic Gate (DRAG) technique, originally developed for superconducting qubits, to shape optical pulses that suppress double excitations in this atomic platform. By combining analytical modeling with numerical optimization, DRAG provides an improvement over conventional sine-squared pulses. Further optimization of pulse duration and atomic ensemble size identifies a parameter regime, distinct from that used in [Nature Photonics 17, 688 (2023)], that enhances the single excitation probability from the previous theoretical benchmark of 77% to 91.9%, approaching the fundamental limits set by decoherence in the system. Benchmarking against GRAPE (Gradient Ascent Pulse Engineering) confirms that DRAG operates close to the optimal control limit, while maintaining smooth, experimentally feasible pulse shapes. These results demonstrate the effectiveness and cross platform adaptability of DRAG for a high-fidelity single photon source.

quant-ph↗

arXiv2025

Analytical blueprint for 99.999% fidelity X-gates on present superconducting hardware under strong driving

Achieving very fast gates that undercut the natural limits set by decoherence requires going into the strong driving limit. Realizing single-qubit control predicted beyond semi-classical, time-dependent modeling has yet to be experimentally realized on superconducting and most other computing platforms. In this regime, the common model of dynamics within a three-level manifold breaks down, and instead, we see new quantum error channels growing abruptly with decreasing time. To identify these error processes we systematically calculate the effect of multi-photon transitions that occur out of the computational space. We then derive analytical formulas to suppress these effects, as well as amplitude and phase errors on the qubit space; we term these R1D for suppressing the $|0\rangle-|2\rangle$ transition and R2D when also suppressing $|1\rangle-|3\rangle$ leakage. We also answer long-standing questions about the optimal values of the DRAG prefactor as well as constant detuning, when accounting for time-ordering, and also show how to calibrate other prefactors for further performance improvement. Upon correcting these varied sources of error, we numerically demonstrate gate infidelities below $10^{-5}$ for a 7ns $\pi$-rotation when incorporating existing decoherence rates.

quant-ph↗

arXiv2025

Suppressing spurious transitions using spectrally balanced pulse

Achieving precise control over quantum systems presents a significant challenge, especially in many-body setups, where residual couplings and unintended transitions undermine the accuracy of quantum operations. In superconducting qubits, parasitic interactions -- both between distant qubits and with spurious two-level systems -- can severely limit the performance of quantum gates. In this work, we introduce a pulse-shaping technique that uses spectrally balanced microwave pulses to suppress undesired transitions. Experimental results demonstrate an order-of-magnitude reduction in spurious excitations between weakly detuned qubits, as well as a substantial decrease in single-qubit gate errors caused by a strongly coupled two-level defect over a broad frequency range. Our method provides a simple yet powerful solution to mitigate adverse effects from parasitic couplings, enhancing the fidelity of quantum operations and expanding feasible frequency allocations for large-scale quantum devices.

quant-ph↗

arXiv2024

Universal pulses for superconducting qudit ladder gates

Qudits, generalizations of qubits to multi-level quantum systems, offer enhanced computational efficiency by encoding more information per lattice cell, avoiding costly swap operations and providing even exponential speedup in some cases. Utilizing the $d$-level manifold, however, requires high-speed gate operations because of the stronger decoherence at higher levels. While analytical control methods have proven effective for qubits in achieving fast gates with minimal control errors, their extension to qudits is nontrivial due to the increased complexity of the energy level structure arising from additional ancillary states. In this work, we present a universal pulse construction for generating rapid, high-fidelity unitary rotations between adjacent qudit levels, thereby providing a prescription for any gate in $SU(d)$. Control errors in these operations are effectively analyzed within a four-level subspace, including two leakage levels with approximately opposite detuning. By identifying the optimal degrees of freedom, we derive concise analytical pulse schemes that suppress multiple control errors and outperform existing methods. Remarkably, our approach achieves consistent coherent error scaling across all levels, approaching the quantum speed limit independently of parameter variations between levels. Validation on transmon circuits demonstrates significant improvements in gate fidelity for various qudit sizes aiming for $10^{-4}$ error. This method provides a scalable solution for improving qudit control and can be broadly applied to other quantum systems with ladder structures or operations involving multiple ancillary levels.

quant-ph↗

arXiv2024

QuTiP 5: The Quantum Toolbox in Python

QuTiP, the Quantum Toolbox in Python, has been at the forefront of open-source quantum software for the past 13 years. It is used as a research, teaching, and industrial tool, and has been downloaded millions of times by users around the world. Here we introduce the latest developments in QuTiP v5, which are set to have a large impact on the future of QuTiP and enable it to be a modern, continuously developed and popular tool for another decade and more. We summarize the code design and fundamental data layer changes as well as efficiency improvements, new solvers, applications to quantum circuits with QuTiP-QIP, and new quantum control tools with QuTiP-QOC. Additional flexibility in the data layer underlying all ``quantum objects'' in QuTiP allows us to harness the power of state-of-the-art data formats and packages like JAX, CuPy, and more. We explain these new features with a series of both well-known and new examples. The code for these examples is available in a static form on GitHub and as continuously updated and documented notebooks in the qutip-tutorials package.

quant-ph↗

arXiv2024

Leveraging Hardware Power through Optimal Pulse Profiling for Each Qubit Pair

In the scaling development of quantum computers, the calibration process emerges as a critical challenge. Existing calibration methods, utilizing the same pulse waveform for two-qubit gates across the device, overlook hardware differences among physical qubits and lack efficient parallel calibration. In this paper, we enlarge the pulse candidates for two-qubit gates to three pulse waveforms, and introduce a fine-grained calibration protocol. In the calibration protocol, three policies are proposed to profile each qubit pair with its optimal pulse waveform. Afterwards, calibration subgraphs are introduced to enable parallel calibraton through identifying compatible calibration operations. The protocol is validated on real machine with up to 127 qubits. Real-machine experiments demonstrates a minimum gate error of 0.001 with a median error of 0.006 which is 1.84x reduction compared to default pulse waveform provided by IBM. On device level, a double fold increase in quantum volume as well as 2.3x reduction in error per layered gate are achieved. The proposed protocol leverages the potential current hardware and could server as an important step toward fault-tolerant quantum computing.

quant-ph↗

arXiv2024

Coqa: Blazing Fast Compiler Optimizations for QAOA

The Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage over classical computers. However, existing compilers lack specialized methods for optimizing QAOA circuits. There are circuit patterns inside the QAOA circuits, and current quantum hardware has specific qubit connectivity topologies. Therefore, we propose Coqa to optimize QAOA circuit compilation tailored to different types of quantum hardware. Our method integrates a linear nearest-neighbor (LNN) topology and efficiently map the patterns of QAOA circuits to the LNN topology by heuristically checking the interaction based on the weight of problem Hamiltonian. This approach allows us to reduce the number of SWAP gates during compilation, which directly impacts the circuit depth and overall fidelity of the quantum computation. By leveraging the inherent patterns in QAOA circuits, our approach achieves more efficient compilation compared to general-purpose compilers. With our proposed method, we are able to achieve an average of 30% reduction in gate count and a 39x acceleration in compilation time across our benchmarks.

quant-ph↗

arXiv2023

Experimental error suppression in Cross-Resonance gates via multi-derivative pulse shaping

While quantum circuits are reaching impressive widths in the hundreds of qubits, their depths have not been able to keep pace. In particular, cloud computing gates on multi-qubit, fixed-frequency superconducting chips continue to hover around the 1% error range, contrasting with the progress seen on carefully designed two-qubit chips, where error rates have been pushed towards 0.1%. Despite the strong impetus and a plethora of research, experimental demonstration of error suppression on these multi-qubit devices remains challenging, primarily due to the wide distribution of qubit parameters and the demanding calibration process required for advanced control methods. Here, we achieve this goal, using a simple control method based on multi-derivative, multi-constraint pulse shaping, which acts simultaneously against multiple error sources. Our approach establishes a two to fourfold improvement on the default calibration scheme, demonstrated on four qubits on the IBM Quantum Platform with limited and intermittent access, enabling these large-scale fixed-frequency systems to fully take advantage of their superior coherence times. The achieved CNOT fidelities of 99.7(1)% on those publically available qubits come from both coherent control error suppression and accelerated gate time.

quant-ph↗

arXiv2022

Fault Models in Superconducting quantum circuits

Fault models are indispensable for many EDA tasks, so as for design and implementation of quantum hardware. In this article, we propose a fault model for superconducting quantum systems. Our fault model reflects the real fault behavior in control signals and structure of quantum systems. Based on it, we conduct fault simulation on controlled-Z gate and quantum circuits by QuTiP. We provide fidelity benchmarks for incoherent faults and test patterns of minimal test repetitions for coherent faults. Results show that with 34 test repetitions a 10% control noise can be detected, which help to save test time and memory.

quant-ph↗

arXiv2021

Non-perturbative analytical diagonalization of Hamiltonians with application to coupling suppression and enhancement in cQED

Deriving effective Hamiltonian models plays an essential role in quantum theory, with particular emphasis in recent years on control and engineering problems. In this work, we present two symbolic methods for computing effective Hamiltonian models: the Non-perturbative Analytical Diagonalization (NPAD) and the Recursive Schrieffer-Wolff Transformation (RSWT). NPAD makes use of the Jacobi iteration and works without the assumptions of perturbation theory while retaining convergence, allowing to treat a very wide range of models. In the perturbation regime, it reduces to RSWT, which takes advantage of an in-built recursive structure where remarkably the number of terms increases only linearly with perturbation order, exponentially decreasing the number of terms compared to the ubiquitous Schrieffer-Wolff method. In this regime, NPAD further gives an exponential reduction in terms, i.e. superexponential compared to Schrieffer-Wolff, relevant to high precision expansions. Both methods consist of algebraic expressions and can be easily automated for symbolic computation. To demonstrate the application of the methods, we study the ZZ and cross-resonance interactions of superconducting qubits systems. We investigate both suppressing and engineering the coupling in near-resonant and quasi-dispersive regimes. With the proposed methods, the coupling strength in the effective Hamiltonians can be estimated with high precision comparable to numerical results.

quant-ph↗

arXiv2021

Pulse-level noisy quantum circuits with QuTiP

The study of the impact of noise on quantum circuits is especially relevant to guide the progress of Noisy Intermediate-Scale Quantum (NISQ) computing. In this paper, we address the pulse-level simulation of noisy quantum circuits with the Quantum Toolbox in Python (QuTiP). We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian that describes the unitary evolution of the physical qubits. Various types of noise can be introduced based on the physical model, e.g., by simulating the Lindblad density-matrix dynamics or Monte Carlo quantum trajectories. In particular, the user can define environment-induced decoherence at the processor level and include noise simulation at the level of control pulses. We illustrate how the Deutsch-Jozsa algorithm is compiled and executed on a superconducting-qubit-based processor, on a spin-chain-based processor and using control optimization algorithms. We also show how to easily reproduce experimental results on cross-talk noise in an ion-based processor, and how a Ramsey experiment can be modeled with Lindblad dynamics. Finally, we illustrate how to integrate these features with other software frameworks.

quant-ph↗

arXiv2020

Tools for quantum network design

Quantum networks will enable the implementation of communication tasks with qualitative advantages with respect to the communication networks we know today. While it is expected that the first demonstrations of small scale quantum networks will take place in the near term, many challenges remain to scale them. To compare different solutions, optimize over parameter space and inform experiments, it is necessary to evaluate the performance of concrete quantum network scenarios. Here, we review the state of the art of tools for evaluating the performance of quantum networks. We present them from three different angles: information-theoretic benchmarks, analytical tools, and simulation.

quant-ph↗

arXiv2020

Efficient optimization of cut-offs in quantum repeater chains

Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-distance transmission of quantum information in many relevant scenarios. In principle quantum repeaters allow one to overcome losses. However, realistic hardware parameters make long-distance quantum communication a challenge in practice. For instance, in many protocols an entangled pair is generated that needs to wait in quantum memory until the generation of an additional pair. During this waiting time the first pair decoheres, impacting the quality of the final entanglement produced. At the cost of a lower rate, this effect can be mitigated by imposing a cut-off condition. For instance, a maximum storage time for entanglement after which it is discarded. In this work, we optimize the cut-offs for quantum repeater chains. First, we develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols which include a cut-off. Then, we use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain. We find that the use of the optimal cut-off extends the parameter regime for which secret key can be generated and moreover significantly increases the secret-key rate for a large range of parameters.

quant-ph↗