Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model

Abstract

Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to counter-intuitive macroscopic phenomena such as high-temperature superconductivity. In this paper, we provide a gate decomposition and an architecture for a quantum simulator used to simulate the Fermi-Hubbard model in a hybrid variational quantum-classical algorithm. We propose a simple planar implementation-independent layout of qubits that can also be used to simulate more general fermionic systems. By working through a concrete application, we show the gate decomposition used to simulate the Hamiltonian of a cluster of the Fermi-Hubbard model. We briefly analyze the Trotter-Suzuki errors and estimate the scaling properties of the algorithm for more complex applications.

13 pages, 10 figures

References in corpus (6)

• Quantum computing with trapped ions
• Simulating chemistry using quantum computers
• Digital quantum simulation of fermionic models with a superconducting circuit
• Variational cluster approach to correlated electron systems in low dimensions
• Digital quantum simulation of spin models with circuit quantum electrodynamics
• Fermionic Models with Superconducting Circuits

Cited by in corpus (22)

• Quantum computational chemistry
• Quantum information processing with superconducting circuits: a review
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Quantum Power Method by a Superposition of Time-Evolved States
• Operator Locality in Quantum Simulation of Fermionic Models
• Restless Tuneup of High-Fidelity Qubit Gates
• Fast multi-qubit gates through simultaneous two-qubit gates
• Few-qubit quantum-classical simulation of strongly correlated lattice fermions
• Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
• Lanczos recursion on a quantum computer for the Green's function and ground state
• Switchable next-nearest-neighbor coupling for controlled two-qubit operations
• Hardware-efficient fermionic simulation with a cavity-QED system
• Effects of gate errors in digital quantum simulations of fermionic systems
• Variational Quantum Eigensolver for SU($N$) Fermions
• 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning
• Benchmarking near-term quantum devices with the Variational Quantum Eigensolver and the Lipkin-Meshkov-Glick model
• Estimating the error of an analog quantum simulator by additional measurements
• Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors
• Towards Efficient Superconducting Quantum Processor Architecture Design
• Quantum Algorithm for Green's Functions Measurements in the Fermi-Hubbard Model