Second-quantized fermionic operators with polylogarithmic qubit and gate complexity
arXiv:2109.14465 · doi:10.1103/PRXQuantum.3.020351
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 of fermions is much smaller than the number of modes, this symmetry reduces the number of information-theoretically required qubits from to . In this limit, our encoding requires qubits, while encoded fermionic creation and annihilation operators have cost in two-qubit gates. When incorporated into randomized simulation methods, this permits simulating time-evolution with only polylogarithmic explicit dependence on . This is the first second-quantized encoding of fermions in qubits whose costs in qubits and gates are both polylogarithmic in , which permits studying fermionic systems in the high-accuracy regime of many modes.
up to date with published version; 19 pages, 4 figures
References in corpus (3)
Cited by in corpus (10)
- Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
- Qubit-efficient encoding scheme for quantum simulations of electronic structure
- Quantum simulations of Fermionic Hamiltonians with efficient encoding and ansatz schemes
- Low-depth simulations of fermionic systems on square-grid quantum hardware
- Solving reaction dynamics with quantum computing algorithms
- Hardware-efficient entangled measurements for variational quantum algorithms
- Parallelization techniques for quantum simulation of fermionic systems
- Optimal Particle-Conserved Linear Encoding for Practical Fermionic Simulation
- Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
- Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding