@bertacasas.bsky.social
More details in the paper! Thanks to my amazing collaborators: Paolo Braccia, Élie Gouzien, @mvscerezo.bsky.social and @dgarciamartin.bsky.social 🙌
Meme credits go to Paolo
The previous result allows us to formulate exact matchgate synthesis as a Boolean Satisfiability (SAT) instance, enabling depth-optimal sequences.
12.02.2026 11:35 — 👍 1 🔁 0 💬 1 📌 0When the target matchgates have additional algebraic structure, we can always find a sequence of gates from the generating set that implements the target exactly, without ancillas.
12.02.2026 11:35 — 👍 1 🔁 0 💬 1 📌 0We also prove that an error in the SO(2n) compressed representation amplifies at most linearly in n in the corresponding unitary, enabling efficient approximate compilation schemes.
12.02.2026 11:35 — 👍 1 🔁 0 💬 1 📌 0
We provide a strategy to compile Rz and Rxx rotations using only matchgates by identifying an isomorphism between a two-qubit matchgate subgroup and SU(2).
12.02.2026 11:35 — 👍 1 🔁 0 💬 1 📌 0
We identify a finite gate set that densely generates the matchgate group, which corresponds to the generators of the matchgate-Clifford group (the intersection of the matchgate and Clifford groups) plus the T gate (up to a phase).
12.02.2026 11:35 — 👍 1 🔁 0 💬 1 📌 0
Matchgate circuits are connected to free-fermionic simulation and are useful primitives for benchmarking and verification. They admit a succinct representation in SO(2n) as poly(n)-sized matrices.
12.02.2026 11:35 — 👍 2 🔁 0 💬 1 📌 0
New preprint: “Matchgate synthesis via Clifford matchgates and T gates.” We propose a new framework for matchgate synthesis: compiling these unitaries using only matchgates.
arxiv.org/abs/2602.05425
Preparing approximate ground states has never been hotter 🔥, nor cooler🥶
scirate.com/arxiv/2602.0...
In short: we combine warm-started variational quantum circuits with adiabatic principles to show how iterative training strategies can be useful to prepare approximate ground states.
