Related papers: Quantum computation of magnon spectra
Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is…
We present and benchmark a quantum computing approach to calculate the two-dimensional coherent spectrum (2DCS) of high-spin models. Our approach is based on simulating their real-time dynamics in the presence of several magnetic field…
While the recent demonstration of accurate computations of classically intractable simulations on noisy quantum processors brings quantum advantage closer, there is still the challenge of demonstrating it for practical problems. Here we…
Quantum spectroscopy with single two level systems has considerably improved our ability to detect weak signals. Recently it was realized that for classical signals, precision and resolution of quantum spectroscopy is limited mainly by…
With the surge of quantum computing platforms that continue to push the boundaries of capabilities of noisy intermediate-scale quantum computers, there is a growing interest in finding relevant applications and quantifying the corresponding…
Coherence and entanglement are the two most crucial resources for various quantum information processing tasks. Here, we study the interplay of coherence and entanglement under the action of different three qubit quantum cloning operations.…
Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise…
We present a scheme for universal quantum computing using XY Heisenberg spin chains. Information is encoded into packets propagating down these chains, and they interact with each other to perform universal quantum computation. A circuit…
We show that cluster algorithms for quantum models have a meaning independent of the basis chosen to construct them. Using this idea, we propose a new method for measuring with little effort a whole class of Green's functions, once a…
Spin noise spectroscopy has developed into a very powerful tool to access the electron spin dynamics. While the spin-noise power spectrum in an ensemble of quantum dots in a magnetic field is essentially understood, we argue that the…
The accurate computational study of wavepacket nuclear dynamics is considered to be a classically intractable problem, particularly with increasing dimensions. Here we present two algorithms that, in conjunction with other methods developed…
It has recently been shown that one can perform quantum computation in a Heisenberg chain in which the interactions are 'always on', provided that one can abruptly tune the Zeeman energies of the individual (pseudo-)spins. Here we provide a…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…
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…
We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for…
Quantum computing holds the potential to solve problems that are practically unsolvable by classical computers due to its ability to significantly reduce time complexity. We aim to harness this potential to enhance ray casting, a pivotal…
Quantum computation in molecular magnets is studied by solving the time-dependent Schr\"{o}dinger equation numerically. Following Leuenberger and Loss (Nature (London) 410, 789(2001)), an external oscillating magnetic field is applied to…
We have found that encapsulated atoms in fullerene molecules, which carry a spin, can be used for fast quantum computing. We describe the scheme for performing quantum computations, going through the preparation of the qubit state and the…