相关论文: Universal scaling hypothesis of quantum spatial se…
We investigate the dynamic scaling properties of stochastic particle systems on a non-deterministic scale-free network. It has been known that the dynamic scaling behavior depends on the degree distribution exponent of the underlying…
How does the shape of a network change as its size increases? Although random graph models provide some expectations for such "scaling behaviors" in the structure of networks, relatively little is known about how empirical network structure…
We generalize Huberman-Rudnick universal scaling law for all periodic windows of the logistic map and show the robustness of $q$-Gaussian probability distributions in the vicinity of chaos threshold. Our scaling relation is universal for…
The realization of a global quantum network capable of supporting secure communication and other quantum information processing (QIP) tasks hinges on the ability to distribute high-fidelity entanglement across long distances while…
We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world and random networks follow…
We study the discrete-time quantum walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and…
We show that the parametric correlations of the conductance peak amplitudes of a chaotic or weakly disordered quantum dot in the Coulomb blockade regime become universal upon an appropriate scaling of the parameter. We compute the universal…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
In this paper we investigate the universality and scaling properties of the well-known quantities in classical statistical mechanics near the quantum phase transition point. We show that transverse susceptibility and derivatives of…
We demonstrate that conventional artificial deep neural networks operating near the phase boundary of the signal propagation dynamics, also known as the edge of chaos, exhibit universal scaling laws of absorbing phase transitions in…
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian…
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
Entangled quantum networks provide great flexibilities and scalabilities for quantum information processing or quantum Internet. Most of results are focused on the nonlocalities of quantum networks. Our goal in this work is to explore new…
We investigate the universality of correlation functions of chaotic and disordered quantum systems as an external parameter is varied. A new, general scaling procedure is introduced which makes the theory invariant under reparametrizations.…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
Long-range entanglement distribution in a quantum network relies on entanglement swapping at intermediate nodes along a network path to connect short-range entangled states established over the network edges. The end-to-end entanglement of…
Recent theoretical studies have predicted the existence of caustics in many-body quantum dynamics, where they manifest as extended regions of enhanced probability density that obey temporal and spatial scaling relations. Focusing on the…