3 citations · 5 across the 5 of their papers we have counts for
5 papers
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…
Fermionic Mean-Field Theory as a Tool for Studying Spin Hamiltonians
Thomas M. Henderson, Brent Harrison, Ilias Magoulas +5
The Jordan--Wigner transformation permits one to convert spin operators into spinless fermion ones, or vice versa. In some cases, it transforms an interacting spin Hamiltonia…
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…
A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation
Brent Harrison, Jason Necaise, Andrew Projansky +1
The binary indexed tree, or Fenwick tree, is a data structure that can efficiently update values and calculate prefix sums in an array. It allows both of these operations to be per…
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…