Lower Bounds on Stabilizer Rank

06/06/2021
by   Shir Peleg, et al.
0

The stabilizer rank of a quantum state ψ is the minimal r such that | ψ⟩ = ∑_j=1^r c_j |φ_j ⟩ for c_j ∈ℂ and stabilizer states φ_j. The running time of several classical simulation methods for quantum circuits is determined by the stabilizer rank of the n-th tensor power of single-qubit magic states. We prove a lower bound of Ω(n) on the stabilizer rank of such states, improving a previous lower bound of Ω(√(n)) of Bravyi, Smith and Smolin (arXiv:1506.01396). Further, we prove that for a sufficiently small constant δ, the stabilizer rank of any state which is δ-close to those states is Ω(√(n)/log n). This is the first non-trivial lower bound for approximate stabilizer rank. Our techniques rely on the representation of stabilizer states as quadratic functions over affine subspaces of 𝔽_2^n, and we use tools from analysis of boolean functions and complexity theory. The proof of the first result involves a careful analysis of directional derivatives of quadratic polynomials, whereas the proof of the second result uses Razborov-Smolensky low degree polynomial approximations and correlation bounds against the majority function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

Classical lower bounds from quantum upper bounds

We prove lower bounds on complexity measures, such as the approximate de...
research
05/17/2023

Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach

The approximate stabilizer rank of a quantum state is the minimum number...
research
10/15/2021

New techniques for bounding stabilizer rank

In this work, we present number-theoretic and algebraic-geometric techni...
research
07/08/2021

SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization

We study the rank of the Sum of Squares (SoS) hierarchy over the Boolean...
research
03/29/2019

Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank

We show that a form of strong simulation for n-qubit quantum stabilizer ...
research
05/05/2022

The composition complexity of majority

We study the complexity of computing majority as a composition of local ...
research
12/11/2017

Computing Lower Rank Approximations of Matrix Polynomials

Given an input matrix polynomial whose coefficients are floating point n...

Please sign up or login with your details

Forgot password? Click here to reset