A Jordan-Wigner gadget that reduces T count by more than 6x for quantum chemistry applications
Sam Pallister

TL;DR
This paper introduces a Jordan-Wigner gadget that significantly reduces the T count by over 6 times in quantum chemistry simulations, enhancing runtime efficiency without increasing qubit requirements.
Contribution
The paper presents a novel gadget that optimizes Trotterized quantum chemistry algorithms using Jordan-Wigner, achieving over 6x reduction in T count.
Findings
Over 6x reduction in T count for quantum chemistry simulations
Runtime improvement without additional qubits
Applicable to Jordan-Wigner transformed quantum algorithms
Abstract
Quantum computers have the potential to be a profoundly transformative technology, particularly in the context of quantum chemistry. However, running a chemistry application that is demonstrably useful currently requires a prohibitive number of logical operations. For example, the canonical estimate of the number of operations required to simulate the molecule FeMoco, the key component in biological nitrogen fixation, requires around logical gates. A quantum computer that is capable of applying logical operations at 1 Mhz rates would require more than 30 years to complete such a calculation. It is imperative to reduce this prohibitive runtime, by better understanding and optimising quantum algorithms, if the technology is to have commercial utility. The purpose of this paper is to introduce such an optimisation. The gadget that we introduce below affords a 6x improvement in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
