3 citations · 5 across the 7 of their papers we have counts for
Showing 2024 · quant-phShow all
2 papers · 2 filters
quant-ph2024
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★ 2 cited
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…