Showing quant-phShow all
3 papers · 1 filter
quant-ph2025
Gaussianity and Simulability of Cliffords and Matchgates
Andrew M. Projansky, Jason Necaise, James D. Whitfield
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains th…
quant-ph2024
A Sierpinski Triangle Fermion-to-Qubit Transform
Brent Harrison, Mitchell Chiew, Jason Necaise +3
In order to simulate a system of fermions on a quantum computer, it is necessary to represent the fermionic states and operators on qubits. This can be accomplished in multiple way…
quant-ph2024
Entanglement spectrum of matchgate circuits with universal and non-universal resources
Andrew M. Projansky, Joshuah T. Heath, James D. Whitfield
The entanglement level statistics of a quantum state have recently been proposed to be a signature of universality in the underlying quantum circuit. This is a consequence of level…