Abstracts
Poster Abstracts | Talk Abstracts
The Fermi-Hubbard model for universal quantum computation
Presenting Author: David Feder, University of Calgary
Contributing Author(s): Jiawei Ji
Quantum circuits based only on matchgates are able to perform non-trivial (but not universal) quantum algorithms. Because matchgates can be mapped to non-interacting fermions, these circuits can be efficiently simulated on a classical computer. One can perform universal quantum computation by adding any non-matchgate parity-preserving gate, implying that interacting fermions could be natural candidates for universal quantum computation within the circuit model. Most work to date has focused on Majorana fermions, which are difficult to realize in the laboratory. We instead explore both spinless (spin-polarized) and spin-1/2 fermions within the context of matchgate circuits, investigating interactions within a family of Fermi-Hubbard Hamiltonians, to obtain experimentally realizable conditions under which interacting fermions are able to perform universal quantum computation.
(Session 9a : Friday from 4:45pm-5:15pm)
- Home
- SQuInT
- Past SQuInT Meetings
- Lodging and Transportation
- Hotel Floor Maps (.pdf)
- Registration
- Submit Your Abstract
- Program
- Instructions for Presenters
SQuInT Chief Organizer
Akimasa Miyake, Assistant Professor
amiyake@unm.edu
SQuInT Co-Organizer
Mark M. Wilde, Assistant Professor LSU
mwilde@phys.lsu.edu
SQuInT Administrator
Gloria Cordova
gjcordo1@unm.edu
505 277-1850
SQuInT Founder
Ivan Deutsch, Regents' Professor
ideutsch@unm.edu