Related papers: Effective quantum number for axially symmetric pro…
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems…
The symmetrized quartic polynomial oscillator is shown to admit an sl(2,$\R$) algebraization. Some simple quasi-exactly solvable (QES) solutions are exhibited. A new symmetrized sextic polynomial oscillator is introduced and proved to be…
We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding…
We present a brief survey of results where quantum information processing is useful to solve distributed computation tasks. We describe problems that are impossible to solve using classical resources but that become feasible with the help…
We develop a formalism that allows the computation of the quantum effective potential of a scalar order parameter in a class of holographic theories at finite temperature and charge density. The effective potential is a valuable tool for…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
The quantum integrability is established for the one-dimensional supersymmetric $U$ model with boundary terms by means of the quantum inverse scattering method. The boundary supersymmetric $U$ chain is solved by using the coordinate space…
We present a simple method to deal with caustics in the semiclassical approximation to the partition function of a one-dimensional quantum system. The procedure, which makes use of complex trajectories, is applied to the quartic double-well…
The definitions of classical and quantum singularities in general relativity are reviewed. The occurence of quantum mechanical singularities in certain spherically symmetric and cylindrically symmetric (including infinite line…
The universality of a quantum neural network refers to its ability to approximate arbitrary functions and is a theoretical guarantee for its effectiveness. A non-universal neural network could fail in completing the machine learning task.…
Within the frame of a novel treatment we make a complete mathematical analysis of exactly solvable one-dimensional quantum systems with non-constant mass, involving their ordering ambiguities. This work extends the results recently reported…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
We describe a quantum algorithm that generalizes the quantum linear system algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] to arbitrary problem specifications. We develop a state preparation routine that can initialize…
We propose in this work a concept of integrability for quantum systems, which corresponds to the concept of noncommutative integrability for systems in classical mechanics. We determine a condition for quantum operators which can be a…
Before the availability of large scale fault-tolerant quantum devices, one has to find ways to make the most of current noisy intermediate-scale quantum devices. One possibility is to seek smaller repetitive hybrid quantum-classical tasks…
The approximate numerical method for a calculation of a quantum wave impedance in a case of a potential energy with a complicated spatial structure is considered. It was proved that the approximation of a real potential by a piesewise…
In this paper we propose an efficient solution of an equivalence problem for semisimple cyclic codes.
We discuss the notion of an effective, average, quantum mechanical path which is a solution of the dynamical equations obtained by extremizing the quantum effective action. Since the effective action can, in general, be complex, the…
Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where…