Related papers: Quantum site percolation on amenable graphs
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
The special structures that arise in symplectic topology (particularly Gromov--Witten invariants and quantum homology) place as yet rather poorly understood restrictions on the topological properties of symplectomorphism groups. This…
We study equivariant families of discrete Hamiltonians on amenable geometries and their integrated density of states (IDS). We prove that the eigenspace of a fixed energy is spanned by eigenfunctions with compact support. The size of a jump…
We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Phi associated with a given quantum map are investigated and a…
The paper considers the spectral determinant of quantum graph families with chaotic classical limit and no symmetries. The secular coefficients of the spectral determinant are found to follow distributions with zero mean and variance…
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…
Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
We introduce n-particle quantum graphs with singular two-particle interactions in such a way that eigenfunctions can be given in the form of a Bethe ansatz. We show that this leads to a secular equation characterising eigenvalues of the…
The magnetization of quantum dots is discussed in terms of a relatively simple but exactly solvable model Hamiltonian. The model predicts oscillations in spin polarization as a function of dot radius for a fixed electron density. These…
Quantum networks are of great interest of late which apply quantum mechanics to transfer information securely. One of the key properties which are exploited is entanglement to transfer information from one network node to another.…
In this article, we review the general quantum mechanical setting associated to a non self-adjoint Hamiltonian with real spectrum. Spectral properties of the Hamiltonian of a simple model of the Swanson type are investigated. The…
A method of resummation of infinite series of perturbation theory diagrams is applied for studying the properties of random band matrices. The topological classification of Feynman diagrams, which was actively used in last years for matrix…
Given a fixed initial state, a desired Hamiltonian, and an amount of time, we provide a complete characterization of the set of Hamiltonians which perform the same action as the desired Hamiltonian on the state of interest. An example is…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
To characterize the generic behavior of open quantum systems, we consider random, purely dissipative Liouvillians with a notion of locality. We find that the positivity of the map implies a sharp separation of the relaxation timescales…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes…