Related papers: Computing the coefficients of transformations betw…
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applied to small systems. By contrast, we demonstrate that quantum…
We calculate transition amplitudes and probabilities between the coherent and Fock states of a quantum harmonic oscillator with a moving center for an arbitrary law of motion. These quantities are determined by the Fourier transform of the…
We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
The working of a quantum computer is described in the concrete example of a quantum simulator of the single-particle Schrodinger equation. We show that a register of 6-10 qubits is sufficient to realize a useful quantum simulator capable of…
The scalar product of two vectors with $K$ real components can be computed using two quantum channels, that is, information transmission lines in the form of spin-1/2 XX chains. Each channel has its own $K$-qubit sender and both channels…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
Calculating free energy differences is a topic of substantial interest and has many applications including molecular docking and hydration, solvation, and binding free energies which is used in computational drug discovery. However, in…
The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and…
A calculator program has been written to give confidence intervals on branching ratios for rare decay modes (or similar quantities) calculated from the number of events observed, the acceptance factor, the background estimate and the…
In a recent work we presented a recursive algorithm to compute the matrix elements of a generic Gaussian transformation in the photon-number basis. Its purpose was to evolve a quantum state by building the transformation matrix and…
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Multidimensional spectroscopy unveils the interplay of nuclear and electronic dynamics, which characterizes the ultrafast dynamics of various molecular and solid-state systems. In a class of models widely used for the simulation of such…
By means of the notion of umbrae indexed by multisets, a general method to express estimators and their products in terms of power sums is derived. A connection between the notion of multiset and integer partition leads immediately to a way…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
A new algorithm for Monte Carlo calculation of the double exchange model is studied. The algorithm is commonly applicable to wide classes of strongly correlated electron systems which involve itinerant electrons coupled with…
A theoretical model of a quantum device which can factorize any number N in two steps i.e. by preparing an input state and performing a measurement is discussed. The analysis reveals that the duration of state preparation and measurement is…
Precisely engineered mechanical oscillators keep time, filter signals, and sense motion, making them an indispensable part of today's technological landscape. These unique capabilities motivate bringing mechanical devices into the quantum…