Optimised Fermion-Qubit Encodings for Quantum Simulation with Reduced Transpiled Circuit Depth
By: Michael Williams de la Bastida, Thomas M. Bickley, Peter V. Coveney
Potential Business Impact:
Makes quantum computers solve problems faster.
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. Across a suite of standard encoding methods applied to water in STO-3G basis, including Jordan-Wigner, our method reduces qDRIFT circuit depths on average by $27.7\%$ and $26.0\%$ for untranspiled and transpiled circuits respectively.
Similar Papers
Block encoding with low gate count for second-quantized Hamiltonians
Quantum Physics
Makes quantum computers solve hard science problems.
On Encoding Matrices using Quantum Circuits
Quantum Physics
Makes quantum computers use math problems faster.
Quantum circuits for permutation matrices
Quantum Physics
Makes computers do math faster with quantum tricks.