Related papers: The confluent algorithm in second order supersymme…
We show how entanglement can be used, without being consumed, to accomplish unitary operations that could not be performed with out it. When applied to infinitesimal transformations our method makes equivalent, in the sense of Hamiltonian…
A technique to reconstruct one-dimensional, reflectionless potentials and the associated quantum wave functions starting from a finite number of known energy spectra is discussed. The method is demonstrated using spectra that scale like the…
We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured…
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
The curvelet transform is a directional wavelet transform over R^n, which is used to analyze functions that have singularities along smooth surfaces (Candes and Donoho, 2002). I demonstrate how this can lead to new quantum algorithms. I…
We compute the partition function and specific heat for a quantum mechanical particle under the influence of a quartic double-well potential non-perturbatively, using the semiclassical method. Near the region of bounded motion in the…
Second order supersymmetric approach is taken to the system describing motion of a quantum particle in a potential endowed with position-dependent effective mass. It is shown that the intertwining relations between second order partner…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
A simple model coupling a one-dimensional beam particle to a one-dimensional harmonic oscillator is used to explore complementarity and entanglement. This model, well-known in the inelastic scattering literature, is presented under three…
Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…
The two-dimensional quantum harmonic oscillator is modified with reflection terms associated with the action of the Coxeter group $B_2$, which is the symmetry group of the square. The angular momentum operator is also modified with…
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…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
The isotropic harmonic oscillator and the Kepler-Coulomb system are pivotal models in the Sciences. They are two examples of second-order (maximally) superintegrable (Hamiltonian) systems. These systems are classified in dimension two. A…
While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
Many quantum algorithms, such as Harrow-Hassidim-Lloyd (HHL) algorithm, depend on oracles that efficiently encode classical data into a quantum state. The encoding of the data can be categorized into two types; analog-encoding where the…
Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as "the quantum variational eigensolver" was developed…