Related papers: An efficient algorithm for the Riemannian 10j symb…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
The general form of a mapping of the spin and charge degrees of freedom of electrons onto spinless fermions and local `spin'-1/2 operators is derived. The electron Hilbert space is mapped onto a tensor productspin-charge Hilbert space. The…
Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1\otimes O_2\otimes \cdots \otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an…
An accurate impact parameter determination in a heavy ion collision is crucial for almost all further analysis. The capabilities of an artificial neural network are investigated to that respect. A novel input generation for the network is…
Interacting spin networks are fundamental to quantum computing. Data-based tomography of time-independent spin networks has been achieved, but an open challenge is to ascertain the structures of time-dependent spin networks using time…
In this work, we present a quantum algorithm for ground-state energy calculations of periodic solids on error-corrected quantum computers. The algorithm is based on the sparse qubitization approach in second quantization and developed for…
Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to…
The $\sigma$-terms are calculated at next-to-leading order in heavy baryon chiral perturbation theory by employing a cutoff regularization. The results do not depend on the cutoff value to the order we are working . The baryon masses and…
We propose a general method for the description of arbitrary single spin-j states transforming according to (j,0)+(0,j) carrier spaces of the Lorentz algebra in terms of Lorentz-tensors for bosons, and tensor-spinors for fermions, and by…
We study the approximability of computing the partition functions of two-state spin systems. The problem is parameterized by a $2\times 2$ symmetric matrix. Previous results on this problem were restricted either to the case where the…
The Wigner rotation matrix ($d$-function), which appears as a part of the angular-momentum-projection operator, plays a crucial role in modern nuclear-structure models. However, it is a long-standing problem that its numerical evaluation…
In this work, we use semigroup integral to evaluate zeta-function regularized determinants. This is especially powerful for non--positive operators such as the Dirac operator. In order to understand fully the quantum effective action one…
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
Operators for simulating the scattering of two particles with spin are constructed. Three methods are shown to give the consistent lattice operators for PN, PV, VN and NN scattering, where P, V and N denote pseudoscalar meson, vector meson…
In quantum information theory, the Schmidt rank is a fundamental measure for the entanglement dimension of a pure bipartite state. Its natural definition uses the Schmidt decomposition of vectors on bipartite Hilbert spaces, which does not…
A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…
Exact wave solutions for particles with spin 0, 1/2 and 1 in the static coordinates of the de Sitter space-time model are examined in detail. Firstly, for a scalar particle, two pairs of linearly independent solutions are specified…
We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).