相关论文: The confluent algorithm in second order supersymme…
The first and second-order supersymmetry transformations are used to generate Hamiltonians with known spectra departing from the trigonometric Poschl-Teller potentials. The several possibilities of manipulating the initial spectrum are…
There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…
In this article we explore the quantum properties of a degenerate optical parametric oscillator when it is tuned to the first family of transverse modes at the down converted frequency.
We investigate the transition from second to first order systems. This transforms configuration space into phase space and hence introduces noncommutativity in the former. Quantum mechanically, the transition may be described in terms of…
Real life quantum computers are inevitably affected by intrinsic noise resulting in dissipative non-unitary dynamics realized by these devices. We consider an open system quantum annealing algorithm optimized for a realistic analog quantum…
Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems meets challenges related to the efficiency of quantum…
We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is…
In this project, we will develop the foundations of quantum mechanics using the methods of supersymmetry. We will discuss the use of the superpotential to derive the supersymmetric partner of a potential in one dimension, and explore…
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…
Recent advancements of intermediate-scale quantum processors have triggered tremendous interest in the exploration of practical quantum advantage. The simulation of fluid dynamics, a highly challenging problem in classical physics but vital…
Chains of first-order SUSY transformations for the spin equation are studied in detail. It is shown that the transformation chains are related with a olynomial pseudo-supersymmetry of the system. Simple determinant formulas for the final…
Quantum networks require interfacing stationary and flying qubits. These flying qubits are usually nonclassical states of light. Here we consider two of the leading source technologies for nonclassical light, spontaneous parametric…
Quantum machine learning aims to release the prowess of quantum computing to improve machine learning methods. By combining quantum computing methods with classical neural network techniques we aim to foster an increase of performance in…
A two-mode optical parity-time (PT) symmetric system, with gain and damping, described by a quantum quadratic Hamiltonian with additional small Kerr-like nonlinear terms, is analyzed from the point of view of nonclassical-light generation.…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
The class of incoherent operations induces a pre-order on the set of quantum pure states, defined by the possibility of converting one state into the other by transformations within the class. We prove that if two $n$-dimensional pure…
It is shown that the eigenproblem of any $2\times 2$ matrix Hamiltonian with discrete eigenvalues is involved with a supersymmetric quantum mechanics. The energy dependence of the superalgebra marks the disparity between the deduced…
The groundstate configuration and the eigenmodes of two parallel two-dimensional classical atoms are obtained as function of the inter-atomic distance (d). The classical particles are confined by identical harmonic wells and repel each…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…