Work

Exact depth 25 for an eight-qubit matchgate benchmark

Year: 2026
Type: preprint
Abstract: I determine the minimum physical depth for the eight-qubit matchgate transformation obtained from a transcription of Figure 6(b) of Casas et al. The model permits nearest-neighbour gates on an open chain, with disjoint physical qubits in each layer. An exact 119-gate circuit attains depth 25. To exclude depth 24, I combine modular rank bounds with a normal form for physical schedules. Every hypothetical solution has a representative among 959 schedules for the central bond. A finite-field encoding of all 256 matrix entries then rules out the entire list. Three clausal certificates and an exact circuit witness allow independent replay without repeating the search. The result applies to the transformation defined by the transcribed circuit. The accompanying archive contains the exact 16 × 16 target Q_fig, a legal 25-layer circuit, three LRAT proof certificates, the formula generators and offline verification code. Extract the ZIP and run python3 verify.py. The verifier checks the circuit and the lower bound and reports PASS_EXACT_OPTIMUM_25. The preprint and the author’s original materials are distributed under CC BY 4.0. The bundled lrat-check.c is distributed under its own MIT license, reproduced in LICENSE_LRAT.txt.
Author: Trela, Dawid
Language: English
Open Access status: green
OpenAlex ID: W7237359277
Cites: 1
Cited by:
Related to: