2 citations · 2 across the 5 of their papers we have counts for
5 papers
Putting fermions onto a digital quantum computer
Riley W. Chien, Mitchell L. Chiew, Brent Harrison +8
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of…
Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
Brent Harrison, Vishnu Iyer, Ojas Parekh +2
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that…
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…