Related papers: Supersymmetry and Quantum Computation
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. Quantum computational algorithms have the potential to be an exciting new way of studying quantum cosmology. In quantum…
We use strong complementarity to introduce dynamics and symmetries within the framework of CQM, which we also extend to infinite-dimensional separable Hilbert spaces: these were long-missing features, which open the way to a wealth of new…
The two ways of constrained systems quantization are considered from the point of view of their self-consistency at the quantum level. With a transparent example of a particle in the external electromagnetic field we demonstrate that the…
We present the general ideas on SuperSymmetric Quantum Mechanics (SUSY-QM) using different representations for the operators in question, which are defined by the corresponding bosonic Hamiltonian as part of SUSY Hamiltonian and its…
A new model of supersymmetry between bosons and fermions is proposed. Its representation space is spanned by states with PT symmetry and real energies but the inter-related partner Hamiltonians themselves remain complex and non-Hermitian.…
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
Quantum computing is an exciting field that uses quantum principles, such as quantum superposition and entanglement, to tackle complex computational problems. Superconducting quantum circuits, based on Josephson junctions, is one of the…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Machine learning is a fascinating and exciting field within computer science. Recently, this excitement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the…
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is…
We consider specific examples of $\mathcal{N}$ = 2 supersymmetric quantum mechanical models and list out all the novel symmetries. In each case, we show the existence of two sets of discrete symmetries that correspond to the Hodge duality…
We study the underlying extended supersymmetric structure in a system composed of fermions scattered off an infinitely extended static domain wall in the $xz$-plane. As we shall demonstrate, the fermionic scattered states are associated to…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has…
We revisit the novel symmetries in $\mathcal{N}$ = 2 supersymmetric (SUSY) quantum mechanical (QM) models by considering specific examples of coupled systems. Further, we extend our analysis to a general case and list out all the novel…
Quantum superintegrable systems are solvable eigenvalue problems. Their solvability is due to symmetry, but the symmetry is often "hidden". The symmetry generators of 2nd order superintegrable systems in 2 dimensions close under commutation…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
An elementary introduction is given to the subject of Supersymmetry in Quantum Mechanics. We demonstrate with explicit examples that given a solvable problem in quantum mechanics with n bound states, one can construct new exactly solvable n…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
A large spectrum of problems in classical physics and engineering, such as turbulence, is governed by nonlinear differential equations, which typically require high-performance computing to be solved. Over the past decade, however, the…