Explorerโ€บQuantum Computingโ€บQuantum Physics
Research PaperResearchia:202609.02019

Depth-1 expanders on the unitary group and applications

Anurag Anshu

Abstract

We construct a constant-degree and constant-gap quantum expander on $n$ qubits where each unitary can be implemented by a depth-$1$ and 1D circuit of Pauli or CNOT gates. We provide two applications of this expander. First, we use it to construct a family of frustration-free 1D Hamiltonians whose ground states obey the entanglement-gap relation $S = ฮ˜(ฮ”^{-1/2})$; this is believed to be optimal, but achieving it had been open. Second, we use it to provide a streaming protocol that tests for close...

Submitted: September 2, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

We construct a constant-degree and constant-gap quantum expander on nn qubits where each unitary can be implemented by a depth-11 and 1D circuit of Pauli or CNOT gates. We provide two applications of this expander. First, we use it to construct a family of frustration-free 1D Hamiltonians whose ground states obey the entanglement-gap relation S=ฮ˜(ฮ”โˆ’1/2)S = ฮ˜(ฮ”^{-1/2}); this is believed to be optimal, but achieving it had been open. Second, we use it to provide a streaming protocol that tests for closeness to a class of 1D volume-law entangled states. Moreover, we extend our quantum expander to a constant-degree and constant-gap expander on the unitary group where each unitary is a single TT gate, a single Tโ€ T^{\dagger} gate, or a depth-11 Clifford circuit. This implies that a random sequence of unitaries from the expander yields a gapped walk on a dense subgroup of the unitary group. This improves upon previous work by Bourgain and Gamburd which did not control the dependence of the gap on the dimension.


Source: arXiv:2609.01605v1 - http://arxiv.org/abs/2609.01605v1 PDF: https://arxiv.org/pdf/2609.01605v1 Original Link: http://arxiv.org/abs/2609.01605v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Sep 2, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark