Aicir: A Full-Stack Quantum Circuit Simulator with AscendNPU Support

• URL: http://arxiv.org/abs/2608.09733v1
• Date: Mon, 10 Aug 2026 15:33:46 GMT
• Title: Aicir: A Full-Stack Quantum Circuit Simulator with AscendNPU Support
• Abstract summary: We develop a full-stack quantum circuit simulator with a native Huawei Ascend NPU backend.<n>Aicir connects circuit construction, several state representations, measurement, differentiation, variational algorithms, quantum machine learning, and quantum architecture search.<n>We validated native execution with CPU fallback disabled and checked distributed communication and gradients on 2, 4, and 8 NPUs.
• Score: 7.490474290985344
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is a promising way to study problems that are difficult for classical methods, but current quantum hardware still faces limits in scale, noise, and fidelity. Running quantum algorithms on physical machines can also be costly. Quantum circuit simulators therefore remain important because they let researchers design and test algorithms on classical computers before using quantum hardware. Most high-performance simulators provide GPU backends, while few offer native support for NPUs. This gap limits the computing platforms available for quantum-algorithm research. We developed Aicir to provide a full-stack quantum circuit simulator with a native Huawei Ascend NPU backend. Aicir connects circuit construction, several state representations, measurement, differentiation, variational algorithms, quantum machine learning, and quantum architecture search through one programming model. It also supports noise simulation, tensor-network and matrix-product-state engines, and distributed state simulation. On the NPU, paired real tensors, fixed-rank gate views, and hardware-specific formulas keep the tested simulation paths on the device. The same representation lets Aicir partition a state across $2^{p}$ NPUs while retaining reverse-mode differentiation. We validated native execution with CPU fallback disabled and checked distributed communication and gradients on 2, 4, and 8 NPUs. For the tested fused layered circuits, Aicir's CPU runtime is within $0.97$--$1.28\times$ that of Qiskit Aer and $0.76$--$1.10\times$ that of Cirq. These results place its CPU execution in the same range as established simulators for this workload, while the NPU tests establish correct native execution rather than CPU-to-NPU speedup.

Related papers

• Scalable projected entangled-pair state representation of random quantum circuit states [0.0]
  We show the update of projected entangled-pair states (PEPSs) in the Vidal gauge that represent random quantum circuit states.<n>We find the universal scaling behaviors of the state fidelity by treating large-scale circuits ofn leq 104$, using $chi leq 128$ on a conventional CPU.
  arXiv  Detail & Related papers  (2025-04-07T06:47:48Z)
• Harnessing CUDA-Q's MPS for Tensor Network Simulations of Large-Scale Quantum Circuits [0.0]
  Current largest quantum computers feature more than one thousand qubits.<n>A more appealing approach for simulating quantum computers is adopting the network approach.<n>We show that network-based methods provide a significant opportunity to simulate large-qubit circuits.
  arXiv  Detail & Related papers  (2025-01-27T10:36:05Z)
• AMARETTO: Enabling Efficient Quantum Algorithm Emulation on Low-Tier FPGAs [0.6553587309274792]
  AMARETTO is designed for quantum computing emulation on low-tier Field-Programmable gate arrays (FPGAs) It simplifies and accelerates the verification of quantum algorithms using a Reduced-Instruction-Set-Computer (RISC)-like structure and efficient handling of sparse quantum gates.
  arXiv  Detail & Related papers  (2024-11-14T10:01:53Z)
• Benchmarking Quantum Red TEA on CPUs, GPUs, and TPUs [0.0]
  We benchmark simulations of many-body quantum systems on heterogeneous hardware platforms.<n>We compare different linear algebra backends, e.g., NumPy versus the PyTorch, JAX, or libraries.<n>We present a way to obtain speedups of a factor of 34 when tuning parameters on the CPU.
  arXiv  Detail & Related papers  (2024-09-05T18:00:01Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science [7.791505883503921]
  We present the NVIDIA cuQuantum SDK, a state-of-the-art library of composable primitives for GPU-accelerated quantum circuit simulations. The cuQuantum SDK was created to accelerate and scale up quantum circuit simulators developed by the quantum information science community.
  arXiv  Detail & Related papers  (2023-08-03T19:28:02Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• TensorLy-Quantum: Quantum Machine Learning with Tensor Methods [67.29221827422164]
  We create a Python library for quantum circuit simulation that adopts the PyTorch API. Ly-Quantum can scale to hundreds of qubits on a single GPU and thousands of qubits on multiple GPU.
  arXiv  Detail & Related papers  (2021-12-19T19:26:17Z)
• Fast quantum circuit simulation using hardware accelerated general purpose libraries [69.43216268165402]
  CuPy is a general purpose library (linear algebra) developed specifically for GPU-based quantum circuits. For supremacy circuits the speedup is around 2x, and for quantum multipliers almost 22x compared to state-of-the-art C++-based simulators.
  arXiv  Detail & Related papers  (2021-06-26T10:41:43Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits [0.0]
  We introduce the latest release of Intel Quantum Simulator (IQS), formerly known as qHiPSTER. The high-performance computing capability of the software allows users to leverage the available hardware resources. IQS allows to subdivide the computational resources to simulate a pool of related circuits in parallel.
  arXiv  Detail & Related papers  (2020-01-28T19:00:25Z)

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.