Synthesizing efficient circuits for Hamiltonian simulation
Priyanka Mukhopadhyay, Nathan Wiebe, Hong Tao Zhang

TL;DR
This paper introduces a novel circuit compilation method for quantum Hamiltonian simulation that significantly reduces non-Clifford gates, enhancing efficiency and practicality for simulating quantum chemistry and many-body systems.
Contribution
It presents a new approach to compile quantum simulation circuits by grouping commuting Hamiltonian terms, reducing non-Clifford gates, and providing a polynomial-time algorithm for optimal term grouping.
Findings
Up to 4-fold reduction in non-Clifford operations.
Numerical simulations show 1.8-3.2 times fewer non-Clifford gates for certain models.
Potential for more practical quantum chemistry simulations.
Abstract
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to . In fact, the total number of gates reduce in many cases. We show that it is possible to implement an exponentiated sum of commuting Paulis with at most (controlled)-rotation gates, where is the number of distinct non-zero eigenvalues (ignoring sign). Thus we can collect mutually commuting Hamiltonian terms into groups that satisfy one of several symmetries identified in this work which allow an inexpensive simulation of the entire group of terms. We further show that the cost can in some cases be reduced by partially allocating Hamiltonian terms to several groups and provide a polynomial time classical algorithm that can greedily…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
