Table of Contents
Fetching ...

Ideal random quantum circuits pass the LXEB test

Nicholas Hunter-Jones, Jonas Haferkamp

Abstract

We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-designs, the LXEB test is passed with probability $1-O(1/\sqrt{k})$, where $k$ is the number of independently drawn samples from the output distribution of the random circuit. If the circuits are of depth $\tilde O(n^2)$, and thus form unitary $n$-designs, the LXEB test is passed with probability $1-O(e^{-k \log(n)/n})$. In proving our results, we show strong concentration of the random circuit collision probability at linear depth and establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths. Our analysis employs higher moments and high-degree approximate designs.

Ideal random quantum circuits pass the LXEB test

Abstract

We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-designs, the LXEB test is passed with probability , where is the number of independently drawn samples from the output distribution of the random circuit. If the circuits are of depth , and thus form unitary -designs, the LXEB test is passed with probability . In proving our results, we show strong concentration of the random circuit collision probability at linear depth and establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths. Our analysis employs higher moments and high-degree approximate designs.
Paper Structure (5 sections, 19 theorems, 69 equations)

This paper contains 5 sections, 19 theorems, 69 equations.

Key Result

Theorem 1

An $n$-qubit random quantum circuit of depth $144n$ passes the LXEB test with probability $\geq 1 - O(1/\sqrt{k})-O(1/2^n)$, where $k$ is the number of samples generated.

Theorems & Definitions (33)

  • Theorem 1: Linear depth random quantum circuits
  • Theorem 2: Polynomial depth random quantum circuits
  • Theorem 3
  • Definition 1: Random quantum circuits
  • Definition 2: Approximate unitary designs
  • Theorem 4
  • Theorem 5: Ref. chen2025incompressibility
  • Lemma 1
  • Lemma 2
  • proof
  • ...and 23 more