Related papers: Towards Efficient Computation of Functional Determ…
After motivating the need of a multiscale version of fractional calculus in quantum gravity, we review current proposals and the program to be carried out in order to reach a viable definition of scale-dependent fractional operators. We…
We present a set of new, efficient high-order symplectic methods designed for Hamiltonian systems with cubic or quartic potentials. By demonstrating that polynomial potentials require fewer order conditions, we develop schemes that…
In phase space, we analytically obtain the characteristic functions (CFs) of a forced harmonic oscillator [Talkner et al., Phys. Rev. E, 75, 050102 (2007)], a time-dependent mass and frequency harmonic oscillator [Deffner and Lutz, Phys.…
An earlier paper gave a means of calculating the Lamb shift via Feynman diagrams. Here we apply the same techniques to TQFT.
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
Main purposes of the paper are followings: 1) To show examples of the calculations in domain of QFT via ``derivative rules'' of an expert system; 2) To consider advantages and disadvantage that technology of the calculations; 3) To reflect…
We describe a unified approach to calculating the partition functions of a general multi-level system with a free Hamiltonian. Particularly, we present new results for parastatistical systems of any order in the second quantized approach.…
We consider Lorentzian CFT Wightman functions in momentum space. In particular, we derive a set of reference formulas for computing two- and three-point functions, restricting our attention to three-point functions where the middle operator…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
A general method to construct basis functions for fermionic systems which account for the $SU(2)$ symmetry and for the translational invariance of the Hamiltonian is presented. The method does not depend on the dimensionality of the system…
The fundamental importance of functional differential equations has been recognized in many areas of mathematical physics, such as fluid dynamics (Hopf characteristic functional equation), quantum field theory (Schwinger-Dyson equations)…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
Estimation of a quadratic functional over parameter spaces that are not quadratically convex is considered. It is shown, in contrast to the theory for quadratically convex parameter spaces, that optimal quadratic rules are often rate…
Sharp upper and lower bounds for the second and third order Hermitian-Toepilitz determinants are obtained for some generalized subclasses of starlike and convex functions. Applications of these results are also discussed for several widely…
The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…
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…
We reelaborate on a general method for obtaining effective Hamiltonians that describe different nonlinear optical processes. The method exploits the existence of a nonlinear deformation of the su(2) algebra that arises as the dynamical…