Abstract
Quantum circuits solely comprising matchgates can perform nontrivial (but nonuniversal) quantum algorithms. Because matchgates can be mapped to noninteracting fermions, these circuits can be efficiently simulated on a classical computer. Universal quantum computation is attainable by adding any nonmatchgate parity-preserving gate, from which one may infer that interacting fermions are natural candidates for universal quantum computation. We consider the quantum computational power of fermions hopping on a one-dimensional double-well lattice within the context of matchgates. In particular, we show that universal quantum computation can be implemented using spinless (spin-polarized) fermions and nearest-neighbor interactions, as well as with spin-half fermions with on-site interactions (i.e., the Hubbard model). We suggest that these schemes are currently within reach in the context of ultracold atomic gases.
- Received 12 July 2019
DOI:https://doi.org/10.1103/PhysRevA.100.052324
©2019 American Physical Society