Related papers: Universal Complex Quantum-Like Bits from Hermitian…
Motivated by quantum gravity on spacetimes with multi-scale geometry, we analyze quantum field theories with a self-adjoint fractional power $(\Box^2)^{\gamma/2}$ of the d'Alem\-bert\-ian in the kinetic term, for any real $\gamma>0$.…
We consider bipartite tight-binding graphs composed by $N$ nodes split into two sets of equal size: one set containing nodes with on-site loss, the other set having nodes with on-site gain. The nodes are connected randomly with probability…
PT-symmetric systems can have a real spectrum even when their Hamiltonian is non-hermitian, but develop a complex spectrum when the degree of non-hermiticity increases. Here we utilize random-matrix theory to show that this spontaneous…
Over the last two decades, advances in fabrication have led to significant progress in creating patterned heterostructures that support either carriers, such as electrons or holes, with specific band structure or electromagnetic waves with…
The energy spectra of two different quantum systems are paired through supersymmetric algorithms. One of the systems is Hermitian and the other is characterized by a complex-valued potential, both of them with only real eigenvalues in their…
In traditional quantum computing, it has been established that real quantum computation augmented with non-Clifford gates is as powerful as universal quantum computation. Here we investigate this phenomenon in the non-Hermitian setting. We…
A complex conjugation of unitary quantum map is a second-order map (supermap) that maps a unitary operator $U$ to its complex conjugate $U^*$. First, we present a deterministic quantum protocol that universally implements the complex…
The complex geometry underlying the Schr\"odinger dynamics of coherent states for non-Hermitian Hamiltonians is investigated. In particular two seemingly contradictory approaches are compared: (i) a complex WKB formalism, for which the…
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…
Bound states generated by K coupled PT-symmetric square wells are studied in a series of models where the Hamiltonians are assumed $R-$pseudo-Hermitian and $R^2-$symmetric. Specific rotation-like generalized parities $R$ are considered such…
We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
Non-hermitian quantum graphs possessing real (i.e., in principle, observable) spectra are studied via their discretization. The discretized Hamiltonians are assigned, constructively, an elementary pseudometric and/or a more complicated…
We consider the complexity of the local Hamiltonian problem in the context of fermionic Hamiltonians with $\mathcal N=2 $ supersymmetry and show that the problem remains $\mathsf{QMA}$-complete. Our main motivation for studying this is the…
The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean…
In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…
For a diagonalizable linear operator $H:\mathscr{H}\to\mathscr{H}$ acting in a separable Hilbert space $\mathscr{H}$, i.e., an operator with a purely point spectrum, eigenvalues with finite algebraic multiplicities, and a set of…
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine…
The ability to implement any desired quantum logic gate on a quantum processing unit is equivalent to evolution-operator controllability of the qubits. Conversely, controllability analysis can be used to minimize the resources, i.e., the…