Qimax: Efficient quantum simulation via GPU-accelerated extended stabilizer formalism

• URL: http://arxiv.org/abs/2505.03307v1
• Date: Tue, 06 May 2025 08:41:28 GMT
• Title: Qimax: Efficient quantum simulation via GPU-accelerated extended stabilizer formalism
• Authors: Vu Tuan Hai, Bui Cao Doanh, Le Vu Trung Duong, Pham Hoai Luan, Yasuhiko Nakashima,
• Abstract summary: Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular.<n>We introduce a parallelized version of the extended stabilizer formalism, enabling efficient execution on multi-core devices such as GPU.
• Score: 0.4427312315598971
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can solve the same problems with fewer computational resources, as it operates on stabilizers rather than full state vectors. Most existing studies on near-Clifford circuits focus on balancing the trade-off between the number of ancilla qubits and simulation accuracy, often overlooking performance considerations. Furthermore, in the presence of high-rank stabilizers, performance is limited by the sequential property of the stabilizer formalism. In this work, we introduce a parallelized version of the extended stabilizer formalism, enabling efficient execution on multi-core devices such as GPU. Experimental results demonstrate that, in certain scenarios, our Python-based implementation outperforms state-of-the-art simulators such as Qiskit and Pennylane.

Related papers

• STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation [14.727423336101864]
  We present a GPU-accelerated tableau stabilizer simulator that scales efficiently in direct circuit simulation.<n>We show how the simulator is used to quickly calculate Pauli commutation groupings between Pauli strings to reduce the number of circuit runs in quantum chemistry problems.<n>We also present a Clifford+T circuit transpiler based on STABSim, which uses the simulator framework to track relations in non-Clifford rotations.
  arXiv  Detail & Related papers  (2025-07-03T18:05:19Z)
• Stabilizer-Accelerated Quantum Many-Body Ground-State Estimation [0.0]
  We investigate how the stabilizer formalism, in particular highly-entangled stabilizer states, can be used to describe the emergence of many-body shape collectivity.<n>The resulting stabilizer ground state is found to capture to a large extent both bi-partite and collective multi-partite entanglement features.
  arXiv  Detail & Related papers  (2025-05-05T18:01:20Z)
• Towards Stabilized and Efficient Diffusion Transformers through Long-Skip-Connections with Spectral Constraints [51.83081671798784]
  Diffusion Transformers (DiT) have emerged as a powerful architecture for image and video generation, offering superior quality and scalability.<n>DiT's practical application suffers from inherent dynamic feature instability, leading to error amplification during cached inference.<n>We propose Skip-DiT, an image and video generative DiT variant enhanced with Long-Skip-Connections (LSCs) - the key efficiency component in U-Nets.
  arXiv  Detail & Related papers  (2024-11-26T17:28:10Z)
• Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing [0.9935277311162707]
  We develop a rule-book and a tableau simulator for arbitrary stabilizer manipulations of cluster states. We extend our graphical rule-book to include dual-rail photonic-qubit cluster state manipulations. We show how stabilizer descriptions of multi-qubit fusions can be mapped linear optical circuits.
  arXiv  Detail & Related papers  (2023-12-04T22:40:24Z)
• Bases for optimising stabiliser decompositions of quantum states [14.947570152519281]
  We introduce and study the vector space of linear dependencies of $n$-qubit stabiliser states. We construct elegant bases of linear dependencies of constant size three. We use them to explicitly compute the stabiliser extent of states of more qubits than is feasible with existing techniques.
  arXiv  Detail & Related papers  (2023-11-29T06:30:05Z)
• Fast algorithms for classical specifications of stabiliser states and Clifford gates [14.947570152519281]
  Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of classical algorithms in quantum information.<n>We develop novel mathematical insights concerning stabiliser states and Clifford gates that significantly clarify their descriptions.<n>We then utilise these to provide ten new fast algorithms which offer advantages over any existing implementations.
  arXiv  Detail & Related papers  (2023-11-17T07:09:10Z)
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions [3.9482012852779085]
  Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability.<n>We propose a novel classical simulation method for qubit Clifford circuits based on the framed Wigner function.
  arXiv  Detail & Related papers  (2023-07-31T14:02:33Z)
• Efficient quantum algorithms for stabilizer entropies [0.0]
  We efficiently measure stabilizer entropies (SEs) for integer R'enyi index $n>1$ via Bell measurements. We provide efficient bounds of various nonstabilizerness monotones which are intractable to compute beyond a few qubits. Our results open up the exploration of nonstabilizerness with quantum computers.
  arXiv  Detail & Related papers  (2023-05-30T15:55:04Z)
• Dissipative preparation and stabilization of many-body quantum states in a superconducting qutrit array [55.41644538483948]
  We present and analyze a protocol for driven-dissipatively preparing and stabilizing a manifold of quantum manybody entangled states. We perform theoretical modeling of this platform via pulse-level simulations based on physical features of real devices. Our work shows the capacity of driven-dissipative superconducting cQED systems to host robust and self-corrected quantum manybody states.
  arXiv  Detail & Related papers  (2023-03-21T18:02:47Z)
• Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees [57.67528738886731]
  We study the numerical stability of scalable sparse approximations based on inducing points. For low-dimensional tasks such as geospatial modeling, we propose an automated method for computing inducing points satisfying these conditions.
  arXiv  Detail & Related papers  (2022-10-14T15:20:17Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
  We show how to efficiently simplify stabilizer states to canonical form. We characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
  arXiv  Detail & Related papers  (2021-09-20T05:56:25Z)
• Stabilizer extent is not multiplicative [1.491109220586182]
  Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. An important open problem is to decide whether the extent is multiplicative under tensor products.
  arXiv  Detail & Related papers  (2020-07-08T18:41:59Z)
• Learning Stabilizing Controllers for Unstable Linear Quadratic Regulators from a Single Trajectory [85.29718245299341]
  We study linear controllers under quadratic costs model also known as linear quadratic regulators (LQR) We present two different semi-definite programs (SDP) which results in a controller that stabilizes all systems within an ellipsoid uncertainty set. We propose an efficient data dependent algorithm -- textsceXploration -- that with high probability quickly identifies a stabilizing controller.
  arXiv  Detail & Related papers  (2020-06-19T08:58:57Z)

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.