Universal Quantum Computation by Scattering in the Fermi-Hubbard Model
arXiv:1409.3585 · doi:10.1088/1367-2630/17/9/093028
Abstract
The Hubbard model may be the simplest model of particles interacting on a lattice, but simulation of its dynamics remains beyond the reach of current numerical methods. In this article, we show that general quantum computations can be encoded into the physics of wave packets propagating through a planar graph, with scattering interactions governed by the fermionic Hubbard model. Therefore, simulating the model on planar graphs is as hard as simulating quantum computation. We give two different arguments, demonstrating that the simulation is difficult both for wave packets prepared as excitations of the fermionic vacuum, and for hole wave packets at filling fraction one-half in the limit of strong coupling. In the latter case, which is described by the t-J model, there is only reflection and no transmission in the scattering events, as would be the case for classical hard spheres. In that sense, the construction provides a quantum mechanical analog of the Fredkin-Toffoli billiard ball computer.
arXiv comment9 pages, 5 figures. Hyperref and cleveref LaTeX packages conflicted (fixed by including hyperref before cleveref). Other minor edits
References in corpus (14)
- Quantum Computation with Quantum Dots
- Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Algorithms Revisited
- Measurement-based quantum computation
- Universal Quantum Computation with the Exchange Interaction
- Effective quantum spin systems with ion traps
- Quantum Algorithms for Quantum Field Theories
- Universal computation by multi-particle quantum walk
- Classical simulation of noninteracting-fermion quantum circuits
- The power of quantum systems on a line
- Computing Spin Networks
- Quantum information processing in bosonic lattices
- Levinson's theorem for graphs II
Cited by in corpus (6)
- BQP-completeness of Scattering in Scalar Quantum Field Theory
- Single-particle digitization strategy for quantum computation of a scalar field theory
- Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model
- A comparative study of universal quantum computing models: towards a physical unification
- Universal resources for quantum computing
- Two-level Quantum Walkers on Directed Graphs I: Universal Quantum Computing