Search

The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of quantum parallel in computation and simulation. Particularly, the uniform superposition provides the robust non-locality, which has wide applications such as the generation of genuine multi-bit random numbers without post-processing. We experimentally demonstrate that the rich dynamics featured with arbitrary coherent distributions can be obtained by introducing different sets of the time- and position-dependent operations. Such a QW is realized by a resource-constant and flexible optical circuit, in which the variable operation is executed based on a Sagnac interferometer in an intrinsically stable and precisely controlled way. Our results contribute to the practical realization of quantum-walk-based quantum computation, quantum simulations and quantum information protocols., Comment: 8 pages, 4 figures, 2 tables

We report the position-inhomogeneous quantum walk (IQW) can be utilized to produce the maximal high dimensional entanglement while maintaining the quadratic speedup spread of the wave-function. Our calculations show that the maximal coin-walker entanglement can be generated in any odd steps or asymptotically in even steps, and the nearly maximal entanglement can be obtained in even steps after $2$. We implement the IQW by a stable resource-saving time-bin optical network, in which a polarization Sagnac loop is employed to realize the precisely tunable phase shift. Our approach opens up an efficient way for high-dimensional entanglement engineering as well as promotes investigations on the role of coin-walker interactions in QW based applications., Comment: 7 pages, 6 figures, 1 table

How to accurately solve time-dependent Schr\"odinger equation is an interesting and important problem. Here, we propose a novel method to obtain the exact Floquet solutions of the Schr\"odinger equation for periodically driven systems by using Floquet theorem and a time-dependent unitary transformation. Using the method, we give out the exact Floquet solutions of wave function for three interesting physical models -- linear potential model, harmonic oscillator model, and the coupled harmonic oscillator model in the presence of a periodic driving. In addition to the quasienergy, we also give out the analytic expression of Berry phase for the harmonic oscillator model. Moreover, the idea presented in this paper can be used in mathematics to solve partial differential equations.

The New Vacuum Solar Telescope (NVST) has been releasing its novel winged Ha data (WHD) since April 2021, namely the Ha imaging spectroscopic data. Compared with the prior released version, the new data are further co-aligned among the off-band images and packaged into a standard solar physics community format. In this study, we illustrate the alignment algorithm used by the novel WHD, which is mainly based on the optical flow method to obtain the translation offset between the winged images. To quantitatively evaluate the alignment results of two images with different similarities, we calculate the alignment accuracies between the images of different off-band and line center, respectively. The result shows that our alignment algorithm could reach up to the accuracy of about 0.1 "when the off-band of winged image is lower than 0.6 \.A. In addition, we introduce the final product of the WHD in detail, which can provide convenience for the solar physicists to use high-resolution H{\alpha} imaging spectroscopic data of NVST., Comment: 11 pages, 5 figures

Graph visualization is a vital component in many real-world applications (e.g., social network analysis, web mining, and bioinformatics) that enables users to unearth crucial insights from complex data. Lying in the core of graph visualization is the node distance measure, which determines how the nodes are placed on the screen. A favorable node distance measure should be informative in reflecting the full structural information between nodes and effective in optimizing visual aesthetics. However, existing node distance measures yield sub-par visualization quality as they fall short of these requirements. Moreover, most existing measures are computationally inefficient, incurring a long response time when visualizing large graphs. To overcome such deficiencies, we propose a new node distance measure, PDist, geared towards graph visualization by exploiting a well-known node proximity measure, personalized PageRank. Moreover, we propose an efficient algorithm Tau-Push for estimating PDist under both single- and multi-level visualization settings. With several carefully-designed techniques, Tau-Push offers non-trivial theoretical guarantees for estimation accuracy and computation complexity. Extensive experiments show that our proposal significantly outperforms 13 state-of-the-art graph visualization solutions on 12 real-world graphs in terms of both efficiency and effectiveness (including aesthetic criteria and user feedback). In particular, our proposal can interactively produce satisfactory visualizations within one second for billion-edge graphs., Comment: The technical report of the paper entitled 'Effective and Efficient PageRank-based Positioning for Graph Visualization' in SIGMOD'23

Heterogeneous Information Networks (HINs) are labeled graphs that depict relationships among different types of entities (e.g., users, movies and directors). For HINs, meta-path-based recommenders (MPRs) utilize meta-paths (i.e., abstract paths consisting of node and link types) to predict user preference, and have attracted a lot of attention due to their explainability and performance. We observe that the performance of MPRs is highly sensitive to the meta-paths they use, but existing works manually select the meta-paths from many possible ones. Thus, to discover effective meta-paths automatically, we propose the Reinforcement learning-based Meta-path Selection (RMS) framework. Specifically, we define a vector encoding for meta-paths and design a policy network to extend meta-paths. The policy network is trained based on the results of downstream recommendation tasks and an early stopping approximation strategy is proposed to speed up training. RMS is a general model, and it can work with all existing MPRs. We also propose a new MPR called RMS-HRec, which uses an attention mechanism to aggregate information from the meta-paths. We conduct extensive experiments on real datasets. Compared with the manually selected meta-paths, the meta-paths identified by RMS consistently improve recommendation quality. Moreover, RMS-HRec outperforms state-of-the-art recommender systems by an average of 7% in hit ratio. The codes and datasets are available on https://github.com/Stevenn9981/RMS-HRec., Comment: This paper is accepted as a full research paper by CIKM 2022

Traffic flow forecasting is essential and challenging to intelligent city management and public safety. Recent studies have shown the potential of convolution-free Transformer approach to extract the dynamic dependencies among complex influencing factors. However, two issues prevent the approach from being effectively applied in traffic flow forecasting. First, it ignores the spatiotemporal structure of the traffic flow videos. Second, for a long sequence, it is hard to focus on crucial attention due to the quadratic times dot-product computation. To address the two issues, we first factorize the dependencies and then design a progressive space-time self-attention mechanism named ProSTformer. It has two distinctive characteristics: (1) corresponding to the factorization, the self-attention mechanism progressively focuses on spatial dependence from local to global regions, on temporal dependence from inside to outside fragment (i.e., closeness, period, and trend), and finally on external dependence such as weather, temperature, and day-of-week; (2) by incorporating the spatiotemporal structure into the self-attention mechanism, each block in ProSTformer highlights the unique dependence by aggregating the regions with spatiotemporal positions to significantly decrease the computation. We evaluate ProSTformer on two traffic datasets, and each dataset includes three separate datasets with big, medium, and small scales. Despite the radically different design compared to the convolutional architectures for traffic flow forecasting, ProSTformer performs better or the same on the big scale datasets than six state-of-the-art baseline methods by RMSE. When pre-trained on the big scale datasets and transferred to the medium and small scale datasets, ProSTformer achieves a significant enhancement and behaves best.

High-order topological insulator (HOTI) occupies an important position in topological band theory due to its exotic bulk-edge correspondence. Recently, it has been predicted that external magnetic field can introduce rich physics into two-dimensional (2D) HOTIs. However, up to now the theoretical description is still incomplete and the experimental realization is still lacking. Here we investigate the influence of continuously varying magnetic field on 2D Su-Schriffer-Heeger lattice, which is one of the most celebrated HOTI models, and proposed a corresponding circuit quantum electrodynamics (cQED) simulator. Our numerical calculation shows that the zero energy corner modes (ZECMs), which can serve as evidence of the high order topology of the lattice, exhibit exotic and rich dependence on the imposed magnetic field and the inhomogeneous hopping strength. Moreover, by exploiting the parametric conversion method, we can establish time- and site-resolved tunable hopping constants in the proposed cQED simulator, thus providing an ideal platform for simulating the magnetic field induced topological phase transitions in 2D HOTIs. Since the high-order topological phases of the proposed model can be characterized by the existence of the ZECMs on the lattice, we further investigate the corner site excitation of the lattice in the steady state limit. Our numerical results imply that the predicted topological phase transitions can be unambiguously identified by the steady-state photon number measurement of the corner sites and their few neighbors. Requiring only current level of technology, our scheme can be readily tested in experiment and may pave an alternative way towards the future investigation of HOTIs in the presence of magnetic field, disorder, and strong correlation.

Most deep network methods for compressive sensing reconstruction suffer from the black-box characteristic of DNN. In this paper, a deep neural network with interpretable motion estimation named CSMCNet is proposed. The network is able to realize high-quality reconstruction of video compressive sensing by unfolding the iterative steps of optimization based algorithms. A DNN based, multi-hypothesis motion estimation module is designed to improve the reconstruction quality, and a residual module is employed to further narrow down the gap between re-construction results and original signal in our proposed method. Besides, we propose an interpolation module with corresponding training strategy to realize scalable CS reconstruction, which is capable of using the same model to decode various compression ratios. Experiments show that a PSNR of 29.34dB can be achieved at 2% CS ratio (compressed by 98%), which is superior than other state-of-the-art methods. Moreover, the interpolation module is proved to be effective, with significant cost saving and acceptable performance losses., Comment: 12 pages, 10 pages, 5 tables

The intercity freight trips of heavy trucks are important data for transportation system planning and urban agglomeration management. In recent decades, the extraction of freight trips from GPS data has gradually become the main alternative to traditional surveys. Identifying the trip ends (origin and destination, OD) is the first task in trip extraction. In previous trip end identification methods, some key parameters, such as speed and time thresholds, have mostly been defined on the basis of empirical knowledge, which inevitably lacks universality. Here, we propose a data-driven trip end identification method. First, we define a speed threshold by analyzing the speed distribution of heavy trucks and identify all truck stops from raw GPS data. Second, we define minimum and maximum time thresholds by analyzing the distribution of the dwell times of heavy trucks at stop location and classify truck stops into three types based on these time thresholds. Third, we use highway network GIS data and freight-related points-of-interest (POIs) data to identify valid trip ends from among the three types of truck stops. In this step, we detect POI boundaries to determine whether a heavy truck is stopping at a freight-related location. We further analyze the spatiotemporal characteristics of intercity freight trips of heavy trucks and discuss their potential applications in practice.

Intracity heavy truck freight trips are basic data in city freight system planning and management. In the big data era, massive heavy truck GPS trajectories can be acquired cost effectively in real-time. Identifying freight trip ends (origins and destinations) from heavy truck GPS trajectories is an outstanding problem. Although previous studies proposed a variety of trip end identification methods from different perspectives, these studies subjectively defined key threshold parameters and ignored the complex intracity heavy truck travel characteristics. Here, we propose a data-driven trip end identification method in which the speed threshold for identifying truck stops and the multilevel time thresholds for distinguishing temporary stops and freight trip ends are objectively defined. Moreover, an appropriate time threshold level is dynamically selected by considering the intracity activity patterns of heavy trucks. Furthermore, we use urban road networks and point-of-interest (POI) data to eliminate misidentified trip ends to improve method accuracy. The validation results show that the accuracy of the method we propose is 87.45%. Our method incorporates the impact of the city freight context on truck trajectory characteristics, and its results can reflect the spatial distribution and chain patterns of intracity heavy truck freight trips, which have a wide range of practical applications.