Related papers: Effective quantum number for axially symmetric pro…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of…
Problems concerning with application of quantum rules on classical phenomena have been widely studied, for which lifted up the idea about quantization and uncertainty principle. Energy quantization on classical example of simple harmonic…
A class of quantum analogues of compact symmetric spaces of classical type is introduced by means of constant solutions to the reflection equations. Their zonal spherical functions are discussed in connection with $q$-orthogonal…
Besides the standard quantum version of the Coulomb/Kepler problem, an alternative quantum model with not too dissimilar phenomenological (i.e., spectral and scattering) as well as mathematical (i.e., exact-solvability) properties may be…
Quantum computing is a new computational paradigm with the potential to solve certain computationally challenging problems much faster than traditional approaches. Civil engineering encompasses many computationally challenging problems,…
A generalized universal quantum cloning machine is proposed which allows the input to be arbitrary states in symmetric subspace. And it reduces to the universal quantum cloning machine (UQCM) if the input are identical pure states. The…
Generalizations of the complex number system underlying the mathematical formulation of quantum mechanics have been known for some time, but the use of the commutative ring of bicomplex numbers for that purpose is relatively new. This paper…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
Generalized coherent states for shape invariant potentials are constructed using an algebraic approach based on supersymmetric quantum mechanics. We show this generalized formalism is able to: a) supply the essential requirements necessary…
We study the quantum separability problem by using general symmetric informationally complete measurements and present a separability criterion for arbitrary dimensional bipartite systems. We show by detailed examples that our criterion is…
A general procedure is presented to construct conditionally solvable (CES) potentials using the techniques of supersymmetric quantum mechanics.The method is illustrated with potentials related to the harmonic oscillator problem.Besides…
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
What can one do with a given tunable quantum device? We provide complete symmetry criteria deciding whether some effective target interaction(s) can be simulated by a set of given interactions. Symmetries lead to a better understanding of…
The longstanding issue of general covariance in effective models of quantum gravity is addressed, which arises when canonical quantum gravity leads to a semiclassical model described by an effective Hamiltonian constraint. In the context of…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
We study the quantum tunnel effect through a potential barrier employing a semiclassical formulation of quantum mechanics based on expectation values of configuration variables and quantum dispersions as dynamical variables. The evolution…
We present a unified approach for solving and classifying exactly solvable potentials. Our unified approach encompasses many well-known exactly solvable potentials. Moreover, the new approach can be used to search systematically for a new…
Quantum computing has shown significant potential to address complex optimization problems; however, its application remains confined to specific problems at limited scales. Spatial regionalization remains largely unexplored in quantum…