Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

  title={Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom},
  author={Sabee Grewal and Vishnu Iyer and William Kretschmer and Daniel Liang},
We show that quantum states with “low stabilizer complexity” can be efficiently distinguished from Haar-random. Specifically, given an n -qubit pure state | ψ i , we give an efficient algorithm that distinguishes whether | ψ i is (i) Haar-random or (ii) a state with stabilizer fidelity at least 1 k (i.e., has fidelity at least 1 k with some stabilizer state), promised that one of these is the case. With black-box access to | ψ i , our algorithm uses O (cid:0) k 12 log(1 /δ ) (cid:1) copies of | ψ i… 



Optimal algorithms for learning quantum phase states

The learning algorithm based on separable measurements has runtime poly ( n ) (for constant d ) and is well-suited for near-term demonstrations as it requires only single-qubit measurements in the Pauli X and Z bases.

(Pseudo) Random Quantum States with Binary Phase

It is proved that a uniform superposition with random \emph{binary} phase is statistically indistinguishable from a Haar random state, which proves a quantum information-theoretic conjecture due to Ji, Liu and Song (CRYPTO 2018).

Simulation of quantum circuits by low-rank stabilizer decompositions

A comprehensive mathematical theory of the stabilizerRank and the related approximate stabilizer rank is developed and a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art are presented.

Improved Simulation of Stabilizer Circuits

The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions.

Qubit stabilizer states are complex projective 3-designs

The main technical ingredient is a general recursion formula for the so-called frame potential of stabilizer states, which reduces to a counting problem in discrete symplectic vector spaces for which it is found a simple formula.

Randomized Benchmarking of Quantum Gates

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate

Quantum computing via measurements only

In this model, the entire resource for the quantum computation is provided initially in form of a specific entangled state (a so-called cluster state) of a large number of qubits, which serves as a universal substrate for any quantum computation.

Good quantum error-correcting codes exist.

  • CalderbankShor
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
The techniques investigated in this paper can be extended so as to reduce the accuracy required for factorization of numbers large enough to be difficult on conventional computers appears to be closer to one part in billions.

The Heisenberg Representation of Quantum Computers

Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features

Predicting many properties of a quantum system from very few measurements

An efficient method for constructing an approximate classical description of a quantum state using very few measurements of the state is proposed, called a ‘classical shadow’, which can be used to predict many different properties.