Computing quantum magic of state vectors

• URL: http://arxiv.org/abs/2601.07824v2
• Date: Tue, 13 Jan 2026 18:54:47 GMT
• Title: Computing quantum magic of state vectors
• Authors: Piotr Sierant, Jofre Vallès-Muns, Artur Garcia-Saez,
• Abstract summary: Non-stabilizerness, also known as magic,'' quantifies how far a quantum state departs from the stabilizer set.<n>Standard magic quantifiers, such as the stabilizer Rényi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically.<n>Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet standard magic quantifiers, such as the stabilizer Rényi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically, with the computational complexity growing rapidly with the number $N$ of qudits. Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits ($d=2$) and the mana for qutrits ($d=3$) for pure states given as state vectors. Our methods compute SRE and mana at cost $O(N d^{2N})$, providing an exponential improvement over the naive $O(d^{3N})$ scaling, with substantial parallelism and straightforward GPU acceleration. We further show how to combine the fast Hadamard transform with Monte Carlo sampling to estimate the SRE of state vectors, and we extend the approach to compute the mana of mixed states. All algorithms are implemented in the open-source Julia package HadaMAG ( https://github.com/bsc-quantic/HadaMAG.jl/ ), which provides a high-performance toolbox for computing SRE and mana with built-in support for multithreading, MPI-based distributed parallelism, and GPU acceleration. The package, together with the methods developed in this work, offers a practical route to large-scale numerical studies of magic in quantum many-body systems.

Related papers

• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• A fast and exact approach for stabilizer Rényi entropy via the XOR-FWHT algorithm [0.5735035463793009]
  Quantum advantage is widely understood to rely on key quantum resources beyond entanglement.<n>However, a direct brute-force of all Pauli strings and the corresponding expectation values from a length-$2N$ state vector, where $N$ is the system size, yields an overall computational cost scaling as $O(8N)$.<n>Here we reformulate the second-order stabilizer Rényi entropy in a bitstring language, expose an underlying XOR-convolution structure on $mathbb ZN$, and reduce the computation to $2N$ fast Walsh-Hadamard transforms of length
  arXiv  Detail & Related papers  (2025-12-31T07:35:47Z)
• An end-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage [0.4618037115403289]
  We develop a novel algorithm for the incompressible lattice Boltzmann equation.<n>We find that for an end-to-end problem, a modest quantum advantage may be preserved for selected observables.<n>Our results give robust evidence that small, but nontrivial, quantum advantages can be achieved in the context of CFD.
  arXiv  Detail & Related papers  (2025-12-03T13:03:08Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Improved Quantum Lattice Boltzmann Method for Advection-Diffusion Equations with a Linear Collision Model [16.868124747083375]
  We propose an ancilla free quantum lattice Boltzmann method for advection-diffusion equations.<n>There is no need to perform quantum state tomography in each previous loop, if the macroscopic variables for a certain loop are needed.<n>The numerical simulations of the $DQ_3$ and $DQ_5$ models have confirmed the feasibility of the proposed algorithm.
  arXiv  Detail & Related papers  (2025-04-18T02:42:31Z)
• Efficient mutual magic and magic capacity with matrix product states [0.0]
  We introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time.<n>We find that mutual SRE characterizes the critical point of ground states of the transverse-field Ising model.<n>The magic capacity characterizes transitions in the ground state of the Heisenberg and Ising model, randomness of Clifford+T circuits, and distinguishes typical and atypical states.
  arXiv  Detail & Related papers  (2025-04-09T19:12:26Z)
• Distributed quantum algorithm for divergence estimation and beyond [12.925989807145301]
  We propose a distributed quantum algorithm framework to compute $rm Tr(f(A)g(B))$ within an additive error $varepsilon$.<n>This framework holds broad applicability across a range of distributed quantum computing tasks.
  arXiv  Detail & Related papers  (2025-03-12T14:28:22Z)
• Circuit Partitioning and Full Circuit Execution: A Comparative Study of GPU-Based Quantum Circuit Simulation [0.0]
  Executing large quantum circuits is not feasible using the currently available NISQ (noisy intermediate-scale quantum) devices.<n>This study presents a comparative analysis of two simulation methods: circuit-splitting and full-circuit execution using distributed memory.<n>Results indicate that full-circuit executions are faster than circuit-splitting for simulations performed on a single node.
  arXiv  Detail & Related papers  (2025-02-17T03:04:43Z)
• Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes [43.96687298077534]
  The distance of a stabilizer quantum code determines the number of errors that can be detected and corrected.<n>We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code.
  arXiv  Detail & Related papers  (2024-08-20T11:24:30Z)
• Handbook for Quantifying Robustness of Magic [0.0]
  Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation. We present efficient novel algorithms to compute the RoM. We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
  arXiv  Detail & Related papers  (2023-11-02T16:15:00Z)
• Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel Optimization [43.74656748515853]
  Non-stationary multi-block bilevel optimization problems involve $mgg 1$ lower level problems and have important applications in machine learning. We aim to achieve three properties for our algorithm: a) matching the state-of-the-art complexity of standard BO problems with a single block; (b) achieving parallel speedup by sampling $I$ samples for each sampled block per-iteration; and (c) avoiding the computation of the inverse of a high-dimensional Hessian matrix estimator.
  arXiv  Detail & Related papers  (2023-05-30T04:10:11Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Batch-efficient EigenDecomposition for Small and Medium Matrices [65.67315418971688]
  EigenDecomposition (ED) is at the heart of many computer vision algorithms and applications. We propose a QR-based ED method dedicated to the application scenarios of computer vision.
  arXiv  Detail & Related papers  (2022-07-09T09:14:12Z)
• Quantum Support Vector Machine without Iteration [17.384061512750158]
  This paper proposes a quantum support vector machine (LS-QSVM) based on the generalized quantum amplitude estimation (AE-QSVM) Experiments demonstrate that AE-QSVM is advantageous in terms of training matrix, the number of iterations, space complexity, and time complexity.
  arXiv  Detail & Related papers  (2022-06-02T07:57:39Z)
• 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)

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.