Related papers: Exponential quantum advantages for practical non-H…
Recent years have seen remarkable development in open quantum systems effectively described by non-Hermitian Hamiltonians. A unique feature of non-Hermitian topological systems is the skin effect, anomalous localization of an extensive…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
Non-smoothness at optimal points is a common phenomenon in many eigenvalue optimization problems. We consider two recent algorithms to minimize the largest eigenvalue of a Hermitian matrix dependent on one parameter, both proven to be…
Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum…
Parity-time ($\mathcal{PT}$) symmetry is a cornerstone of non-Hermitian physics as it ensures real energies for stable experimental realization of non-Hermitian phenomena. In this work, we propose $\mathcal{PT}$ symmetry as a paradigm for…
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum hardware that is well suited for quantum…
Characterization of near-term quantum computing platforms requires the ability to capture and quantify dissipative effects. This is an inherently challenging task, as these effects are multifaceted, spanning a broad spectrum from Markovian…
A non-Hermitian operator with a real spectrum and a complete set of eigenvectors may serve as the Hamiltonian operator for a unitary quantum system provided that one makes an appropriate choice for the defining inner product of the physical…
The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the…
Non-Hermitian physics has attracted considerable attention in recent years, particularly the non-Hermitian skin effect (NHSE) for its extreme sensitivity and non-locality. While the NHSE has been physically observed in various classical…
Variational quantum algorithms are promising applications of noisy intermediate-scale quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and-measure experiments that estimate terms in a Hamiltonian. The…
Quantum algorithms are promising candidates for the enhancement of computational efficiency for a variety of computational tasks, allowing for the numerical study of physical systems intractable to classical computers. In the Noisy…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
We demonstrate that non-Hermitian Hamiltonian systems with spontaneously broken PT-symmetry and partially complex eigenvalue spectrum can be made meaningful in a quantum mechanical sense when introducing some explicit time-dependence into…
Non-Hermitian systems, going beyond conventional Hermitian systems, have brought in intriguing concepts such as exceptional points and complex spectral topology as well as exotic phenomena such as non-Hermitian skin effects (NHSEs).…
The relevance in Physics of non-Hermitian operators with real eigenvalues is being widely recognized not only in quantum mechanics but also in other areas, such as quantum optics, quantum fluid dynamics and quantum field theory. %stochastic…
We analyze several non-Hermitian Hamiltonians with antiunitary symmetry from the point of view of their point-group symmetry. It enables us to predict the degeneracy of the energy levels and to reduce the dimension of the matrices necessary…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…
We develop and analyze a fault-tolerant quantum algorithm for computing $n$-th order response properties necessary for analysis of non-linear spectroscopies of molecular and condensed phase systems. We use a semi-classical description in…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…