Papers › A Lightweight Protocol for Matchgate Fidelity Estimation

A Lightweight Protocol for Matchgate Fidelity Estimation

11 Apr 2024arXiv:2404.07974links table onlyarchive 2025-07-28

Jędrzej Burkat, Sergii Strelchuk

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a low-depth randomised protocol for estimating the entanglement fidelity between an n-qubit matchgate circuit 𝒰 and its noisy implementation ℰ. Our method uses a Pauli-Liouville representation adapted to Clifford algebra elements, in which matchgate superoperators acquire a block-diagonal form. This structure enables efficient direct fidelity estimation using only Pauli state preparation and measurement, while avoiding the exponentially costly sampling step required for generic unitary channels. Compared with the protocol of Flammia and Liu [PRL 106, 230501], our algorithm gives an exponential improvement in classical sampling complexity and a multiplicative 1/√(n) reduction in expected shot count for matchgate circuits. The protocol also extends, without asymptotic overhead, to matchgate circuits sandwiched between Clifford circuits. For nearest-neighbour XY(θ) gates and Givens rotations we demonstrate an increase in superoperator sparsity, giving an additional 1/√(n) reduction in expected shot count and, to our knowledge, the first scalable fidelity estimation protocol for these important matchgate subgroups.

PaperPDFCode

Code

jedbur/matchgate-benchmarking officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections