English
Related papers

Related papers: Enabling Lie-Algebraic Classical Simulation beyond…

200 papers

We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…

Quantum Physics · Physics 2022-03-02 M. Caruso

We use quantum link models to construct a quantum simulator for U(N) and SU(N) lattice gauge theories. These models replace Wilson's classical link variables by quantum link operators, reducing the link Hilbert space to a finite number of…

High Energy Physics - Lattice · Physics 2013-11-21 Michael Bögli

Constructing robust simulators is essential for asking "what if?" questions and guiding policy in critical domains like healthcare and logistics. However, existing methods often struggle, either failing to generalize beyond historical data…

Machine Learning · Computer Science 2025-06-12 Samuel Holt , Max Ruiz Luyten , Antonin Berthon , Mihaela van der Schaar

Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…

Quantum Physics · Physics 2025-09-16 Jiaqi Leng , Joseph Li , Yuxiang Peng , Xiaodi Wu

One of the methods proposed in the last years for studying non-perturbative gauge theory physics is quantum simulation, where lattice gauge theories are mapped onto quantum devices which can be built in the laboratory, or quantum computers.…

High Energy Physics - Lattice · Physics 2024-04-02 Judy Shir , Erez Zohar

Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…

Quantum Physics · Physics 2022-05-18 Alexis Ralli , Michael I. Williams , Peter V. Coveney

Quantum machine learning (QML) seeks to exploit the intrinsic properties of quantum mechanical systems, including superposition, coherence, and quantum entanglement for classical data processing. However, due to the exponential growth of…

Quantum Physics · Physics 2025-10-09 Timothy Heightman , Edward Jiang , Ruth Mora-Soto , Maciej Lewenstein , Marcin Płodzień

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a…

Quantum Physics · Physics 2012-02-20 M. Van den Nest

We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a…

Quantum Physics · Physics 2024-07-16 Michael Zurel , Arne Heimendahl

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

Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…

We develop a framework for simulating measure-preserving, ergodic dynamical systems on a quantum computer. Our approach provides a new operator-theoretic representation of classical dynamics by combining ergodic theory with quantum…

Quantum simulation is a rapidly evolving tool with great potential for research at the frontiers of physics, and is particularly suited to be used in computationally intensive lattice simulations, such as problems with non-equilibrium. In…

Quantum Physics · Physics 2025-11-21 Jia-Qi Gong , Ji-Chong Yang

Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schr\"{o}dinger…

Quantum Physics · Physics 2026-01-21 Raul A. Santos

Scalable surrogate models enable efficient emulation of computer models (or simulators), particularly when dealing with large ensembles of runs. While Gaussian process (GP) models are commonly employed for emulation, they face limitations…

Methodology · Statistics 2025-10-07 Grant Hutchings , Derek Bingham , Kellin Rumsey , Earl Lawrence

We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-contextual operators. This method enables the efficient…

Quantum Physics · Physics 2025-06-05 Selman Ipek , Atak Talay Yucel , Farzad Shahi , Cagdas Ozdemir , Cihan Okay

We define a supersymmetric quantum mechanics of fermions that take values in a simple Lie algebra. We summarize what is known about the spectrum and eigenspaces of the Laplacian which corresponds to the Koszul differential d. Firstly, we…

High Energy Physics - Theory · Physics 2020-10-28 Jan Troost

A real Lie algebra with a compatible Hilbert space structure (in the sense that the scalar product is invariant) is called a Hilbert-Lie algebra. Such Lie algebras are natural infinite-dimensional analogues of the compact Lie algebras; in…

Representation Theory · Mathematics 2017-11-02 Timothée Marquis , Karl-Hermann Neeb

We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems, with a focus on molecular systems. The method combines classical preparation of a perturbed…

Quantum Physics · Physics 2025-10-30 Alessandro Santini , Stefano Barison , Filippo Vicentini

Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation,…