Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of F fermions in M modes. An information theoretic minimum of I:=⌈log(FM)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses I+o(I) qubits when F=o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(logMloglogM) depth. (2) Our second construction uses I+O(1) qubits when F=Θ(M), and allows rotations generated by creation-annihilation operators in O(I3) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
In this work I apply a recently proposed improvement procedure, originally conceived to reduce finite lattice-spacing effects in transfer matrices for dilute Fermi systems, to tuning operators for the calculation of observables. I construct, in particular, highly improved representations for the energy and the contact as a first step in an improvement program for finite-temperature calculations. I illustrate the effects of improvement on those quantities with a ground-state lattice calculation at unitarity.
We revisit the problem of learning fermionic linear optics (FLO), also known as fermionic Gaussian unitaries. Given black-box query access to an unknown FLO, previous proposals required O(n5/ε2) queries, where n is the system size and ε is the error in diamond distance. These algorithms also use unphysical operations (i.e., violating fermionic superselection rules) and/or n auxiliary modes to prepare Choi states of the FLO. In this work, we establish efficient and experimentally friendly protocols that obey superselection, use minimal ancilla (at most 1 extra mode), and exhibit improved dependence on both parameters n and ε. For arbitrary (active) FLOs this algorithm makes at most O(n4/ε) queries, while for number-conserving (passive) FLOs we show that O(n3/ε) queries suffice. The complexity of the active case can be further reduced to O(n3/ε) at the cost of using n ancilla. This marks the first FLO learning algorithm that attains Heisenberg scaling in precision. As a side result, we also demonstrate an improved copy complexity of O(nη2/ε2) for time-efficient state tomography of η-particle Slater determinants in ε trace distance, which may be of independent interest.