Related papers: Universal Complex Quantum-Like Bits from Hermitian…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
It is well--known that if one is given a principal $G$--bundle with a principal connection, then for every unitary finite--dimensional linear representation of $G$ one can induce a linear connection and a Hermitian structure on the…
While parity-time (PT)-symmetric systems can exhibit real spectra in the exact PT-symmetry regime, the PT-symmetry is actually not a necessary condition for the real spectra. Here we show that non-PT-symmetric photonic crystals carrying…
We propose a framework for achieving perfect synchronization in complex networks of Sakaguchi-Kuramoto oscillators in presence of higher order interactions (simplicial complexes) at a targeted point in the parameter space. It is achieved by…
We show that parametric coupling techniques can be used to generate selective entangling interactions for multi-qubit processors. By inducing coherent population exchange between adjacent qubits under frequency modulation, we implement a…
Recent attention has turned to exploring quantum information within larger Hilbert spaces by utilizing qudits, which offer increased information capacity and potential for robust quantum communications. While the efficient generation of…
Diagrammatic techniques for reasoning about monoidal categories provide an intuitive understanding of the symmetries and connections of interacting computational processes. In the context of categorical quantum mechanics, Coecke and…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
A diagonalizable non-Hermitian Hamiltonian having a real spectrum may be used to define a unitary quantum system, if one modifies the inner product of the Hilbert space properly. We give a comprehensive and essentially self-contained review…
A mixed quantum state is represented by a Hermitian positive semi-definite operator $\rho$ with unit trace. The positivity requirement is responsible for a highly nontrivial geometry of the set of quantum states. A known way to satisfy this…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
A non-Hermitian Hamiltonian that has an unbroken PT symmetry can be converted by means of a similarity transformation to a physically equivalent Hermitian Hamiltonian. This raises the following question: In which form of the quantum theory,…
Witten's supersymmetric quantum mechanics may incorporate potentials with strong singularities after their appropriate regularization. This was proposed by Das and Pernice [Nucl. Phys. B 561 (1999) 357 and arXiv: hep-th/0207112]. We suggest…
Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and…
Graph signals arise in various applications, ranging from sensor networks to social media data. The high-dimensional nature of these signals implies that they often need to be compressed in order to be stored and transmitted. The common…
Solving eigenproblem of the Laplacian matrix of a fully connected weighted graph has wide applications in data science, machine learning, and image processing, etc. However, this is very challenging because it involves expensive matrix…
Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph…
We introduce the notion of nonlocal symmetry of a graph $G$, defined as a winning quantum correlation for the $G$-automorphism game that cannot be produced classically. Recent connections between quantum group theory and quantum information…
Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…