English
Related papers

Related papers: Limitations on the simulation of non-sparse Hamilt…

200 papers

Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simulation of open quantum systems, particularly those governed…

Quantum Physics · Physics 2026-04-15 Evan Borras , Milad Marvian

This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations of quantum states and operations. While the simulation of…

Quantum Physics · Physics 2024-03-04 Aaron Sander , Lukas Burgholzer , Robert Wille

The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…

Quantum Physics · Physics 2021-11-24 Shruti Dogra , Artem A. Melnikov , Gheorghe Sorin Paraoanu

Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical…

Quantum Physics · Physics 2022-04-29 V. M. Bastidas , T. Haug , C. Gravel , L. -C. Kwek , W. J. Munro , Kae Nemoto

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of…

Quantum Physics · Physics 2015-03-06 Dominic W. Berry , Andrew M. Childs , Richard Cleve , Robin Kothari , Rolando D. Somma

We study the problem of learning an unknown quantum many-body Hamiltonian $H$ from black-box queries to its time evolution $e^{-\mathrm{i} H t}$. Prior proposals for solving this task either impose some assumptions on $H$, such as its…

Quantum Physics · Physics 2025-06-27 Andrew Zhao

The physics of a quantum system with many degrees of freedom is often approximated by downfolding: most of the degrees of freedom are "folded into" a much smaller number of degrees of freedom, resulting in an effective Hamiltonian that…

Quantum Physics · Physics 2025-06-23 Troy Van Voorhis

We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms.…

Quantum Physics · Physics 2023-04-10 Finn Lasse Buessen , Dvira Segal , Ilia Khait

The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…

Quantum Physics · Physics 2008-07-24 Alastair Kay

Quantum simulations of lattice gauge theories offer the potential to directly study the non-perturbative dynamics of quantum chromodynamics, but naive analyses suggest that they require large computational resources. Large $N_c$ expansions…

High Energy Physics - Lattice · Physics 2026-02-19 Anthony N. Ciavarella , I. M. Burbano , Christian W. Bauer

Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the…

Quantum Physics · Physics 2026-03-16 Xiangyu Li , Ahmet Burak Catli , Ho Kiat Lim , Matthew Pocrnic , Dong An , Jin-Peng Liu , Nathan Wiebe

In these notes we show that it is impossible to obtain a quantum speedup for a faulty Hamiltonian oracle. The effect of dephasing noise to this continuous time oracle model has first been investigated in [1]. The authors consider a faulty…

Quantum Physics · Physics 2014-12-10 Kristan Temme

Quantum computing can be used to speed up the simulation time (more precisely, the number of queries of the algorithm) for physical systems; one such promising approach is the Hamiltonian simulation (HS) algorithm. Recently, it was proven…

Quantum Physics · Physics 2023-10-25 Kiichiro Toyoizumi , Naoki Yamamoto , Kazuo Hoshino

To overcome the fast oscillatory behavior of correlation functions for extracting scattering phase shift in real-time quantum simulations encountered in Ref.\cite{Guo:2026qkx}, we propose and test two solutions in the present work. One is…

Quantum Physics · Physics 2026-04-02 Peng Guo , Paul LeVan , Frank X. Lee , Yong Zhao

Simulation of open quantum systems is an area of active research in quantum algorithms. In this work, we revisit the connection between Markovian open-system dynamics and averages of Hamiltonian real-time evolutions, which we refer to as…

Quantum Physics · Physics 2026-01-28 Minbo Gao , Zhengfeng Ji , Chenghua Liu

Hamiltonian learning is a cornerstone for advancing accurate many-body simulations, improving quantum device performance, and enabling quantum-enhanced sensing. Existing readily deployable quantum metrology techniques primarily focus on…

Quantum Physics · Physics 2025-10-10 Suying Liu , Xiaodi Wu , Murphy Yuezhen Niu

Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…

Quantum Physics · Physics 2014-08-14 David L. Hayes , Steven T. Flammia , Michael J. Biercuk

Hybrid quantum systems with different particle species are fundamental in quantum materials and quantum information science. In this work, we establish a rigorous theoretical framework proving that, given access to an unknown spin-boson…

Quantum Physics · Physics 2025-05-01 Lixing Zhang , Ze-Xun Lin , Prineha Narang , Di Luo

Hamiltonian simulation is a key workload in quantum computing, enabling the study of complex quantum systems and serving as a critical tool for classical verification of quantum devices. However, it is computationally challenging because…

Hardware Architecture · Computer Science 2025-10-31 Yuchao Su , Srikar Chundury , Jiajia Li , Frank Mueller

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…

Combinatorics · Mathematics 2021-11-30 Michael Anastos