相关论文: Quantum site percolation on amenable graphs
This is a slightly enlarged and corrected version of a contribution to the Oberwolfach Reports 3(1):511-552, 2006. We summarise some results on spectral properties of Laplacians on percolation graphs and more general Anderson-percolation…
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer: the transmission of quantum states without dissipation. The essential goal is to…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
We present a detailed study of the quantum site percolation problem on simple cubic lattices, thereby focussing on the statistics of the local density of states and the spatial structure of the single particle wavefunctions. Using the…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
A framework for statistical-mechanical analysis of quantum Hamiltonians is introduced. The approach is based upon a gradient flow equation in the space of Hamiltonians such that the eigenvectors of the initial Hamiltonian evolve toward…
We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $\sigma$--model…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi periodic boundary conditions are derived. The secular equation allowing us to find the energy spectrum of the Dirac particles on periodic quantum…
We study spectral properties of a non-Hermitian Hamiltonian describing a quantum particle propagating in a random imaginary scalar potential. Cast in the form of an effective field theory, we obtain an analytical expression for the ensemble…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Quantum graphs were introduced to model free electrons in organic molecules using a self-adjoint Hamiltonian on a network of intervals. A second graph quantization describes wave propagation on a graph by specifying scattering matrices at…
Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics and high energy physics. While our…