Recognition: unknown
Optimised Fermion-Qubit Encodings for Quantum Simulation with Reduced Transpiled Circuit Depth
read the original abstract
Simulation of fermionic Hamiltonians with gate-based quantum computers requires the selection of an encoding from fermionic operators to quantum gates, the most widely used being the Jordan-Wigner transform. Many alternative encodings exist, with quantum circuits and simulation results being sensitive to choice of encoding, device connectivity and Hamiltonian characteristics. Non-stochastic optimisation of the ternary tree class of encodings to date has targeted either the device or Hamiltonian. We develop a deterministic method which optimises ternary tree encodings without changing the underlying tree structure. This enables reduction in Pauli-weight without ancillae or additional swap-gate overhead. We demonstrate this method for a variety of encodings, including those which are derived from the qubit connectivity graph of a quantum computer. Numerical results for a suite of standard encoding methods applied to water in the STO-3G basis indicate that our method reduces qDRIFT circuit depths on average by 24.7% and 26.5% for untranspiled and transpiled circuits respectively.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.