Related papers: Simulating Field Theories with Quantum Computers
We explore the applicability of a stochastic time-evolution algorithm based on probabilistic angle interpolation. To simplify the pre-processing of the algorithm, we take the continuous-time limit, thereby explicitly eliminating Trotter…
We revisit quantum phase estimation algorithms for the purpose of obtaining the energy levels of many-body Hamiltonians and pay particular attention to the statistical analysis of their outputs. We introduce the mean phase direction of the…
Programmable quantum simulators such as superconducting quantum processors and ultracold atomic lattices represent rapidly developing emergent technology that may one day qualitatively outperform existing classical computers. Yet, apart…
We delve into the use of photonic quantum computing to simulate quantum mechanics and extend its application towards quantum field theory. We develop and prove a method that leverages this form of Continuous-Variable Quantum Computing…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
Future quantum computers may serve as a tool to access non-perturbative real-time correlation functions. In this talk, we discuss the prospects of using these to study Compton scattering for arbitrary kinematics. The restriction to a…
For quantum computers to successfully solve real-world problems, it is necessary to tackle the challenge of noise: the errors which occur in elementary physical components due to unwanted or imperfect interactions. The theory of quantum…
Quantum computing hardware is affected by quantum noise that undermine the quality of results of an executed quantum program. Amongst other quantum noises, coherent error that caused by parameter drifting and miscalibration, remains…
To simulate bosons on a qubit- or qudit-based quantum computer, one has to regularize the theory by truncating infinite-dimensional local Hilbert spaces to finite dimensions. In the search for practical quantum applications, it is important…
Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various…
We propose a hybrid quantum-classical algorithm for approximating the ground state of two-dimensional quantum systems using an isometric tensor network ansatz, which maps naturally to quantum circuits. Inspired by the density matrix…
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 computers, currently in the noisy intermediate-scale quantum (NISQ) era, have started to provide scientists with a novel tool to explore quantum physics and chemistry. While several electronic systems have been extensively studied,…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
Operator size growth describes the scrambling of operators in quantum dynamics and stands out as an essential physical concept for characterizing quantum chaos. Important as it is, a scheme for direct measuring operator size on a quantum…
The transverse Ising Model (TIM) in one dimension is the simplest model which exhibits a quantum phase transition (QPT). Quantities related to quantum information theoretic measures like entanglement, quantum discord (QD) and fidelity are…
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 algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…