학술논문

Second-Quantized Fermionic Operators with Polylogarithmic Qubit and Gate Complexity
Document Type
article
Source
PRX Quantum, Vol 3, Iss 2, p 020351 (2022)
Subject
Physics
QC1-999
Computer software
QA76.75-76.765
Language
English
ISSN
2691-3399
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 F of fermions is much smaller than the number M of modes, this symmetry reduces the number of information-theoretically required qubits from Θ(M) to O(Flog⁡M). In this limit, our encoding requires O(F^{2}log^{4}⁡M) qubits, while encoded fermionic creation and annihilation operators have cost 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 M. This is the first second-quantized encoding of fermions in qubits whose costs in qubits and gates are both polylogarithmic in M, which permits studying fermionic systems in the high-accuracy regime of many modes.