Related papers: Efficient Quantum Simulation Algorithms in the Pat…
A variational method is used to derive a self-consistent macro-particle model for relativistic electromagnetic kinetic plasma simulations. Extending earlier work [E. G. Evstatiev and B. A. Shadwick, J. Comput. Phys., vol. 245, pp. 376-398,…
Quantum circuit simulation is crucial for the development of quantum algorithms, particularly given the high cost and noise limitations of physical quantum hardware. While full-state quantum circuit simulation is commonly employed for…
We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system…
Digital-analog is a quantum computational paradigm that employs the natural interaction Hamiltonian of a system as the entangling resource, combined with single qubit gates, to implement universal quantum operations. As in the case of its…
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the co-design of a problem, its…
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…
This work provides a rigorous and self-contained introduction to numerical methods for Hamiltonian simulation in quantum computing, with a focus on high-order product formulas for efficiently approximating the time evolution of quantum…
This paper suggests a new way to compute the path integral for simple quantum mechanical systems. The new algorithm originated from previous research in string theory. However, its essential simplicity is best illustrated in the case of a…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
Quantum simulation, fundamental in quantum algorithm design, extends far beyond its foundational roots, powering diverse quantum computing applications. However, optimizing the compilation of quantum Hamiltonian simulation poses significant…
We propose a path integral formulation for scale invariant quantum field theories. We do it by modifying the functional integration measure in such a way that the partition function is always exactly scale invariant, at the cost of having…
A Hamiltonian algorithm, both theoretical and numerical, to obtain the reduced equations implementing Pontryagine's Maximum Principle for singular linear-quadratic optimal control problems is presented. This algorithm is inspired on the…
It is demonstrated that the nature of optical parametric amplification is a quantum phenomenon. The system Lagrangian can be constructed by the path integral of coherent state. The equations of motion for photon operators are indeed the…
Iterative phase estimation has long been used in quantum computing to estimate Hamiltonian eigenvalues. This is done by applying many repetitions of the same fundamental simulation circuit to an initial state, and using statistical…
Recently, it was found that a new set of simple techniques allow one to conveniently express ordinary integrals through differentiation. These techniques add to the general toolbox for integration and integral transforms such as the Fourier…
We review a new prescription for calculating the Lagrangian path integral measure directly from the Hamiltonian Schwinger-Dyson equations. The method agrees with the usual way of deriving the measure in which one has to perform the path…
The bin packing is a well-known NP-Hard problem in the domain of artificial intelligence, posing significant challenges in finding efficient solutions. Conversely, recent advancements in quantum technologies have shown promising potential…
We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weightings for the numbers of steps of the quantum walk. This…
We construct several variational integrators--integrators based on a discrete variational principle--for systems with Lagrangians of the form L = L_A + epsilon L_B, with epsilon << 1, where L_A describes an integrable system. These…
We present a numerical path-integral iteration scheme for the low dimensional reduced density matrix of a time-dependent quantum dissipative system. Our approach simultaneously accounts for the combined action of a microscopically modelled…