相关论文: Detecting Broken PT-Symmetry

This overview focuses on the notion of partial dynamical symmetry (PDS), for which a prescribed symmetry is obeyed by a subset of solvable eigenstates, but is not shared by the Hamiltonian. General algorithms are presented to identify…

Three ways of constructing a non-Hermitian matrix with possible all real eigenvalues are discussed. They are PT symmetry, pseudo-Hermiticity, and generalized PT symmetry. Parameter counting is provided for each class. All three classes of…

The statistics of gap ratios between consecutive energy levels is a widely used tool, in particular in the context of many-body physics, to distinguish between chaotic and integrable systems, described respectively by Gaussian ensembles of…

The concept of parity-time (PT) symmetry originates from the framework of quantum mechanics, where if the Hamiltonian operator satisfies the commutation relation with the parity and time operators, it shows all real eigen-energy spectrum.…

This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…

This paper considers the problem of robust stability for a class of uncertain quantum systems subject to unknown perturbations in the system Hamiltonian. Some general stability results are given for different classes of perturbations to the…

We investigate quantum symmetries in terms of their large-time stability with respect to perturbations of the Hamiltonian. We find a complete algebraic characterization of the set of symmetries robust against a single perturbation and we…

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…

We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues…

We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…

The problem of the electromagnetic self-force can be studied in terms of a quadratic PT-symmetric Hamiltonian. Here, we apply a straightforward algebraic method to determine the regions of model-parameter space where the quantum-mechanical…

A quantum walker on a graph, prepared in the state $| \psi_{\rm in} \rangle$, e.g. initially localized at node $r_{\rm in}$, is repeatedly probed, with fixed frequency $1/\tau$, to test its presence at some target node $r_{\rm d}$ until the…

Matrix quasi exactly solvable operators are considered and new conditions are determined to test whether a matrix differential operator possesses one or several finite dimensional invariant vector spaces. New examples of $2\times 2$-matrix…

One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…

Extended quantum mechanics using non-Hermitian, pseudo-Hermitian Hamiltonians is briefly reviewed. Supersymmetric regularizations, solvable simulations and large-N expansion techniques are recollected as suitable means for the study of…

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…

Quantum theory can be formulated with certain non-Hermitian Hamiltonians. An anti-linear involution, denoted by PT, is a symmetry of such Hamiltonians. In the PT-symmetric regime the non-Hermitian Hamiltonian is related to a Hermitian one…

We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…

Parity-time (PT) symmetric systems have two distinguished phases, e.g., one with real energy eigenvalues and the other with complex conjugate eigenvalues. To enter one phase from the other, it is believed that the system must pass through…

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…