Computation performed by applying a series of one and two qubit gates from a universal set and performing measurements on qubits.Computational complexity measured by the circuit-depth. Fermionic Embedding ProblemThe Hilbert space of n qubits is the tensor product of n 2-level Hilbert spaces.Each qubit is distinguishable.Fermions are indistinguishable particles with anti-symmetric wavefunctions.(Fermi-Dirac Statistics) Can we represent a fermionic system with a system of qubits?
Computation performed by applying a series of one and two qubit gates from a universal set and performing measurements on qubits.Computational complexity measured by the circuit-depth. Fermionic Embedding ProblemThe Hilbert space of n qubits is the tensor product of n 2-level Hilbert spaces.Each qubit is distinguishable.Fermions are indistinguishable particles with anti-symmetric wavefunctions.(Fermi-Dirac Statistics) Can we represent a fermionic system with a system of qubits?
Inconvenient Implementation Details• The systems we're trying to simulate are made of electrons, which are indistinguishable fermions.• (Almost) any quantum computer we're likely to use to simulate them is going to be made of qubits, which are distinguishable two-level systems.• To map one onto another, we will need to correct the shape of our Hilbert space.• This has a cost in overhead, either increased weight/nonlocality of operators (Jordan-Wigner, Bravyi-Kitaev, Parity Basis) or extra qubits (BK Superfast).• In the former case, we multiply our circuit depth/time cost by O(n) or O(log n) depending on the connectivity of our hardware, where n is the number of orbitals considered.• In the latter case, we multiply our qubit count/space cost by the degree of the interaction graph, which in the general case is O(n).• If we had a quantum computer made of fermions instead of qubits, this would be free… 5
Abstract In digital quantum simulation of fermionic models with qubits, non-local maps for encoding are often encountered. Such maps require linear or logarithmic overhead in circuit depth which could render the simulation useless, for a given decoherence time. Here we show how one can use a cavity–QED system to perform digital quantum simulation of fermionic models. In particular, we show that highly nonlocal Jordan–Wigner or Bravyi–Kitaev transformations can be efficiently implemented through a hardware approach. The key idea is using ancilla cavity modes, which are dispersively coupled to a qubit string, to collectively manipulate and measure qubit states. Our scheme reduces the circuit depth in each Trotter step of the Jordan–Wigner encoding by a factor ofN2, comparing to the scheme for a device with only local connectivity, whereNis the number of orbitals for a generic two-body Hamiltonian. Additional analysis for the Fermi–Hubbard model on anN × Nsquare lattice results in a similar reduction. We also discuss a detailed implementation of our scheme with superconducting qubits and cavities.
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.
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native fermionic simulators as an alternative. While allowing for fermionic problems to be simulated efficiently, this class of fermionic simulators carries also specific constraints with them and poses other challenges unfamiliar to qubit systems. Here, we propose to pair fermionic modes to form a so-called qubit in second quantisation representation. This allows fermionic gates to be represented as rotations of these second quantised qubits, enabling adaptation of methods for qubit systems. As an application, we use this pairing scheme to represent the measurement of two- and four-point correlators in fermionic simulators with its native gates as a graph problem. Optimising measurement settings is then analysed with various analytical and algorithmic methods.
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₂ binom(M,F)⌉ 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(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) 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.
The characterization of entanglement is a fundamental issue for Quantum Information Theory. But the definition of entanglement depends on the notion of locality, and thus on the tensor product structure of the state space of the composite system. This notion is affected by the presence of superselection rules that restrict the accessible Hilbert space to a direct sum of subspaces. Indistinguishability of particles imposes one such restriction, namely to totally symmetric or totally antisymmetric states. The entanglement can in this case be defined with respect to partitions of modes in the second quantization formalism. For fermionic systems the Fock space of m modes is isomorphic to the space of m qubits, but the action of creation and annihilation operators is not local, due to their anticommutation. Conservation of the parity of fermion number imposes another relevant superselection rule. It requires that local physical observables commute with the local parity operator. Taking into account the considerations above, it is possible to define the set of separable states or equivalently the concept of entanglement for fermionic systems in a number of ways. Here we analyze systematically these possibilities and the relation among the various sets of separable states. We also discuss the behavior of the different classes when taking several copies of the state, as well as the characterization of the sets in terms of the usual criteria regarding the tensor product.