Efficient Hamiltonian engineering

Type: Preprint

Publication Date: 2024-10-25

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2410.19903

Abstract

We propose a novel and efficient scheme to engineer arbitrary (local) many-body Hamiltonians by interleaving the free evolution of a fixed system Hamiltonian with layers of single-qubit Pauli or Clifford gates. These sequences are constructed by solving a linear program (LP) which minimizes the total evolution time. The target Hamiltonians that can be engineered by our method are only limited by the locality of the Pauli terms in the system Hamiltonian. We then construct an efficient relaxation of this LP with a classical runtime that depends on the number of Pauli terms in the Pauli decomposition of the system Hamiltonian and is thus a low-degree polynomial in the number of qubits in practice. With our method, it is also possible to engineer Hamiltonians if only partial knowledge of the system Hamiltonian is available, which can be used to cancel unknown unwanted Pauli terms. We show the classical efficiency of our method by engineering an arbitrary two-body Hamiltonian on a 2D square lattice with $225$ qubits in only $60$ seconds. We also provide numerical simulations of our method modelling an ion trap device with an Ising Hamiltonian and engineering a general Heisenberg Hamiltonian. Moreover, we address dominant error sources in practical applications.

Locations

  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ Synthesis of and compilation with time-optimal multi-qubit gates 2022 Pascal Baßler
Matthias Zipper
Christopher Cedzich
Markus R. Heinrich
Patrick Huber
M. Johanning
Martin Kliesch
+ Strongly Universal Hamiltonian Simulators 2021 Leo Zhou
Dorit Aharonov
+ Scalable Hamiltonian programming in qubit arrays with nearest-neighbour couplings 2020 Takahiro Tsunoda
Gaurav Bhole
Stephen A. Jones
Jonathan A. Jones
Peter Leek
+ Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding 2024 Jiaqi Leng
Joseph Li
Yuxiang Peng
Xiaodi Wu
+ PDF Chat Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling 2024 Qunsheng Huang
David Winderl
Arianne Meijer-van de Griend
Richie Yeung
+ PDF Chat Programmable quantum simulation by dynamic Hamiltonian engineering 2014 David Hayes
Steven T. Flammia
Michael J. Biercuk
+ PDF Chat Reducing circuit depth with qubitwise diagonalization 2023 Edison M. Murairi
Michael J. Cervia
+ PDF Chat Hamiltonian learning for 300 trapped ion qubits with long-range couplings 2024 S. -A. Guo
Yukai Wu
J. Ye
Lei Zhang
Y. Wang
W. -Q. Lian
Ruixiao Yao
Y. -L. Xu
Chaofeng Zhang
Yun Xu
+ Rapid Exponentiation using Discrete Operators: Applications in Optimizing Quantum Controls and Simulating Quantum Dynamics 2017 Gaurav Bhole
T. S. Mahesh
+ PDF Chat Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters 2020 E. van den Berg
Kristan Temme
+ PDF Chat Mitigating algorithmic errors in a Hamiltonian simulation 2019 Suguru Endo
Qi Zhao
Ying Li
Simon C. Benjamin
Xiao Yuan
+ Reducing circuit depth with qubitwise diagonalization 2023 Edison M. Murairi
Michael J. Cervia
+ Problem specific classical optimization of Hamiltonian simulation 2023 Refik Mansuroglu
Felix Fischer
Michael J. Hartmann
+ PDF Chat Problem-specific classical optimization of Hamiltonian simulation 2023 Refik Mansuroglu
Felix Fischer
Michael J. Hartmann
+ PDF Chat Strategies for optimizing double-bracket quantum algorithms 2024 Xiaoyue Li
Matteo Robbiati
Andrea Pasquale
Edoardo Pedicillo
Andrew L. Wright
Stefano Carrazza
Marek Gluza
+ PDF Chat Robust and Efficient Hamiltonian Learning 2023 Wenjun Yu
Jinzhao Sun
Zeyao Han
Xiao Yuan
+ Robust and Efficient Hamiltonian Learning 2022 Wenjun Yu
Jinzhao Sun
Zeyao Han
Yuan Xiao
+ Synthesizing efficient circuits for Hamiltonian simulation 2022 Priyanka Mukhopadhyay
Nathan Wiebe
Hong Tao Zhang
+ PDF Chat Synthesizing efficient circuits for Hamiltonian simulation 2023 Priyanka Mukhopadhyay
Nathan Wiebe
Hong Tao Zhang
+ PDF Chat Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas 2024 Mohsen Bagherimehrab
Dominic W. Berry
Philipp Schleich
Abdulrahman Aldossary
J. M. Angulo
Alán Aspuru‐Guzik

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors