Related papers: Computing the coefficients of transformations betw…
While several numerical techniques are available for predicting the dynamics of non-Markovian open quantum systems, most struggle with simulations for very long memory and propagation times, e.g., due to superlinear scaling with the number…
We demonstrate quantum computation of two-point correlation functions for a Heisenberg spin chain. Using the IBM Q 20 quantum machines, we find that for two sites the correlation functions produce the exact results reliably. For four sites,…
A very simple procedure to calculate eigenenergies of quantum anharmonic oscillators is presented. The method, exact but for numerical computations, consists merely in requiring the vanishing of the Wronskian of two solutions which are…
Analog coprocessors are intensively developing nowadays with the aim to optimize energy computations of neural networks. In this work we focus on the possibility of using detection of collective oscillations in optical systems for…
Quantum computation of vibrational properties of molecules is a promising platform to obtain computational advantages for computational chemistry. However, fault-tolerant quantum computations of vibrational properties remain a relatively…
Convenient and simple numerical techniques for performing quantum computations based on matrix representations of Hilbert space operators are presented and illustrated by various examples. The applications include the calculations of…
We derive an exact recursion formula for the calculation of thermodynamic functions of finite systems obeying Bose-Einstein statistics. The formula is applicable for canonical systems where the particles can be treated as noninteracting in…
Expectation value estimation is ubiquitous in quantum algorithms. The expectation value of a Hamiltonian, which is essential in various practical applications, is often estimated by measuring a large number of Pauli strings on quantum…
Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Bounds on their performance, derived in the…
Using the concept of crossing state and the formalism of second quantization, we propose a prescription for computing the density of arrivals of particles for multiparticle states, both in the free and the interacting case. The densities…
We study the behavior of a quantum particle trapped in a confining potential in one dimension under multiple sudden changes of velocity and/or acceleration. We develop the appropriate formalism to deal with such situation and we use it to…
Developing methods to solve nuclear many-body problems with quantum computers is an imperative pursuit within the nuclear physics community. Here, we introduce a quantum algorithm to accurately and precisely compute the ground state of…
To understand quantum optics experiments, we must perform calculations that consider the principal sources of noise, such as losses, spectral impurity and partial distinguishability. In both discrete and continuous variable systems, these…
We show that quantum computation can be performed in a system at thermal equilibrium if a spontaneous symmetry breaking occurs. The computing process is associated to the time evolution of the statistical average of the qubit coherence…
The matrix element technique provides a superior statistical sensitivity for precision measurements of important parameters at hadron colliders, such as the mass of the top quark or the cross section for the production of Higgs bosons. The…
In what has been described as the fourth age of Quantum Chemistry, variational nuclear motion programs are now routinely being used to obtain the vibration-rotation levels and corresponding wavefunctions of small molecules to the sort of…
We present a precise and efficient computation of the two-loop amplitudes entering the Higgs boson pair production process via gluon fusion. Our approach is based on the small-Higgs-mass expansion while keeping the full dependence on the…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in…
A new approach to building explicit time-marching stencil computation schemes for the transient 2D acoustic wave equation is implemented. It is based on using Poisson's formula and its three time level modification combined with polynomial…