Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures

• URL: http://arxiv.org/abs/2111.06469v1
• Date: Thu, 11 Nov 2021 21:34:31 GMT
• Title: Exploiting Long-Distance Interactions and Tolerating Atom Loss in Neutral Atom Quantum Architectures
• Authors: Jonathan M. Baker, Andrew Litteken, Casey Duckering, Henry Hoffman, Hannes Bernien, Frederic T. Chong
• Abstract summary: We evaluate the advantages and disadvantages of a Neutral Atom (NA) architecture. NA systems offer several promising advantages such as long range interactions and native multiqubit gates. We propose hardware and compiler methods to increase system resilience to atom loss dramatically reducing total computation time.
• Score: 4.979871961444077
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum technologies currently struggle to scale beyond moderate scale prototypes and are unable to execute even reasonably sized programs due to prohibitive gate error rates or coherence times. Many software approaches rely on heavy compiler optimization to squeeze extra value from noisy machines but are fundamentally limited by hardware. Alone, these software approaches help to maximize the use of available hardware but cannot overcome the inherent limitations posed by the underlying technology. An alternative approach is to explore the use of new, though potentially less developed, technology as a path towards scalability. In this work we evaluate the advantages and disadvantages of a Neutral Atom (NA) architecture. NA systems offer several promising advantages such as long range interactions and native multiqubit gates which reduce communication overhead, overall gate count, and depth for compiled programs. Long range interactions, however, impede parallelism with restriction zones surrounding interacting qubit pairs. We extend current compiler methods to maximize the benefit of these advantages and minimize the cost. Furthermore, atoms in an NA device have the possibility to randomly be lost over the course of program execution which is extremely detrimental to total program execution time as atom arrays are slow to load. When the compiled program is no longer compatible with the underlying topology, we need a fast and efficient coping mechanism. We propose hardware and compiler methods to increase system resilience to atom loss dramatically reducing total computation time by circumventing complete reloads or full recompilation every cycle.

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Arctic: A Field Programmable Quantum Array Scheduling Technique [0.0]
  I present the first compiler pass designed to optimize reconfigurable coupling in zoned neutral atom architectures. I approach qubit mapping and movement scheduling as a max-cut and layered cross-minimization problem. I compare the method across various algorithms sourced from Supermarq and Qasmbench.
  arXiv  Detail & Related papers  (2024-05-10T01:56:01Z)
• Atomique: A Quantum Compiler for Reconfigurable Neutral Atom Arrays [19.543879449267372]
  We introduce Atomique, a compilation framework designed for qubit mapping, atom movement, and gate scheduling. Atomique consistently outperforms IBM Superconducting, FAA with long-range gates, and FAA with rectangular and triangular topologies.
  arXiv  Detail & Related papers  (2023-11-25T21:57:41Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Circuit decompositions and scheduling for neutral atom devices with limited local addressability [3.259051149249159]
  Current neutral atom architectures do not support local addressing of single-qubit rotations about an axis in the xy-plane of the Bloch sphere. We present an optimized compiler pipeline that translates an input circuit from an arbitrary gate set into a realistic neutral atom native gate set containing global gates.
  arXiv  Detail & Related papers  (2023-07-27T16:47:13Z)
• Efficient algorithms to solve atom reconfiguration problems. I. The redistribution-reconfiguration (red-rec) algorithm [51.02512563152503]
  We numerically quantify the performance of the red-rec algorithm, both in the absence and in the presence of loss. We show that the number of traps required to prepare a compact-centered configuration of atoms on a grid with a mean success probability of one half scales as the 3/2 power of the number of desired atoms. The red-rec algorithm admits an efficient implementation that can readily be deployed on real-time control systems.
  arXiv  Detail & Related papers  (2022-12-07T19:00:01Z)
• Reducing Runtime Overhead via Use-Based Migration in Neutral Atom Quantum Architectures [0.0]
  We develop strategies to combat the detrimental effects of lost computational space. We divide the architecture into separate sections, and run the circuit in each section, free of lost atoms. These techniques reduce the overall runtime by a total 50% for 30 qubit circuit.
  arXiv  Detail & Related papers  (2022-11-28T20:24:17Z)
• Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design [66.39546326221176]
  Attention-based neural networks have become pervasive in many AI tasks. The use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources. This paper proposes a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs.
  arXiv  Detail & Related papers  (2022-09-20T09:28:26Z)
• Optimized compiler for Distributed Quantum Computing [5.172201569251684]
  We model an optimization problem that combines running-time minimization with the usage of that resource. Specifically, we provide a parametric ILP formulation, where the parameter denotes a time horizon. We extend the formulation by introducing a predicate that manipulates the circuit given in input and parallelizes telegates' tasks.
  arXiv  Detail & Related papers  (2021-12-28T13:37:46Z)
• Enabling Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation [78.8942067357231]
  We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers.
  arXiv  Detail & Related papers  (2021-09-01T17:29:47Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. 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. 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.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.