Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms

• URL: http://arxiv.org/abs/2411.11784v3
• Date: Fri, 06 Dec 2024 20:42:58 GMT
• Title: Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms
• Authors: Wan-Hsuan Lin, Daniel Bochen Tan, Jason Cong,
• Abstract summary: We propose ZAC, a scalable compiler for zoned architectures.<n>ZAC minimizes data movement overhead between zones with qubit reuse.<n>ZAC achieves a 22x improvement in fidelity compared to monolithic architectures.
• Score: 5.9674479510253535
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing architectures based on neutral atoms offer large scales and high-fidelity operations. They can be heterogeneous, with different zones for storage, entangling operations, and readout. Zoned architectures improve computation fidelity by shielding idling qubits in storage from side-effect noise, unlike monolithic architectures where all operations occur in a single zone. However, supporting these flexible architectures with efficient compilation remains challenging. In this paper, we propose ZAC, a scalable compiler for zoned architectures. ZAC minimizes data movement overhead between zones with qubit reuse, i.e., keeping them in the entanglement zone if an immediate entangling operation is pending. Other innovations include novel data placement and instruction scheduling strategies in ZAC, a flexible specification of zoned architectures, and an intermediate representation for zoned architectures, ZAIR. Our evaluation shows that zoned architectures equipped with ZAC achieve a 22x improvement in fidelity compared to monolithic architectures. Moreover, ZAC is shown to have a 10% fidelity gap on average compared to the ideal solution. This significant performance enhancement enables more efficient and reliable quantum circuit execution, enabling advancements in quantum algorithms and applications. ZAC is open source at https://github.com/UCLA-VAST/ZAC

Related papers

• Rethinking Autoregressive Models for Lossless Image Compression via Hierarchical Parallelism and Progressive Adaptation [75.58269386927076]
  Autoregressive (AR) models are often dismissed as impractical due to prohibitive computational cost.<n>This work re-thinks this paradigm, introducing a framework built on hierarchical parallelism and progressive adaptation.<n> Experiments on diverse datasets (natural, satellite, medical) validate that our method achieves new state-of-the-art compression.
  arXiv  Detail & Related papers  (2025-11-14T06:27:58Z)
• From Loop Nests to Silicon: Mapping AI Workloads onto AMD NPUs with MLIR-AIR [6.2957456904504525]
  General-purpose compilers abstract away parallelism, locality, and synchronization, limiting their effectiveness on modern spatial architectures.<n>We introduce MLIR-AIR, a novel, open-source compiler stack built on MLIR.<n>We demonstrate MLIR-AIR's capabilities through two case studies: matrix multiplication and the multi-head attention block from the LLaMA 2 model.
  arXiv  Detail & Related papers  (2025-10-16T16:49:05Z)
• Orchestrating Multi-Zone Shuttling in Trapped-Ion Quantum Computers [3.3406796723412615]
  Trapped-ion quantum computers offer high-quality qubits with long coherence times and high-fidelity gate operations.<n>The Quantum Charge Coupled Device (QCCD) architecture provides a scalable blueprint by leveraging the ability to shuttle ions between distinct zones.<n>We propose a compilation strategy for QCCD architectures with multiple processing zones located outside a grid-type memory zone.
  arXiv  Detail & Related papers  (2025-05-12T18:00:01Z)
• Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction [0.9199465050084297]
  This work presents a novel unifying abstraction, called the position graph, for different types of hardware architectures. We model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures and enable high-quality, superconducting scalable compilation methods. This approach generates native, executable circuits and ion instructions on the hardware that adheres to the physical constraints of shuttling-based quantum computers.
  arXiv  Detail & Related papers  (2025-01-21T19:39:03Z)
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing [0.4486093197820338]
  We propose an FTQC architecture based on a novel floorplan strategy, which can achieve almost 100% memory density. The idea behind our architecture is to separate all memory regions into small computational space called Computational Registers (CR) and space-efficient memory space called Scan-Access Memory (SAM)
  arXiv  Detail & Related papers  (2024-12-29T14:58:23Z)
• ZAP: Zoned Architecture and Parallelizable Compiler for Field Programmable Atom Array [9.421018957499186]
  We present a novel zoned architecture for neutral atom quantum compilation. Our method achieves a 5.4x increase in fidelity when the system need 100 qubits.
  arXiv  Detail & Related papers  (2024-11-21T11:39:21Z)
• AsCAN: Asymmetric Convolution-Attention Networks for Efficient Recognition and Generation [48.82264764771652]
  We introduce AsCAN -- a hybrid architecture, combining both convolutional and transformer blocks. AsCAN supports a variety of tasks: recognition, segmentation, class-conditional image generation. We then scale the same architecture to solve a large-scale text-to-image task and show state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-11-07T18:43:17Z)
• Comparison of Superconducting NISQ Architectures [0.0]
  We study superconducting architectures including Google's Sycamore, IBM's Heavy-Hex, Rigetti's Aspen, and Ankaa. We also study compilation tools that target these architectures.
  arXiv  Detail & Related papers  (2024-09-03T17:12:08Z)
• An Abstract Model and Efficient Routing for Logical Entangling Gates on Zoned Neutral Atom Architectures [4.306566710489809]
  Recent achievements have demonstrated the potential of neutral atom architectures for fault-tolerant quantum computing. This paper provides an abstract model of the novel architecture and an efficient solution to the routing problem of entangling gates. In addition to that, we consider logical qubit arrays, each of which encodes one logical qubit.
  arXiv  Detail & Related papers  (2024-05-13T18: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)
• A Many-ported and Shared Memory Architecture for High-Performance ADAS SoCs [11.760927352147798]
  We present a shared memory architecture that enables high data throughput among native parallel accesses to ADAS applications. The results validate that the proposed architecture provides close to 100% throughput for both read and write accesses. It can also provide consistent to the domain specific payloads while enabling the scalability and modularity of the design.
  arXiv  Detail & Related papers  (2022-09-13T04:58:27Z)
• Generalizing Few-Shot NAS with Gradient Matching [165.5690495295074]
  One-Shot methods train one supernet to approximate the performance of every architecture in the search space via weight-sharing. Few-Shot NAS reduces the level of weight-sharing by splitting the One-Shot supernet into multiple separated sub-supernets. It significantly outperforms its Few-Shot counterparts while surpassing previous comparable methods in terms of the accuracy of derived architectures.
  arXiv  Detail & Related papers  (2022-03-29T03:06:16Z)
• Rethinking Architecture Selection in Differentiable NAS [74.61723678821049]
  Differentiable Neural Architecture Search is one of the most popular NAS methods for its search efficiency and simplicity. We propose an alternative perturbation-based architecture selection that directly measures each operation's influence on the supernet. We find that several failure modes of DARTS can be greatly alleviated with the proposed selection method.
  arXiv  Detail & Related papers  (2021-08-10T00:53:39Z)
• iDARTS: Differentiable Architecture Search with Stochastic Implicit Gradients [75.41173109807735]
  Differentiable ARchiTecture Search (DARTS) has recently become the mainstream of neural architecture search (NAS) We tackle the hypergradient computation in DARTS based on the implicit function theorem. We show that the architecture optimisation with the proposed method, named iDARTS, is expected to converge to a stationary point.
  arXiv  Detail & Related papers  (2021-06-21T00:44:11Z)
• Towards Accurate and Compact Architectures via Neural Architecture Transformer [95.4514639013144]
  It is necessary to optimize the operations inside an architecture to improve the performance without introducing extra computational cost. We have proposed a Neural Architecture Transformer (NAT) method which casts the optimization problem into a Markov Decision Process (MDP) We propose a Neural Architecture Transformer++ (NAT++) method which further enlarges the set of candidate transitions to improve the performance of architecture optimization.
  arXiv  Detail & Related papers  (2021-02-20T09:38:10Z)
• Stage-Wise Neural Architecture Search [65.03109178056937]
  Modern convolutional networks such as ResNet and NASNet have achieved state-of-the-art results in many computer vision applications. These networks consist of stages, which are sets of layers that operate on representations in the same resolution. It has been demonstrated that increasing the number of layers in each stage improves the prediction ability of the network. However, the resulting architecture becomes computationally expensive in terms of floating point operations, memory requirements and inference time.
  arXiv  Detail & Related papers  (2020-04-23T14:16:39Z)

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.