SearcharxivSearch

arXiv · 2502.21238

The iSWAP gate with polar molecules: Robustness criteria for entangling operations

Abstract

Ultracold polar molecules in optical lattices or tweezer arrays offer a promising platform for quantum information processing and simulation, thanks to their rich internal structure and long-range dipolar interactions. Recent experimental advances now allow precise control over individual molecules, enabling two-qubit gates based on the iSWAP gate. A key challenge is however the sensitivity to variations of the dipole-dipole interaction strength - stemming from motion of the molecules and uncertainty on the precise positioning of external confining potentials - that limits current gate fidelities. To address this, we develop a quantum optimal control framework, based on a perturbative approach, to design gates that are robust with respect to quasi-static deviations of Hamiltonian parameters, and provide criteria to evaluate a priori whether a gate can be made robust for a given control Hamiltonian. By applying these criteria to exchange-coupled qubits, as polar molecules, we demonstrate that robustness cannot be achieved with global controls only, but can be attained by breaking the exchange symmetry through local controls, such as a local detuning. We determine the robust time-optimal solution for realizing an iSWAP gate, show that the control pulses can be designed to be smooth functions, and achieve theoretical gate fidelities compatible with error correction under realistic parameters. Additionally, we show that certain entangled state preparations, such as Bell states, can be made robust even with global controls only. We demonstrate that, under the adiabatic approximation - where molecular motion occurs on timescales faster than that of the exchange interaction - the noise arising from thermal motion can be effectively treated as quasi-static variations of Hamiltonian parameters. This allows us to extend our treatment to the concrete experimental case of polar molecules.

Explore related subjects

Keep this discovery

BibTeXRIS

Matteo Bergonzoni, Sven Jandura, Guido Pupillo. 2025-02-28. The iSWAP gate with polar molecules: Robustness criteria for entangling operations. https://doi.org/10.1103/q9sd-rfp6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph