Universal quantum computation by scattering in the Fermi–Hubbard model

DOI10.1088/1367-2630/17/9/093028zbMath1448.81222arXiv1409.3585OpenAlexW50546868MaRDI QIDQ5136105

Patrick Hayden, Ning Bao, Nathaniel Thomas, Grant Salton

Publication date: 25 November 2020

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

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

Mathematics Subject Classification ID

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

Related Items (1)

Time independent universal computing with spin chains: quantum plinko machine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of quantum systems on a line
• Conservative logic
• Computing spin networks
• Levinson's theorem for graphs II
• Universal Computation by Multiparticle Quantum Walk
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• On successive settings of an arc on the circumference of a circle
• On the Product of Semi-Groups of Operators
• Quantum algorithms revisited
• Topological quantum computation
• The computational complexity of linear optics
• The One-Dimensional Hubbard Model

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