We demonstrate an alternative method for calculating the asymptotic behaviour of the discrete one-coin quantum walk on the infinite line, via the Jacobi polynomials that arise in the path-integral representation. We calculate the asymptotics using a method that is significantly easier to use than the Darboux method. It also provides a single integral representation for the wavefunction that works over the full range of positions, n, including throughout the transitional range where the behaviour changes from oscillatory to exponential. Previous analyses of this system have run into difficulties in the transitional range, because the approximations on which they were based break down here. The fact that there are two different kinds of approach to this problem (path integral versus Schrodinger wave mechanics) is ultimately a manifestation of the equivalence between the path-integral formulation of quantum mechanics and the original formulation developed in the 1920s. We also discuss how and why our approach is related to the two methods that have already been used to analyse these systems.
They diagonalize the matrix @math , finding the eigenvalues @math and @math where @math . They then write the @math -functions in terms of the eigenvalues @math and @math and their associated eigenvectors and formally invert the original fourier transform to obtain the closed form integral representations for the wavefunction, They then approximate these, using a combination of the method of stationary phase in one range, and integration by parts in the other. (Note that the Left-Right labelling convention in @cite_4 is the opposite to ours.)
@cite_4
2085454684 2063399239 2801305581 2065254635
We describe a new method to truncate and recouple basis functions in general variational calculations based on a direct‐product representation of multidimensional wave functions. The method is presented for molecular vibrations; however, the procedure is quite general and can be used in any basis set expansion method. The direct‐product Hamiltonian matrix H is decomposed into a block diagonal matrix H0 plus a remainder H1 . A new subset of basis functions is obtained by diagonalizing H0 . This subset of basis functions is shown to be eigenfunctions of a Hamiltonian in a reduced dimensionality space, ‘‘dressed’’ by the remaining degrees of freedom. These dressed eigenfunctions are then augmented by the component of the original direct‐product basis in which H0 is diagonal. The new basis is recoupled using an energy selection criterion, yielding a substantial reduction in the size of the final full Hamiltonian matrix. The method also suggests a generalization of the vibrational self‐consistent field method,... We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation, general hyperbolic equations, and curvilinear tomography. The problem is to numerically evaluate a so-called Fourier integral operator (FIO) of the form @math at points given on a Cartesian grid. Here, @math is a frequency variable, @math is the Fourier transform of the input @math , @math is an amplitude, and @math is a phase function, which is typically as large as @math ; hence the integral is highly oscillatory. Because a FIO is a dense matrix, a naive matrix vector product with an input given on a Cartesian grid of size @math by @math would require @math operations. This paper develops a new numerical algorithm which requires @math operations and as low as @math in storage space (the constants in front of these estimates are small). It operates by localizing the integral over polar wedges with small angular aperture in the frequency plane. On each wedge, the algorithm factorizes the kernel @math into two components: (1) a diffeomorphism which is handled by means of a nonuniform FFT and (2) a residual factor which is handled by numerical separation of the spatial and frequency variables. The key to the complexity and accuracy estimates is the fact that the separation rank of the residual kernel is provably independent of the problem size. Several numerical examples demonstrate the numerical accuracy and low computational complexity of the proposed methodology. We also discuss the potential of our ideas for various applications such as reflection seismology. We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity @math where @math is an absolute sum of Hamiltonian coefficients and @math is target precision. For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T gate complexity @math where @math is number of orbitals in the basis. Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime. Compiling to surface code fault-tolerant gates and assuming per gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about one million superconducting qubits in a matter of hours. We develop an exponentially accurate fractional spectral collocation method for solving steady-state and time-dependent fractional PDEs (FPDEs). We first introduce a new family of interpolants, called fractional Lagrange interpolants, which satisfy the Kronecker delta property at collocation points. We perform such a construction following a spectral theory recently developed in [M. Zayernouri and G. E. Karniadakis, J. Comput. Phys., 47 (2013), pp. 2108--2131] for fractional Sturm--Liouville eigenproblems. Subsequently, we obtain the corresponding fractional differentiation matrices, and we solve a number of linear FODEs in addition to linear and nonlinear FPDEs to investigate the numerical performance of the fractional collocation method. We first examine space-fractional advection-diffusion problem and generalized space-fractional multiterm FODEs. Next, we solve FPDEs, including the time- and space-fractional advection-diffusion equation, time- and space-fractional multiterm FPDEs, and finally the space...