REVIEW 1 cited by
Short Proofs of Linear Growth of Quantum Circuit Complexity
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random quantum circuits almost surely grows linearly with the number of building blocks. In this article, we provide two short proofs of this fact. We also discuss a discrete version of quantum circuit complexity growth.
Forward citations
Cited by 1 Pith paper
-
Growth and collapse of subsystem complexity under random unitary circuits
Under random brickwork circuits, regions larger than half the system have complexity growing linearly in time, while a smaller region thermalizes to essentially zero complexity by T=ℓ/2 — with holographic and replica ...
Discussion (0). Continue with ORCID to comment.