Universal quantum computation by scattering in the Fermi–Hubbard model

DOI10.1088/1367-2630/17/9/093028MaRDI QIDQ5136105zbMATH OpenOpenAlexFDO

Authors Ning Bao, Patrick Hayden, Grant Salton, Nathaniel Thomas

Publication date 25 November 2020

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1409.3585

Mathematics Subject Classification ID

Quantum computation (81P68) Fermionic systems in quantum theory (81V74) Interacting particle systems in time-dependent statistical mechanics (82C22)

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.

Recommendations

• Scalable quantum computation in systems with Bose-Hubbard dynamics
• Universal quantum computation with abelian anyon models
• Universal quantum computation with weakly integral anyons
• Quantum computation with scattering matrices
• Fermionic quantum computation
• Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
• Universal quantum computation with metaplectic anyons
• Universal quantum computation with electronic qubits in decoherence-free subspace
• Towards a Scalable quantum computing platform in the ultrastrong coupling regime
• Universal quantum logic gates in a scalable Ising spin quantum computer

Cites work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• An invitation to modern number theory. With a foreword by Peter Sarnak.
• Computing spin networks
• Conservative logic
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 845841 (Why is no real title available?)
• Levinson's theorem for graphs. II
• On successive settings of an arc on the circumference of a circle
• On the Product of Semi-Groups of Operators
• Quantum algorithms revisited
• The computational complexity of linear optics
• The One-Dimensional Hubbard Model
• The power of quantum systems on a line
• Topological quantum computation
• Universal computation by multiparticle quantum walk

Cited in

(3)

• Scalable quantum computation in systems with Bose-Hubbard dynamics
• Time independent universal computing with spin chains: quantum plinko machine
• Universal resources for quantum computing

This page was built for publication: Universal quantum computation by scattering in the Fermi–Hubbard model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136105)