Stabilizer Ranks, Barnes Wall Lattices and Magic Monotones

• URL: http://arxiv.org/abs/2503.04101v1
• Date: Thu, 06 Mar 2025 05:20:55 GMT
• Title: Stabilizer Ranks, Barnes Wall Lattices and Magic Monotones
• Authors: Amolak Ratan Kalra, Pulkit Sinha,
• Abstract summary: Kliuchnikov and Sch"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations.<n>We show the first quantitative lower bound on stabilizer fidelity as a function of stabilizer ranks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In 2024, Kliuchnikov and Sch\"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks. We show the first quantitative lower bound on stabilizer fidelity as a function of stabilizer ranks, which reproduces the linear-by-log lower bound for $\chi_{\delta}({|{H}\rangle^{ \otimes n}})$, i.e, on the approximate stabilizer rank of $|H\rangle^{\otimes n}$. In fact, we show that the lower bound holds even when the fidelity between the approximation and ${|H\rangle}^{\otimes n}$ is exponentially small, which is currently the best lower bound in this regime. Next, we define a new magic monotone for pure states, the Barnes Wall norm, and its corresponding approximate variant. We upper bound these monotones by the $CS$-count of state preparation, and also by the stabilizer ranks. In particular, the upper bound given by the $CS$-count is tight, in the sense that we exhibit states that achieve the bound. Apart from these results, we give a Fidelity Amplification algorithm, which provides a trade-off between approximation error and the stabilizer rank. As a corollary, it gives us a way to compose approximate stabilizer decompositions into approximate decompositions of their tensor products. Finally, we provide an alternate, elementary proof of the existence and density of product states with maximal stabilizer ranks, which was first proven by Lovitz and Steffan (2022), where they used results from algebraic geometry.

Related papers

• Improved bounds for testing low stabilizer complexity states [6.169364905804677]
  We improve the state-of-the-art parameters for the tolerant testing of stabilizer states. We also study the problem of testing low stabilizer rank states.
  arXiv  Detail & Related papers  (2024-10-31T17:56:57Z)
• Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems [56.86067111855056]
  We consider clipped optimization problems with heavy-tailed noise with structured density. We show that it is possible to get faster rates of convergence than $mathcalO(K-(alpha - 1)/alpha)$, when the gradients have finite moments of order. We prove that the resulting estimates have negligible bias and controllable variance.
  arXiv  Detail & Related papers  (2023-11-07T17:39:17Z)
• The Implicit Bias of Minima Stability in Multivariate Shallow ReLU Networks [53.95175206863992]
  We study the type of solutions to which gradient descent converges when used to train a single hidden-layer multivariate ReLU network with the quadratic loss. We prove that although shallow ReLU networks are universal approximators, stable shallow networks are not.
  arXiv  Detail & Related papers  (2023-06-30T09:17:39Z)
• Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach [6.169364905804677]
  The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. We improve the lower bound on the approximate rank to $tilde Omega(sqrt n)$ for a wide range of the approximation parameters.
  arXiv  Detail & Related papers  (2023-05-17T15:09:41Z)
• High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize [55.0090961425708]
  We propose a new, simplified high probability analysis of AdaGrad for smooth, non- probability problems. We present our analysis in a modular way and obtain a complementary $mathcal O (1 / TT)$ convergence rate in the deterministic setting. To the best of our knowledge, this is the first high probability for AdaGrad with a truly adaptive scheme, i.e., completely oblivious to the knowledge of smoothness.
  arXiv  Detail & Related papers  (2022-04-06T13:50:33Z)
• Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspective [49.17352150219212]
  Federated AveragingFedAvg, also known as Local SGD, is one of the most popular algorithms in Federated Learning (FL) We show how to analyze this quantity from the Differential Equation (SDE) perspective.
  arXiv  Detail & Related papers  (2021-11-05T22:16:11Z)
• New techniques for bounding stabilizer rank [0.0]
  We present number-theoretic and algebraic-geometric techniques for bounding the stabilizer rank of quantum states. We show an explicit sequence of product states with exponential stabilizer rank but approximate stabilizer rank, and to provide alternate (and simplified) proofs of the best-known lower bounds on stabilizer rank and approximate stabilizer rank.
  arXiv  Detail & Related papers  (2021-10-15T00:29:21Z)
• 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)
• Lower Bounds on Stabilizer Rank [3.265773263570237]
  We prove that for a sufficiently small constant $delta, the stabilizer rank of any state which is $$-close to those states is $Omega(sqrtn/log n)$. This is the first non-trivial lower bound for approximate stabilizer rank.
  arXiv  Detail & Related papers  (2021-06-06T19:27:51Z)
• Lower bound for the T count via unitary stabilizer nullity [8.810275100251681]
  We introduce measures to quantify the nonstabilizerness of multiqubit quantum gates. We establish lower bounds on the $T$ count for fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-03-18T03:16:46Z)
• Improved Strong Simulation of Universal Quantum Circuits [0.0]
  We find a scaling reduction in the stabilizer rank of the twelve-qubit tensored $T$ gate magic state. This lowers its bound to $2sim 0.463 t$ for multi-Pauli measurements on $t$ magic states. This constructively produces the most efficient strong simulation of the Clifford+$T$ gateset.
  arXiv  Detail & Related papers  (2020-12-21T23:13:20Z)
• A Simple Convergence Proof of Adam and Adagrad [74.24716715922759]
  We show a proof of convergence between the Adam Adagrad and $O(d(N)/st)$ algorithms. Adam converges with the same convergence $O(d(N)/st)$ when used with the default parameters.
  arXiv  Detail & Related papers  (2020-03-05T01:56:17Z)

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.