NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing

• URL: http://arxiv.org/abs/2609.14478v1
• Date: Sun, 13 Sep 2026 12:34:19 GMT
• Title: NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing
• Abstract summary: We propose NAQsim, an open-source simulation framework for neutral-atom quantum computing platforms.<n> NAQsim enables detailed full-stack architecture evaluation that opens opportunities to explore performance bottlenecks.<n>D3-ROT achieves a 2.27x speedup from a single bottleneck alone, with minimal footprint overhead.
• Score: 1.3960780636110082
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Technological advances in neutral-atom platforms have opened a new path toward designing efficient protocols for fault-tolerant quantum computing (FTQC). However, each physical operation is still orders of magnitude slower than on other platforms, such as superconducting qubits. Therefore, architects must identify fast and efficient FTQC architectures, which require reliable modeling tools to explore various design choices across the software, classical hardware, and quantum device stacks of neutral-atom platforms. In this paper, we propose NAQsim, an open-source simulation framework for neutral-atom FTQC architectures based on transversal gates. As its key feature, NAQsim enables detailed full-stack architecture evaluation that opens opportunities to explore previously overlooked performance bottlenecks. As a first use case for NAQsim, we identify one such bottleneck, patch rotations, perform full-stack co-optimization, and finally derive a near-rotation-free architecture (D3-ROT). For practical FTQC benchmark workloads, D3-ROT achieves a 2.27x speedup from this single bottleneck alone, with minimal footprint overhead. These results point to a much broader space of full-stack optimizations that NAQsim makes accessible for transversal surface-code architectures and beyond.

Related papers

• Optimizing Atom Transport, Gate-Count and Depth with Parity Twine [0.0]
  We present an efficient implementation of the Parity Architecture for neutral-atom quantum processors.<n>We adapt Parity Twine Networks (PTNs) to different atom layouts, native entangling gates, and atom-shuttling capabilities.
  arXiv  Detail & Related papers  (2026-09-03T09:31:16Z)
• NAS-Driven Hardware Accelerator Exploration for Edge AI and Quantization Effects on the Pareto Space [0.0]
  Edge AI deployment demands neural architectures that are simultaneously accurate, computationally efficient, and hardware-deployable.<n>NAS is a challenge addressed by hardware-aware Neural Architecture Search (NAS)<n>Recent works incorporate quantization directly into the NAS loop, but these approaches expand search complexity and tightly couple architecture and quantization design.<n>No framework combines quantized architecture mapping onto reconfigurable accelerators with automated hardware exploration.
  arXiv  Detail & Related papers  (2026-08-13T14:26:08Z)
• Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study [0.0]
  We present an architecture-algom co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware.<n>Our analysis identifies reaction-limited operation and demand as primary drivers of resource estimation and establishes a generalizable foundation for primitive-based architectural studies.
  arXiv  Detail & Related papers  (2026-05-14T18:11:04Z)
• High-Performance and Scalable Fault-Tolerant Quantum Computation with Lattice Surgery on a 2.5D Architecture [0.5779598097190628]
  We propose a high-performance and low-overhead FTQC architecture based on lattice surgery (LS) using surface code (SC) The proposed Bypass architecture is a 2.5-dimensional architecture consisting of dense and sparse qubit layers. The results show that the Bypass architecture improves the fidelity of FTQC and both a 1.73x speedup and a 17% reduction in classical/quantum hardware resources.
  arXiv  Detail & Related papers  (2024-11-26T15:27:59Z)
• 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)
• Mechanistic Design and Scaling of Hybrid Architectures [114.3129802943915]
  We identify and test new hybrid architectures constructed from a variety of computational primitives. We experimentally validate the resulting architectures via an extensive compute-optimal and a new state-optimal scaling law analysis. We find MAD synthetics to correlate with compute-optimal perplexity, enabling accurate evaluation of new architectures.
  arXiv  Detail & Related papers  (2024-03-26T16:33:12Z)
• FlowNAS: Neural Architecture Search for Optical Flow Estimation [65.44079917247369]
  We propose a neural architecture search method named FlowNAS to automatically find the better encoder architecture for flow estimation task. Experimental results show that the discovered architecture with the weights inherited from the super-network achieves 4.67% F1-all error on KITTI.
  arXiv  Detail & Related papers  (2022-07-04T09:05:25Z)
• 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)
• Weak NAS Predictors Are All You Need [91.11570424233709]
  Recent predictor-based NAS approaches attempt to solve the problem with two key steps: sampling some architecture-performance pairs and fitting a proxy accuracy predictor. We shift the paradigm from finding a complicated predictor that covers the whole architecture space to a set of weaker predictors that progressively move towards the high-performance sub-space. Our method costs fewer samples to find the top-performance architectures on NAS-Bench-101 and NAS-Bench-201, and it achieves the state-of-the-art ImageNet performance on the NASNet search space.
  arXiv  Detail & Related papers  (2021-02-21T01:58:43Z)
• 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)
• Once Quantization-Aware Training: High Performance Extremely Low-bit Architecture Search [112.05977301976613]
  We propose to combine Network Architecture Search methods with quantization to enjoy the merits of the two sides. We first propose the joint training of architecture and quantization with a shared step size to acquire a large number of quantized models. Then a bit-inheritance scheme is introduced to transfer the quantized models to the lower bit, which further reduces the time cost and improves the quantization accuracy.
  arXiv  Detail & Related papers  (2020-10-09T03:52:16Z)

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.