Three Popular 'Quantum Complexity' Signals Can Light Up in Circuits a Laptop Can Simulate

Three of the most-used numerical witnesses of "quantum hardness" can all saturate inside matchgate circuits that a classical laptop already knows how to simulate, a new preprint by Gregory A. L. White, Jens Eisert and Neil Dowling reports.

Matchgate circuits are built from a specific family of two-qubit gates whose underlying physics is governed by free fermions. Despite being "quantum," they have a long-known efficient classical simulation recipe. The authors exploit that tension directly: they ask how often standard complexity diagnostics light up inside random matchgate ensembles, and compute the answer exactly using a Majorana-basis Weingarten calculus that turns replicated operator averages into combinatorial counting.

For extensive initial Majorana strings, they report volume-law operator stabiliser entropy and operator entanglement despite the matchgates' classical tractability, and an exponentially small late-time eight-point OTOC saturation value. Each measure, taken alone, would normally be read as a sign that the circuit is too complex for classical hardware. The paper supplies a counterexample.

The constructive half matters too. Operator entanglement above a Gaussian baseline lower-bounds the number of non-Gaussian gates (sometimes called "magic") in doped matchgate circuits, so the diagnostic is at least useful in one direction. The paper does not overturn quantum advantage; it narrows which measures suffice for claiming it.

Preprint, no peer review, and the rendered HTML is partially truncated. The claims that survived inspection are narrowly scoped to particular classical representations and large-string ensembles.