Related papers: Computing the coefficients of transformations betw…
While there are various approaches to benchmark physical processors, recent findings have focused on computational phase transitions. This is due to several factors. Importantly, the hardest instances appear to be well-concentrated in a…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
The main motivation for this work is the exploration of rotational-vibrational states corresponding to electronic excitations in a pre-Born-Oppenheimer quantum theory of molecules. These states are often embedded in the continuum of the…
In this work, we study the pairing Hamiltonian with four particles at finite temperatures on a quantum simulator and a superconducting quantum computer. The excited states are obtained by the variational quantum deflation (VQD). The…
We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians. Our method supports generic reference…
Neutrino oscillation experiments will be entering the precision era in the next decade with the advent of high statistics experiments like DUNE, HK, and JUNO. Correctly estimating the confidence intervals from data for the oscillation…
We propose a state-specific orbital optimization scheme for improving the accuracy of excited states of the electronic structure Hamiltonian for the use on near-term quantum computers, which can be combined with any overlap-based…
The computation of the ground state (i.e. the eigenvector related to the smallest eigenvalue) is an important task in the simulation of quantum many-body systems. As the dimension of the underlying vector space grows exponentially in the…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
We present a simple technique for the computation of coarse-scale steady states of dynamical systems with time scale separation in the form of a "wrapper" around a fine-scale simulator. We discuss how this approach alleviates certain…
We describe an algorithm for the numerical solution of second order linear differential equations in the highly-oscillatory regime. It is founded on the recent observation that the solutions of equations of this type can be accurately…
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown…
Obreshkov-like numerical integrators have been widely applied to power system transient simulation. Misuse of the numerical integrators as numerical differentiators may lead to numerical oscillation or bias. Criteria for Obreshkov-like…
Estimating transition rates in open quantum systems is hampered by computing-resource demands that grow rapidly with system size. We present a quantum-simulation framework that enables efficient estimation by recasting the transition rate,…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
We analyze the properties of a quantum system composed of two coherently coupled quantum oscillators and show through simulations that it fulfills the two properties required for reservoir computing: non-linearity and fading memory. We…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
We present new algorithms for computing the low $n$ bits or the high $n$ bits of the product of two $n$-bit integers. We show that these problems may be solved in asymptotically 75% of the time required to compute the full $2n$-bit product,…
We propose a new method for the efficient approximation of a class of highly oscillatory weighted integrals where the oscillatory function depends on the frequency parameter $\omega \geq 0$, typically varying in a large interval. Our…
Mixed state entanglement measures can act as a versatile probes of many-body systems. However, they are generally hard to compute, often relying on tricky optimizations. One measure that is straightforward to compute is the logarithmic…