The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we investigated the most straightforward error mitigation strategy using the stabilizer group, stabilizer postselection, that is very natural to the setting of fermionic quantum simulation. We numerically investigate the performance of the error mitigation strategy on a range of systems containing up to 42 qubits and on a number of fundamental quantum simulation tasks including non-equilibrium dynamics and variational ground state calculations. We find that at reasonable noise rates and system sizes, the fidelity of computations can be increased significantly beyond what can be achieved with the standard Jordan-Wigner transformation at the cost of increasing the number of shots by less than a factor of 10, potentially providing a meaningful boost to near-term quantum simulations. Our simulations are enabled by new classical simulation algorithms that scale with the logical Hilbert space dimension rather than the physical Hilbert space dimension.
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we investigated the most straightforward error mitigation strategy using the stabilizer group, stabilizer postselection, that is very natural to the setting of fermionic quantum simulation. We numerically investigate the performance of the error mitigation strategy on a range of systems containing up to 42 qubits and on a number of fundamental quantum simulation tasks including non-equilibrium dynamics and variational ground state calculations. We find that at reasonable noise rates and system sizes, the fidelity of computations can be increased significantly beyond what can be achieved with the standard Jordan-Wigner transformation at the cost of increasing the number of shots by less than a factor of 10, potentially providing a meaningful boost to near-term quantum simulations. Our simulations are enabled by new classical simulation algorithms that scale with the logical Hilbert space dimension rather than the physical Hilbert space dimension.
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a system of fermions on a quantum computer, one has to first map the fermionic Hamiltonian to a qubit Hamiltonian. The most popular such mapping is the Jordan-Wigner encoding, which suffers from inefficiencies caused by the high weight of some encoded operators. As a result, alternative local encodings have been proposed that solve this problem at the expense of a constant factor increase in the number of qubits required. Some such encodings possess local stabilizers, i.e., Pauli operators that act as the logical identity on the encoded fermionic modes. A natural error mitigation approach in these cases is to measure the stabilizers and discard any run where a measurement returns a -1 outcome. Using a high-performance stabilizer simulator, we classically simulate the performance of a local encoding known as the Derby-Klassen encoding and compare its performance with the Jordan-Wigner encoding and the ternary tree encoding. Our simulations use more complex error models and significantly larger system sizes (up to 18×18) than in previous work. We find that the high sampling requirements of postselection methods with the Derby-Klassen encoding pose a limitation to its applicability in near-term devices and call for more encoding-specific circuit optimizations.
Quantum simulations before fault tolerance suffer from the intrinsic noise present in quantum computers. In this regime, extracting meaningful results greatly benefits from stability against that noise. This stability, defined as an error in observables that is independent of the system's size, is expected in local systems under local noise. In fermionic systems, the encoding of the fermionic degrees of freedom into qubits can introduce non-locality, making stability more delicate. Here, we investigate the stability to noise of fermion-to-qubit mappings. We consider noisy quantum circuits in D dimensions modeled by alternating layers of local unitaries and general, single-qubit Pauli noise. We show that, when using local fermionic encodings, expectation values of quadratic fermionic observables are stable to noise in states with spatially decaying correlations: a power-law decay with exponent μ>D is sufficient for stability. By contrast, we show that this stability cannot be achieved by non-local encodings such as Jordan-Wigner in 2D, or quasi-local ones such as the Bravyi-Kitaev transform. Our findings formalize the intuition that decaying correlations of the physical systems under study provide protection against noise for local fermionic encodings, and help inform design principles in near-term quantum simulations.
Quantum error mitigation (QEM) has emerged as a powerful tool for the extraction of useful quantum information from quantum devices. Here, we introduce the Subspace Noise Tailoring (SNT) algorithm, which efficiently combines the cheap cost of Symmetry Verification (SV) and low bias of Probabilistic Error Cancellation (PEC) QEM techniques. We study the performance of our method by simulating the Trotterized time evolution of the spin-1/2 Fermi-Hubbard model (FHM) using a variety of local fermion-to-qubit encodings, which define a computational subspace through a set of stabilizers, the measurement of which can be used to post-select noisy quantum data. We study different combinations of QEM and encodings and uncover a rich state diagram of optimal combinations, depending on the hardware performance, system size and available shot budget. We then demonstrate how SNT extends the reach of current noisy quantum computers in terms of the number of fermionic lattice sites and the number of Trotter steps, and quantify the required hardware performance beyond which a noisy device may compete with current state-of-the-art classical computational methods.
Fermionic platforms offer compelling architectures for quantum computing, ranging from topologically protected Majorana-based qubits to fermionic cold atoms. To achieve scalability, however, they require quantum error correction. In this work, we prove that any exact and sufficiently accurate approximate fermionic quantum error correction necessarily requires non-Gaussian operations, beyond the free-fermion regime of quadratic dynamics. This is in sharp contrast to the qubit setting, where the efficiently classically simulable stabilizer operations form the standard framework for quantum error correction. Specifically, we show that the logical space of any non-trivial fermionic error-correcting code contains no pure fermionic Gaussian state, utilizing a fundamental incompatibility between fermionic error correction and Wick's theorem. We further show that the required number of bounded-weight non-Gaussian gates for unitary codeword preparation grows at least linearly with both the code distance and the number of encoded modes, revealing an intrinsic resource overhead that increases simultaneously with error-protection strength and logical capacity. Furthermore, we analyze the performance of fermionic Gaussian operations in entanglement distillation, revealing a distinction from their bosonic counterparts. Our results reveal fundamental difficulties for fermionic error correction from the perspectives of both physical implementation and classical simulation, suggesting connections to fermionic phases of matter and state preparation complexity.
Noisy intermediate-scale quantum (NISQ) computers could solve quantum-mechanical simulation problems that are beyond the capabilities of classical computers. However, NISQ devices experience significant errors which, if not corrected, can render physical quantities measured in these simulations inaccurate or meaningless. Here we describe a method of reducing these errors which is tailored to quantum algorithms for simulating fermionic systems. The method is based on executing quantum circuits in the model of fermionic linear optics, which are known to be efficiently simulable classically, to infer the relationship between exact and noisy measurement outcomes, and hence undo the effect of noise. We validated our method by applying it to the VQE algorithm for estimating ground state energies of instances of the Fermi-Hubbard model. In classical numerical simulations of 12-qubit examples with physically realistic levels of depolarising noise, errors were reduced by a factor of around 34 compared with the uncorrected case. Smaller experiments on quantum hardware demonstrate an average reduction in errors by a factor of 10 or more.
Quantum simulations of fermionic many-body systems crucially rely on mappings from indistinguishable fermions to distinguishable qubits. The non-local structure of fermionic Fock space necessitates encodings that either map local fermionic operators to non-local qubit operators, or encode the fermionic representation in a long-range entangled code space. In this latter case, there is an unavoidable trade-off between two desirable properties of the encoding: low weight representations of local fermionic operators, and a high distance code space. Here it is argued that despite this fundamental limitation, fermionic encodings with low-weight representations of local fermionic operators can still exhibit error mitigating properties which can serve a similar role to that played by high code distances. In particular when undetectable errors correspond to "natural" fermionic noise. We illustrate this point explicitly for two fermionic encodings: the Verstraete-Cirac encoding, and an encoding appearing in concurrent work by Derby and Klassen. In these encodings many, but not all, single-qubit errors can be detected. However we show that the remaining undetectable single-qubit errors map to local, low-weight fermionic phase noise. We argue that such noise is natural for fermionic lattice models. This suggests that even when employing low-weight fermionic encodings, error rates can be suppressed in a similar fashion to high distance codes, provided one is willing to accept simulated natural fermionic noise in their simulated fermionic system.