A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation.

In order to implement a quantum circuit on an NISQ device, it must be transformed into a functionally equivalent circuit that satisfies the device's connectivity constraints. However, NISQ devices are inherently noisy, and minimizing the number of SWAP gates added to the circuit is crucial for reducing computation errors. To achieve this, we propose a subgraph isomorphism algorithm based on the timing weight priority of quantum gates, which provides a better initial mapping for a specific two-dimensional quantum architecture. Additionally, we introduce a heuristic swap sequence selection optimization algorithm that uses a distance optimization measurement function to select the ideal sequence and reduce the number of SWAP gates, thereby optimizing the circuit transformation. Our experiments demonstrate that our proposed algorithm is effective for most benchmark quantum circuits, with a maximum optimization rate of up to 43.51% and an average optimization rate of 13.51%, outperforming existing related methods.

General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier.

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a 7×7 lattice of qubits with depth (1+40+1) on the Tianhe-2 supercomputer.

A City Shared Bike Dispatch Approach Based on Temporal Graph Convolutional Network and Genetic Algorithm.

Public transportation scheduling aims to optimize the allocation of resources, enhance efficiency, and increase passenger satisfaction, all of which are crucial for building a sustainable urban transportation system. As a complement to public transportation, bike-sharing systems provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, including peak usage periods in the morning and evening and significant demand fluctuations across different areas, optimizing shared bike dispatch can better meet user needs, reduce vehicle vacancy rates, and increase operating revenue. To address this issue, this article proposes a comprehensive decision-making approach for spatiotemporal demand prediction and bike dispatch optimization. For demand prediction, we design a T-GCN (Temporal Graph Convolutional Network)-based bike demand prediction model. In terms of dispatch optimization, we consider factors such as dispatch capacity, distance restrictions, and dispatch costs, and design an optimization solution based on genetic algorithms. Finally, we validate the approach using shared bike operating data and show that the T-GCN can effectively predict the short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution, verifying the model's effectiveness. The shared bike dispatch approach proposed in this paper combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.