Related papers: Supersymmetry and Quantum Computation
In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the…
The multidimensional N=4 supersymmetric quantum mechanics (SUSY QM) is constructed using the superfield approach. As a result, the component form of the classical and quantum Lagrangian and Hamiltonian is obtained. In the considered SUSY QM…
The nonlinear supersymmetry of one-dimensional systems is investigated in the context of the quantum anomaly problem. Any classical supersymmetric system characterized by the nonlinear in the Hamiltonian superalgebra is symplectomorphic to…
We present a quantum-classical algorithm to study the dynamics of the two-spatial-site Schwinger model on IBM's quantum computers. Using rotational symmetries, total charge, and parity, the number of qubits needed to perform computation is…
A quantum mechanical model that realizes the $ \mathbb{Z}_2 \times \mathbb{Z}_2$-graded generalization of the one-dimensional supertranslation algebra is proposed. This model shares some features with the well-known Witten model and is…
Although spin is a core property in fermionic systems, its symmetry can be easily violated in a variational simulation, especially when strong correlation plays a vital role therein. In this study, we will demonstrate that the broken…
We elucidate the profound connection between physics and computation by proposing and examining the model of the non-Hermitian quantum computer (NQC). In addition to conventional quantum gates such as the Hadamard, phase, and CNOT gates,…
Supersymmetry between bosons and fermions is modeled within PT- symmetric quantum mechanics. A non-Hermitian alternative to the Witten's supersymmetric quantum mechanics is obtained.
Machine learning algorithms perform well on identifying patterns in many different datasets due to their versatility. However, as one increases the size of the dataset, the computation time for training and using these statistical models…
We discuss spontaneous supersymmetry breaking in the N=1 Wess-Zumino model in two dimensions on the lattice using Wilson fermions and the fermion loop formulation. In that formulation the fermion sign problem related to the vanishing of the…
We present several examples of supersymmetric quantum mechanical systems with weak superalgebra $su(N|1)$. One of them is the weak $su(N|1)$ oscillator. It has a singlet ground state, $N +1$ degenerate states at the first excited level,…
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
Supersymmetry (SUSY) in non-relativistic quantum mechanics (QM) is applied to a 2-dimensional physical system: a neutron in an external magnetic field. The superpotential and the two-component wave functions of the ground state are found…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
The concept of superintegrability in quantum mechanics is extended to the case of a particle with spin s=1/2 interacting with one of spin s=0. Non-trivial superintegrable systems with 8- and 9-dimensional Lie algebras of first-order…
We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms.…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
A novel family of exactly solvable quantum systems on curved space is presented. The family is the quantum version of the classical Perlick family, which comprises all maximally superintegrable 3-dimensional Hamiltonian systems with…