Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Provides a theoretical overview of Majorana-based topological quantum computing and introduces a time-dependent Pfaffian simulation method for braiding, projective measurements, and disorder.
citing papers explorer
-
Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
-
Majorana braiding simulations with projective measurements
Provides a theoretical overview of Majorana-based topological quantum computing and introduces a time-dependent Pfaffian simulation method for braiding, projective measurements, and disorder.