English

Second-quantized fermionic operators with polylogarithmic qubit and gate complexity

Quantum Physics 2022-06-09 v4

Abstract

We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved, as in the electronic structure problem. When the number FF of fermions is much smaller than the number MM of modes, this symmetry reduces the number of information-theoretically required qubits from Θ(M)\Theta(M) to O(FlogM)O(F\log M). In this limit, our encoding requires O(F2log4M)O(F^2\log^4 M) qubits, while encoded fermionic creation and annihilation operators have cost O(F2log5M)O(F^2\log^5 M) in two-qubit gates. When incorporated into randomized simulation methods, this permits simulating time-evolution with only polylogarithmic explicit dependence on MM. This is the first second-quantized encoding of fermions in qubits whose costs in qubits and gates are both polylogarithmic in MM, which permits studying fermionic systems in the high-accuracy regime of many modes.

Keywords

Cite

@article{arxiv.2109.14465,
  title  = {Second-quantized fermionic operators with polylogarithmic qubit and gate complexity},
  author = {William Kirby and Bryce Fuller and Charles Hadfield and Antonio Mezzacapo},
  journal= {arXiv preprint arXiv:2109.14465},
  year   = {2022}
}

Comments

up to date with published version; 19 pages, 4 figures