Related papers: A simple and efficient algorithm for computing the…
We consider an n-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian. The algorithm is based on the representation of…
We consider various iterative algorithms for solving the linear equation $ax=b$ using a quantum computer operating on the principle of quantum annealing. Assuming that the computer's output is described by the Boltzmann distribution, it is…
In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index $\alpha \in {\left(-\infty \, , \, 0 \right)}\cup {\left(1 \, , \,…
In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as…
A closed expression to the Baker-Campbell-Hausdorff (B-C-H) formula in SO(4) is given by making use of the magic matrix by Makhlin. As far as we know this is the {\bf first nontrivial example} on (semi-) simple Lie groups summing up all…
In this paper, a class of high order numerical schemes is proposed for solving Hamilton-Jacobi (H-J) equations. This work is regarded as an extension of our previous work for nonlinear degenerate parabolic equations, see Christlieb et al.…
We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the…
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for…
The hypercomputers compute functions or numbers, or more generally solve problems or carry out tasks, that cannot be computed or solved by a Turing machine. Several numerical simulations of a possible hypercomputational algorithm based on…
Julia is a mature general-purpose programming language, with a large ecosystem of libraries and more than 12000 third-party packages, which specifically targets scientific computing. As a language, Julia is as dynamic, interactive, and…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…
Variable selection is central to high-dimensional data analysis, and various algorithms have been developed. Ideally, a variable selection algorithm shall be flexible, scalable, and with theoretical guarantee, yet most existing algorithms…
We present StochasticPrograms.jl, a user-friendly and powerful open-source framework for stochastic programming written in the Julia language. The framework includes both modeling tools and structure-exploiting optimization algorithms.…
The product of two unitaries can normally be expressed as a single exponential through the famous Baker-Campbell-Hausdorff formula. We present here a counterexample in quantum optics, by showing that an expression in terms of a single…
Dynamic languages have become popular for scientific computing. They are generally considered highly productive, but lacking in performance. This paper presents Julia, a new dynamic language for technical computing, designed for performance…
Improved algorithms for computing (partial and full) exterior algebraic shifts of hypergraphs and simplicial complexes are presented. The main benefit is in positive characteristic. Experiments with an implementation in OSCAR with various…
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…