Faster computation of nonstabilizerness

• URL: http://arxiv.org/abs/2406.16673v3
• Date: Thu, 06 Feb 2025 05:13:11 GMT
• Title: Faster computation of nonstabilizerness
• Authors: Hiroki Hamaguchi, Kou Hamada, Naoki Marumo, Nobuyuki Yoshioka,
• Abstract summary: The stabilizer extent is a useful tool to estimate the simulation cost using rank-based simulators. We propose faster numerical algorithms to compute the stabilizer extent.
• Score: 3.8061090528695543
• License:
• Abstract: The characterization of nonstabilizerness is fruitful due to its application in gate synthesis and classical simulation. In particular, the resource monotone called the stabilizer extent is a useful tool to estimate the simulation cost using rank-based simulators, one of the state-of-the-art simulators of Clifford+$T$ circuits. In this work, we propose faster numerical algorithms to compute the stabilizer extent. Our algorithm utilizes the Column Generation method, which iteratively updates the subset of pure stabilizer states used for calculation. This subset is selected based on the overlaps between all stabilizer states and a target state. In order to update the subset, we make use of a newly proposed subroutine for calculating the stabilizer fidelity that (i) achieves linear time complexity with respect to the number of stabilizer states, (ii) super-exponentially reduces the space complexity by in-place calculation, and (iii) prunes unnecessary states for the computation. As a result, our algorithm can compute the stabilizer fidelity and the stabilizer extent for Haar random pure states up to $n=9$ qubits, which naively requires a memory of 305 EiB. We further show that our algorithm runs faster when the target state vector is real. We prove that the problem size is reduced by $\mathcal{O}(2^n)$ compared to the general cases, which makes it computable for the case of $n=10$ qubits.

Related papers

• Single-copy stabilizer testing [0.0]
  We consider the problem of testing whether an unknown $n$-qubit quantum state $|psirangle$ is a stabilizer state. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that $Omega(sqrtn)$ copies are required for any algorithm.
  arXiv  Detail & Related papers  (2024-10-10T14:39:47Z)
• 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)
• A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport [92.96250725599958]
  Kernel-based optimal transport (OT) estimators offer an alternative, functional estimation procedure to address OT problems from samples. We show that our SSN method achieves a global convergence rate of $O (1/sqrtk)$, and a local quadratic convergence rate under standard regularity conditions.
  arXiv  Detail & Related papers  (2023-10-21T18:48:45Z)
• Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function [99.31457740916815]
  Trust-region (TR) and adaptive regularization using cubics have proven to have some very appealing theoretical properties. We show that TR and ARC methods can simultaneously provide inexact computations of the Hessian, gradient, and function values.
  arXiv  Detail & Related papers  (2023-10-18T10:29:58Z)
• Improved Stabilizer Estimation via Bell Difference Sampling [0.43123403062068827]
  We study the complexity of learning quantum states in various models with respect to the stabilizer formalism. We prove that $Omega(n)$ $T$gates are necessary for any Clifford+$T$ circuit to prepare pseudorandom quantum states. We show that a modification of the above algorithm runs in time.
  arXiv  Detail & Related papers  (2023-04-27T01:58:28Z)
• 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)
• 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)
• A Momentum-Assisted Single-Timescale Stochastic Approximation Algorithm for Bilevel Optimization [112.59170319105971]
  We propose a new algorithm -- the Momentum- Single-timescale Approximation (MSTSA) -- for tackling problems. MSTSA allows us to control the error in iterations due to inaccurate solution to the lower level subproblem.
  arXiv  Detail & Related papers  (2021-02-15T07:10:33Z)
• 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.