Related papers: Numerical matrix method for quantum periodic poten…
The modeling of electric machines and power transformers typically involves systems of nonlinear magnetostatics or -quasistatics, and their efficient and accurate simulation is required for the reliable design, control, and optimization of…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
We introduce a numerical method to simulate nonlinear open quantum dynamics of a particle in situations where its state undergoes significant expansion in phase space while generating small quantum features at the phase-space Planck scale.…
We propose two improvements to the well-known power series method for confined one-dimensional quantum-mechanical problems. They consist of the addition of a variational step were the energy plays the role of a variational parameter. We…
Porous electrodes are widely used in electrochemical systems, where accurately determining electric potentials, particularly overpotentials, is essential for understanding electrode behavior. At the macroscopic scale, porous electrodes are…
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset…
The quantum mechanical tunneling through multiple quantum barriers is a long-standing and well-known problem. Three methods proposed earlier to calculate the tunneling probabilities and energy splitting: (1). Instanton Method (2) WKb…
Systems of correlated quantum matter can be a steep challenge to any would-be method of solution. Matrix-product state (MPS)-based methods can describe 1D systems quasiexactly, but often struggle to retain sufficient bipartite entanglement…
We propose a new type of multilevel method for solving eigenvalue problems based on Newton iteration. With the proposed iteration method, solving eigenvalue problem on the finest finite element space is replaced by solving a small scale…
The Duffin Kemmer Petiau (DKP) equation is solved approximately for a vector exponential-like decaying potential with any arbitrary J state by using the Pekeris approximation. The generalized parametric Nikiforov-Uvarov (NU) method is used…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…
We describe three different methods for generating quasi-exactly solvable potentials, for which a finite number of eigenstates are analytically known. The three methods are respectively based on (i) a polynomial ansatz for wave functions;…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
We develop a novel quantum transfer matrix method to study thermodynamic properties of one-dimensional (1D) disordered electronic systems. It is shown that the partition function can be expressed as a product of $2\times2$ local transfer…
We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we…
It is shown that quantum mechanics on noncommutative spaces (NQM) can be obtained by the canonical quantization of some underlying second class constrained system formulated in extended configuration space. It leads, in particular, to an…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an…