Related papers: Efficient Quantum Hermite Transform
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
The expansion of quantum states and operators in terms of Fock states plays a fundamental role in the field of continuous-variable quantum mechanics. In particular, for general single-mode Gaussian operators and Gaussian noisy states, many…
The evolution speed in projective Hilbert space is considered for Hermitian Hamiltonians and for non-Hermitian (NH) ones. Based on the Hilbert-Schmidt norm and the spectral norm of a Hamiltonian, resource-related upper bounds on the…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
Quantum simulation represents the most promising quantum application to demonstrate quantum advantage on near-term noisy intermediate-scale quantum (NISQ) computers, yet available quantum simulation algorithms are prone to errors and thus…
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a…
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. The functional form of these response functions can be mapped to a corresponding eigenproblem of…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
Non-Hermitian quantum systems exhibit unique properties and hold significant promise for diverse applications, yet their dynamical simulation poses a particular challenge due to intrinsic openness and non-unitary evolution. Here, we…
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…
Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available to process or jointly measure multiple copies of the unknown quantum state. Learning tasks can be accomplished…
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the…
Transcorrelated methods provide an efficient way of partially transferring the description of electronic correlations from the ground state wavefunction directly into the underlying Hamiltonian. In particular, Dobrautz et al. [Phys. Rev. B,…
The motivation for studying non-Hermitian systems and the role of $\mathcal{PT}$-symmetry is discussed. We investigate the use of a quantum algorithm to find the eigenvalues and eigenvectors of non-Hermitian Hamiltonians, with applications…
In order to characterize quantum states within the context of information geometry, we propose a generalization of the Gaussian model, which we called the Hermite-Gaussian model. We obtain the Fisher-Rao metric and the scalar curvature for…