Searcharxiv⌕ Search

arXiv subjects

Dolev Bluvstein

Publications and source records attributed to Dolev Bluvstein.

At least 37 records · Page 2Linked to original sources

Optimal Routing Protocols for Reconfigurable Atom Arrays

Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes have enabled new applications for these systems. Atom reconfiguration, or routing, is the core mechanism for programming circuits; optimizing this routing can increase processing speeds, reduce decoherence, and enable efficient implementations of highly non-local connections. In this work, we investigate routing models applicable to state-of-the-art neutral atom systems. With routing steps that can operate on multiple atoms in parallel, we prove that current designs require $Ω(\sqrt N \log N)$ steps to perform certain permutations on 2D arrays with $N$ atoms and provide a protocol that achieves routing in $\mathcal O(\sqrt N \log N)$ steps for any permutation. We also propose a simple experimental upgrade and show that it would reduce the routing cost to $Θ(\log N)$ steps.

quant-ph↗

Fault-tolerant optical interconnects for neutral-atom arrays

We analyze the use of photonic links to enable large-scale fault-tolerant connectivity of locally error-corrected modules based on neutral atom arrays. Our approach makes use of recent theoretical results showing the robustness of surface codes to boundary noise and combines recent experimental advances in atom array quantum computing with logical qubits with optical quantum networking techniques. We find the conditions for fault-tolerance can be achieved with local two-qubit Rydberg gate and non-local Bell pair errors below 1% and 10%, respectively, without requiring distillation or space-time overheads. Realizing the interconnects with a lens, a single optical cavity, or an array of cavities enables a Bell pair generation rate in the 1-50 MHz range. When directly interfacing logical qubits, this rate translates to error-correction cycles in the 25-2000 kHz range, satisfying all requirements for fault tolerance and in the upper range fast enough for 100 kHz logical clock cycles.

quant-ph↗

Fast and Parallelizable Logical Computation with Homological Product Codes

Quantum error correction is necessary to perform large-scale quantum computation, but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes, and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical CNOTs between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing $k$-qubit GHZ states and distilling/teleporting $k$ magic states with $O(1)$ space overhead in $O(1)$ and $O(\sqrt{k} \log k)$ logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads.

quant-ph↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

quant-ph↗

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction for large-scale processing. However, the overhead in the realization of error-corrected ``logical'' qubits, where information is encoded across many physical qubits for redundancy, poses significant challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Utilizing logical-level control and a zoned architecture in reconfigurable neutral atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encodings, we demonstrate improvement of a two-qubit logic gate by scaling surface code distance from d=3 to d=7, preparation of color code qubits with break-even fidelities, fault-tolerant creation of logical GHZ states and feedforward entanglement teleportation, as well as operation of 40 color code qubits. Finally, using three-dimensional [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path toward large-scale logical processors.

quant-ph↗

Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays

Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum computing. However, the long-range connectivity required to implement such codes makes their physical realization challenging. Here, we propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays, directly compatible with recently demonstrated experimental capabilities. Our approach utilizes the product structure inherent in many qLDPC codes to implement the non-local syndrome extraction circuit via atom rearrangement, resulting in effectively constant overhead in practically relevant regimes. We prove the fault tolerance of these protocols, perform circuit-level simulations of memory and logical operations with these codes, and find that our qLDPC-based architecture starts to outperform the surface code with as few as several hundred physical qubits at a realistic physical error rate of $10^{-3}$. We further find that less than 3000 physical qubits are sufficient to obtain over an order of magnitude qubit savings compared to the surface code, and quantum algorithms involving thousands of logical qubits can be performed using less than $10^5$ physical qubits. Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale, based on current experimental technologies.

quant-ph↗

High-fidelity parallel entangling gates on a neutral atom quantum computer

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral atom arrays have recently emerged as a promising quantum computing platform, featuring coherent control over hundreds of qubits and any-to-any gate connectivity in a flexible, dynamically reconfigurable architecture. The major outstanding challenge has been to reduce errors in entangling operations mediated through Rydberg interactions. Here we report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel, surpassing the surface code threshold for error correction. Our method employs fast single-pulse gates based on optimal control, atomic dark states to reduce scattering, and improvements to Rydberg excitation and atom cooling. We benchmark fidelity using several methods based on repeated gate applications, characterize the physical error sources, and outline future improvements. Finally, we generalize our method to design entangling gates involving a higher number of qubits, which we demonstrate by realizing low-error three-qubit gates. By enabling high-fidelity operation in a scalable, highly connected system, these advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.

quant-ph↗

Fermionic quantum processing with programmable neutral atom arrays

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding non-local fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement non-local tunneling gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation, as well as to simulate lattice gauge theory dynamics.

quant-ph↗

Evolution of $1/f$ Flux Noise in Superconducting Qubits with Weak Magnetic Fields

The microscopic origin of $1/f$ magnetic flux noise in superconducting circuits has remained an open question for several decades despite extensive experimental and theoretical investigation. Recent progress in superconducting devices for quantum information has highlighted the need to mitigate sources of qubit decoherence, driving a renewed interest in understanding the underlying noise mechanism(s). Though a consensus has emerged attributing flux noise to surface spins, their identity and interaction mechanisms remain unclear, prompting further study. Here we apply weak in-plane magnetic fields to a capacitively-shunted flux qubit (where the Zeeman splitting of surface spins lies below the device temperature) and study the flux-noise-limited qubit dephasing, revealing previously unexplored trends that may shed light on the dynamics behind the emergent $1/f$ noise. Notably, we observe an enhancement (suppression) of the spin-echo (Ramsey) pure dephasing time in fields up to $B=100~\text{G}$. With direct noise spectroscopy, we further observe a transition from a $1/f$ to approximately Lorentzian frequency dependence below 10 Hz and a reduction of the noise above 1 MHz with increasing magnetic field. We suggest that these trends are qualitatively consistent with an increase of spin cluster sizes with magnetic field. These results should help to inform a complete microscopic theory of $1/f$ flux noise in superconducting circuits.

cond-mat.mes-hall↗

Probing many-body dynamics in a two dimensional dipolar spin ensemble

The most direct approach for characterizing the quantum dynamics of a strongly-interacting system is to measure the time-evolution of its full many-body state. Despite the conceptual simplicity of this approach, it quickly becomes intractable as the system size grows. An alternate framework is to think of the many-body dynamics as generating noise, which can be measured by the decoherence of a probe qubit. Our work centers on the following question: What can the decoherence dynamics of such a probe tell us about the many-body system? In particular, we utilize optically addressable probe spins to experimentally characterize both static and dynamical properties of strongly-interacting magnetic dipoles. Our experimental platform consists of two types of spin defects in diamond: nitrogen-vacancy (NV) color centers (probe spins) and substitutional nitrogen impurities (many-body system). We demonstrate that signatures of the many-body system's dimensionality, dynamics, and disorder are naturally encoded in the functional form of the NV's decoherence profile. Leveraging these insights, we directly characterize the two-dimensional nature of a nitrogen delta-doped diamond sample. In addition, we explore two distinct facets of the many-body dynamics: First, we address a persistent debate about the microscopic nature of spin dynamics in strongly-interacting dipolar systems. Second, we demonstrate direct control over the correlation time of the many-body system. Finally, we demonstrate polarization exchange between NV and P1 centers, opening the door to quantum sensing and simulation using two-dimensional spin-polarized ensembles.

quant-ph↗

Protocols for Rydberg entangling gates featuring robustness against quasi-static errors

We introduce a novel family of protocols for entangling gates for neutral atom qubits based on the Rydberg blockade mechanism. These protocols realize controlled-phase gates through a series of global laser pulses that are on resonance with the Rydberg excitation frequency. We analyze these protocols with respect to their robustness against calibration errors of the Rabi frequency or shot-to-shot laser intensity fluctuations, and show that they display robustness in various fidelity measures. In addition, we discuss adaptations of these protocols in order to make them robust to atomic-motion-induced Doppler shifts as well.

quant-ph↗

Reporter-spin-assisted T1 relaxometry

A single spin quantum sensor can quantitatively detect and image fluctuating electromagnetic fields via their effect on the sensor spin's relaxation time, thus revealing important information about the target solid-state or molecular structures. However, the sensitivity and spatial resolution of spin relaxometry are often limited by the distance between the sensor and target. Here, we propose an alternative approach that leverages an auxiliary reporter spin in conjunction with a single spin sensor, a diamond nitrogen vacancy (NV) center. We show that this approach can realize a 10^4 measurement speed improvement for realistic working conditions and we experimentally verify the proposed method using a single shallow NV center. Our work opens up a broad path of inquiry into a range of possible spin systems that can serve as relaxation sensors without the need for optical initialization and readout capabilities.

quant-ph↗

Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms

Neutral atom arrays have recently emerged as a promising platform for quantum information processing. One important remaining roadblock for the large-scale application of these systems is the ability to perform error-corrected quantum operations. To entangle the qubits in these systems, atoms are typically excited to Rydberg states, which could decay or give rise to various correlated errors that cannot be addressed directly through traditional methods of fault-tolerant quantum computation. In this work, we provide the first complete characterization of these sources of error in a neutral-atom quantum computer and propose hardware-efficient, fault-tolerant quantum computation schemes that mitigate them. Notably, we develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. These advances allow us to significantly reduce the resource cost for fault-tolerant quantum computation compared to existing, general-purpose schemes. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.

quant-ph↗

Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the Maximum Independent Set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find the problem hardness is controlled by the solution degeneracy and number of local minima, and experimentally benchmark the quantum algorithm's performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

quant-ph↗

A quantum processor based on coherent transport of entangled atom arrays

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally, constrained by the connectivity associated with their fixed spatial layout. Here, we demonstrate a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner across two spatial dimensions, in between layers of single- and two-qubit operations. Our approach makes use of neutral atom arrays trapped and transported by optical tweezers; hyperfine states are used for robust quantum information storage, and excitation into Rydberg states is used for entanglement generation. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state. Furthermore, we shuttle entangled ancilla arrays to realize a surface code with 19 qubits and a toric code state on a torus with 24 qubits. Finally, we use this architecture to realize a hybrid analog-digital evolution and employ it for measuring entanglement entropy in quantum simulations, experimentally observing non-monotonic entanglement dynamics associated with quantum many-body scars. Realizing a long-standing goal, these results pave the way toward scalable quantum processing and enable new applications ranging from simulation to metrology.

quant-ph↗

Dispersive optical systems for scalable Raman driving of hyperfine qubits

Hyperfine atomic states are among the most promising candidates for qubit encoding in quantum information processing. In atomic systems, hyperfine transitions are typically driven through a two-photon Raman process by a laser field which is amplitude modulated at the hyperfine qubit frequency. Here, we introduce a new method for generating amplitude modulation by phase modulating a laser and reflecting it from a highly dispersive optical element known as a chirped Bragg grating (CBG). This approach is passively stable, offers high efficiency, and is compatible with high-power laser sources, enabling large Rabi frequencies and improved quantum coherence. We benchmark this new approach by globally driving an array of $\sim 300$ neutral $^{87}$Rb atomic qubits trapped in optical tweezers, and obtain Rabi frequencies of 2 MHz with photon-scattering error rates of $< 2 \times 10^{-4}$ per $π$-pulse. This robust approach can be directly integrated with local addressing optics in both neutral atom and trapped ion systems to facilitate high-fidelity single-qubit operations for quantum information processing.

quant-ph↗

Probing Topological Spin Liquids on a Programmable Quantum Simulator

Quantum spin liquids, exotic phases of matter with topological order, have been a major focus of explorations in physical science for the past several decades. Such phases feature long-range quantum entanglement that can potentially be exploited to realize robust quantum computation. We use a 219-atom programmable quantum simulator to probe quantum spin liquid states. In our approach, arrays of atoms are placed on the links of a kagome lattice and evolution under Rydberg blockade creates frustrated quantum states with no local order. The onset of a quantum spin liquid phase of the paradigmatic toric code type is detected by evaluating topological string operators that provide direct signatures of topological order and quantum correlations. Its properties are further revealed by using an atom array with nontrivial topology, representing a first step towards topological encoding. Our observations enable the controlled experimental exploration of topological quantum matter and protected quantum information processing.

quant-ph↗

Probing spin dynamics on diamond surfaces using a single quantum sensor

Understanding the dynamics of a quantum bit's environment is essential for the realization of practical systems for quantum information processing and metrology. We use single nitrogen-vacancy (NV) centers in diamond to study the dynamics of a disordered spin ensemble at the diamond surface. Specifically, we tune the density of "dark" surface spins to interrogate their contribution to the decoherence of shallow NV center spin qubits. When the average surface spin spacing exceeds the NV center depth, we find that the surface spin contribution to the NV center free induction decay can be described by a stretched exponential with variable power n. We show that these observations are consistent with a model in which the spatial positions of the surface spins are fixed for each measurement, but some of them reconfigure between measurements. In particular, we observe a depth-dependent critical time associated with a dynamical transition from Gaussian (n=2) decay to n=2/3, and show that this transition arises from the competition between the small decay contributions of many distant spins and strong coupling to a few proximal spins at the surface. These observations demonstrate the potential of a local sensor for understanding complex systems and elucidate pathways for improving and controlling spin qubits at the surface.

quant-ph↗