Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.
Whether rate‐ and state‐dependent friction evolution is primarily slip dependent or time dependent is not well resolved. Although slide‐hold‐slide experiments are traditionally interpreted as supporting the aging law, implying time‐dependent evolution, recent studies show that this evidence is equivocal. In contrast, the slip law yields extremely good fits to velocity step experiments, although a clear physical picture for slip‐dependent friction evolution is lacking. We propose a new microscopic model for rate and state friction evolution in which each asperity has a heterogeneous strength, with individual portions recording the velocity at which they became part of the contact. Assuming an exponential distribution of asperity sizes on the surface, the model produces results essentially similar to the slip law, yielding very good fits to velocity step experiments but not improving much the fits to slide‐hold‐slide experiments. A numerical kernel for the model is developed, and an analytical expression is obtained for perfect velocity steps, which differs from the slip law expression by a slow‐decaying factor. By changing the quantity that determines the intrinsic strength, we use the same model structure to investigate aging‐law‐like time‐dependent evolution. Assuming strength to increase logarithmically with contact age, for two different definitions of age we obtain results for velocity step increases significantly different from the aging law. Interestingly, a solution very close to the aging law is obtained if we apply a third definition of age that we consider to be nonphysical. This suggests that under the current aging law, the state variable is not synonymous with contact age.
Understanding the development trajectory of digital platforms is central to digital platform management. We develop a parametric model that investigates the development trajectories of blockchain platforms, accounting for the feedback between blockchains’ utility change and people’s adoption and abandonment behavior. We consider a typical blockchain participant to simultaneously play three roles on the platform, user, investor, and laborer, each contributing to blockchains’ multi-faceted utility: providing service for transaction/interaction, providing a medium for digital investment, and providing workspace for online labor. The model describes a three-phase development trajectory for blockchain platforms: a chaotic initial stage, a rapid growth stage, and a mature stage of stable market cycles. The model was used to match 112 token price series, demonstrating robust performance across different fitting setups and outperforming existing models. The study identifies two temporal parameters, the time delay in quitting the platform and the holding time of the platform’s token, that significantly differentiate blockchains’ development trajectories. We extend the model to study forking events; results suggest that fork launch time is more important than forking amplitude in influencing the main chain’s subsequent development and that forking can increase the exposure of the forked platform.
Network dismantling aims at breaking a network into disconnected components and attacking vertices that intersect with many loops has proven to be a most efficient strategy. Yet existing loop-focusing methods do not distinguish the short loops within densely connected local clusters (e.g., cliques) from the long loops connecting different clusters, leading to lowered performance of these algorithms. Here we propose a new solution framework for network dismantling based on a two-scale bipartite factor-graph representation, in which long loops are maintained while local dense clusters are simplistically represented as individual factor nodes. A mean-field spin-glass theory is developed for the corresponding long-loop feedback vertex set problem. The framework allows for the advancement of various existing dismantling algorithms; we developed the new version of two benchmark algorithms BPD (which uses the message-passing equations of the spin-glass theory as the solver) and CoreHD (which is fastest among well-performing algorithms). New solvers outperform current state-of-the-art algorithms by a considerable margin on networks of various sorts. Further improvement in dismantling performance is achievable by opting flexibly the choice of local clusters.
Quantitative analysis of professional basketball become an attractive field for experienced data analysts, and the recent availability of high-resolution datasets pushes data-driven basketball analytics to a higher degree. We present a qualitative discussion on quantitative professional basketball. We propose and discuss the dimensions, the levels of granularity, and the types of tasks in quantitative basketball. We review key literature in the past two decades and map them into the proposed qualitative framework, with an evolutionary perspective and an emphasis on recent advances. A list of questions around professional basketball that could be approached with quantitative tools is displayed, pointing to directions for future research. We touch on the new landscapes of virtual basketball at enriching the space for quantitative analysis. This report serves as a qualitative primer for quantitative analysis of professional basketball, exhibiting the growing prospect of the promising research area.