SearcharxivSearch

arXiv · 1809.08957

Fast, Accurate, and Realizable Two-Qubit Entangling Gates by Quantum Interference in Detuned Rabi Cycles of Rydberg Atoms

Abstract

High-fidelity entangling quantum gates based on Rydberg interactions are required for scalable quantum computing with neutral atoms. Their realization, however, meets a major stumbling block -- the motion-induced dephasing of the transition between the ground and Rydberg states. By using quantum interference between different detuned Rabi oscillations, we propose a practical scheme to realize a class of accurate entangling Rydberg quantum gates subject to a minimal dephasing error. We show two types of such gates, $U_{1}$ and $U_{2}$, in the form of $\text{diag}\{1, e^{iα}, e^{iγ}, e^{iβ}\}$, where $α, γ$, and $β$ are determined by the parameters of lasers and the Rydberg blockade $V$. $U_{1}$ is realized by sending to the two qubits a single off-resonant laser pulse, while $U_{2}$ is realized by individually applying one pulse of detuned laser to each qubit. Our method has several advantages. First, the gates are accurate because the fidelity of $U_k$ is limited only by a rotation error below $10^{-5}$ and the Rydberg-state decay. Decay error on the order of $10^{-5}$ can be easily obtained because all transitions are detuned, resulting in small population in Rydberg state. Second, the motion-induced dephasing is minimized because there is no gap time in which a population is left in the Rydberg shelving states of either qubit. Third, the gate is resilient to the variation of $V$. This is because among the three phases $α,γ$, and $β$, only the last has a (partial) dependence on $V$. Fourth, the Rabi frequency and $V$ in our scheme are of similar magnitude, which permits a fast implementation of the gate when both of them are of the feasible magnitude of several megahertz. The rapidity, accuracy, and feasibility of this interference method can lay the foundation for entangling gates in universal quantum computing with neutral atoms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiao-Feng Shi. 2019-04-12. Fast, Accurate, and Realizable Two-Qubit Entangling Gates by Quantum Interference in Detuned Rabi Cycles of Rydberg Atoms. https://doi.org/10.1103/physrevapplied.11.044035

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