相关论文: Computing the coefficients of transformations betw…
The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…
Quantum computing is a growing field where the information is processed by two-levels quantum states known as qubits. Current physical realizations of qubits require a careful calibration, composed by different experiments, due to noise and…
It is shown how to formulate the ubiquitous quantum chemistry problem of calculating the thermal rate constant on a quantum computer. The resulting exact algorithm scales exponentially faster with the dimensionality of the system than all…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. Of particular importance are fluctuations with the correlation time that exceeds the decoherence time due to decay and…
This article presents a new method to compute matrices from numerical simulations based on the ideas of sparse sampling and compressed sensing. The method is useful for problems where the determination of the entries of a matrix constitutes…
A new web-server called The Molecule Calculator (MolCalc) is presented. The entry page is a molecular editor (JSmol) for interactive molecule building. The resulting structure can then be used to estimate molecular properties such as heats…
The increasing difficulty in continued development of digital electronic logic has led to a renewed interest in alternative approaches. Oscillatory computing is one such approach that leverages alternative physical systems and computation…
Beyond the rotating-wave approximation, the dynamics of a quantum oscillator interacting strongly and off-resonantly with a two-level system exhibit beatings, whose period equals the revival time of the two-level system. On a longer time…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
Why are different mass states coherent? What is the correct formula for the oscillation phase? How can textbook formulas for oscillations in time describe experiments which never measure time? How can we treat the different velocities and…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
In this paper an algorithm for transient simulation of switching converters using prediction and correction to calculate duty ratio is proposed. It provides large signal simulation on the level of averaged currents and voltages in the…
This study proposes a recursive and easy-to-implement algorithm to compute the score and Hessian matrix in general regime-switching models. We use simulation to compare the asymptotic variance estimates constructed from the Hessian matrix…
We show that a parametrically coupled qubit can be used to fully reconstruct the quantum state of a harmonic oscillator, even when both systems are subject to decoherence. By controlling the coupling strength of the qubit over time, the…
As the first useful Quantum Computers will be quantum simulators, here the minimum number of qubits necessary for the solution of the Schroedinger equation in simple test problems is evaluated. From the present preliminary results it…
Quantum computing technologies promise to revolutionize calculations in many areas of physics, chemistry, and data science. Their power is expected to be especially pronounced for problems where direct analogs of a quantum system under…
We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial bound of O(m 2^n), where m is the size of an input program…