The Fermi-Hubbard model (FHM) is a simple yet rich model of strongly interacting electrons with complex dynamics and a variety of emerging quantum phases. These properties make it a compelling target for digital quantum simulation. Trotterization-based quantum simulations have shown promise, but implementations on current hardware are limited by noise, necessitating error mitigation techniques like circuit optimization and post-selection. A mapping of the FHM to a Z2 LGT was recently proposed that restricts the dynamics to a subspace protected by additional symmetries, and its ability for post-selection error mitigation was verified through noisy classical simulations. In this work, we propose and demonstrate a suite of algorithm-hardware co-design strategies on a trapped-ion quantum computer, targeting two key aspects of NISQ-era quantum simulation: circuit compilation and error mitigation. In particular, a novel combination of iteratively preconditioned gradient descent (IPG) and subsystem von Neumann Entropy compression reduces the 2-qubit gate count of FHM quantum simulation by 35%, consequently doubling the number of simulatable Trotter steps when used in tandem with error mitigation based on conserved symmetries, debiasing and sharpening techniques. Our work demonstrates the value of algorithm-hardware co-design to operate digital quantum simulators at the threshold of maximum circuit depths allowed by current hardware, and is broadly generalizable to strongly correlated systems in quantum chemistry and materials science.
The Fermi-Hubbard model (FHM) is a simple yet rich model of strongly interacting electrons with complex dynamics and a variety of emerging quantum phases. These properties make it a compelling target for digital quantum simulation. Trotterization-based quantum simulations have shown promise, but implementations on current hardware are limited by noise, necessitating error mitigation techniques like circuit optimization and post-selection. A mapping of the FHM to a Z2 LGT was recently proposed that restricts the dynamics to a subspace protected by additional symmetries, and its ability for post-selection error mitigation was verified through noisy classical simulations. In this work, we propose and demonstrate a suite of algorithm-hardware co-design strategies on a trapped-ion quantum computer, targeting two key aspects of NISQ-era quantum simulation: circuit compilation and error mitigation. In particular, a novel combination of iteratively preconditioned gradient descent (IPG) and subsystem von Neumann Entropy compression reduces the 2-qubit gate count of FHM quantum simulation by 35%, consequently doubling the number of simulatable Trotter steps when used in tandem with error mitigation based on conserved symmetries, debiasing and sharpening techniques. Our work demonstrates the value of algorithm-hardware co-design to operate digital quantum simulators at the threshold of maximum circuit depths allowed by current hardware, and is broadly generalizable to strongly correlated systems in quantum chemistry and materials science.
The Fermi-Hubbard model is one of the central paradigms in the physics of strongly correlated quantum many-body systems. Here we propose a quantum circuit algorithm based on the Z2 lattice gauge theory (LGT) representation of the one-dimensional Fermi-Hubbard model, which is suitable for implementation on current NISQ quantum computers. Within the LGT description there is an extensive number of local conserved quantities commuting with the Hamiltonian. We show how these conservation laws can be used to implement an efficient error-mitigation scheme. The latter is based on a postselection of states for noisy quantum simulators. While the LGT description requires a deeper quantum-circuit compared to a Jordan-Wigner (JW) based approach, remarkably, we find that our error-correction protocol leads to results being on par with a standard JW implementation on quantum simulators. Published by the American Physical Society 2024
Abstract Quantum simulation on noisy intermediate-scale quantum (NISQ) hardware is limited by short coherence time and gate errors. We present a universal variational compilation optimization method (VCOM) that directly leverages the native gate set of trapped-ion processors, namely single-qubit rotations and global Ising-type XX interactions, to construct shallow circuits for simulating molecular Hamiltonians. Specifically, VCOM employs a hybrid optimization strategy combining genetic algorithms with gradient-based refinement to compile Pauli string evolution operators e −i Pt , thereby substantially reducing circuit depth and multi-qubit gate overhead in Hamiltonian simulation. Applied to hydrogen chains, the compiled circuits achieve fidelities comparable to standard decompositions while reducing the proportion of two-qubit operations to only 1.9%–4.6% of the total native gates, a significant improvement over the standard second-order Trotter–Suzuki product formula. Under experimentally motivated laser-intensity and phase-noise models, the proposed scheme maintains high fidelity and exhibits significantly slower degradation than direct native gate decompositions of conventional circuits. These results establish native-gate-based variational compilation as a scalable and practical approach for digital quantum simulation on trapped-ion platforms, with potential extensions to strongly correlated systems and non-equilibrium dynamics.
This research paper provides a comprehensive review of quantum simulation methods for lattice gauge theories during the current era of noisy intermediate-scale quantum computing. It focuses on the fundamental framework used to understand strong interactions in high-energy physics and explores how quantum devices can overcome the limitations of traditional computational methods, such as the sign problem found in classical simulations. The manuscript is built around three primary pillars that are critical for near-term progress. The first pillar involves encoding strategies, describing the movement away from simple mapping techniques toward more advanced, compact methods that significantly decrease the number of required quantum bits by focusing only on physically relevant states and exploiting local gauge constraints. The second pillar analyzes specific variational quantum algorithms that use flexible circuit structures to find low-energy states, comparing different approaches based on their circuit depth and suitability for current hardware. The third pillar evaluates various error mitigation techniques used to extract accurate information from imperfect quantum hardware, such as methods that amplify and then remove noise or those that use physical symmetries to detect and discard errors. Additionally, the paper compares different hardware technologies—including those based on superconducting circuits, trapped atoms, and ions—to weigh their respective benefits, such as gate speed and connectivity, against their drawbacks. It also introduces emerging hybrid approaches that combine quantum circuits with artificial neural networks to improve simulation power and state representation. Ultimately, the review identifies pathways toward achieving practical advantages in the field and discusses the challenges that remain for scaling these systems to larger sizes.
As the advances in quantum hardware bring us into the noisy intermediate-scale quantum (NISQ) era, one possible task we can perform without quantum error correction using NISQ machines is the variational quantum eigensolver (VQE) due to its shallow depth. A specific problem that we can tackle is the strongly interacting Fermi-Hubbard model, which is classically intractable and has practical implications in areas like superconductivity. In this paper, we outline the details about the gate sequence, the measurement scheme, and the relevant error-mitigation techniques for the implementation of the Hubbard VQE on a NISQ platform. We perform resource estimation for both silicon spin qubits and superconducting qubits for a 50-qubit simulation, which cannot be solved exactly via classical means, and find similar results. The number of two-qubit gates required is on the order of 20 000. Hence, to suppress the mean circuit-error count to a level such that we can obtain meaningful results with the aid of error mitigation, we need to achieve a two-qubit gate error rate of approximately ${10}^{\ensuremath{-}4}$. When searching for the ground state, we need a few days for one gradient-descent iteration, which is impractical. This can be reduced to around 10 min if we distribute our task among hundreds of quantum-processing units. Hence, implementing a 50-qubit Hubbard model VQE on a NISQ machine can be on the brink of being feasible in near term, but further optimization of our simulation scheme, improvements in the gate fidelity, improvements in the optimization scheme and advances in the error-mitigation techniques are needed to overcome the remaining obstacles. The scalability of the hardware platform is also essential to overcome the runtime issue via parallelization, which can be done on one single silicon multicore processor or across multiple superconducting processors.
Abstract Quantum error mitigation has been extensively explored to increase the accuracy of the quantum circuits in noisy-intermediate-scale-quantum (NISQ) computation, where quantum error correction requiring additional quantum resources is not adopted. Among various error-mitigation schemes, probabilistic error cancellation (PEC) has been proposed as a general and systematic protocol that can be applied to numerous hardware platforms and quantum algorithms. However, PEC has only been tested in two-qubit systems and a superconducting multi-qubit system by learning a sparse error model. Here, we benchmark PEC using up to four trapped-ion qubits. For the benchmark, we simulate the dynamics of interacting fermions with or without spins by applying multiple Trotter steps. By tomographically reconstructing the error model and incorporating other mitigation methods such as positive probability and symmetry constraints, we are able to increase the fidelity of simulation and faithfully observe the dynamics of the Fermi–Hubbard model, including the different behavior of charge and spin of fermions. Our demonstrations can be an essential step for further extending systematic error-mitigation schemes toward practical quantum advantages.
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In this work, we develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model, exploiting the underlying control over qubit interactions available in most quantum hardware and deriving analytic circuit identities for synthesising multi-qubit evolutions from two-qubit interactions. We then analyse the impact of these techniques under the standard error model where errors occur per gate, and an error model with a constant error rate per unit time. To quantify the benefits of this approach, we apply it to time-dynamics simulation of the 2D spin Fermi-Hubbard model. Combined with new error bounds for Trotter product formulas tailored to the non-asymptotic regime and an analysis of error propagation, we find that e.g. for a 5 × 5 Fermi-Hubbard lattice we reduce the circuit depth from 1, 243, 586 using the best previous fermion encoding and error bounds in the literature, to 3, 209 in the per-gate error model, or the circuit-depth-equivalent to 259 in the per-time error model. This brings Hamiltonian simulation, previously beyond reach of current hardware for non-trivial examples, significantly closer to being feasible in the NISQ era.