Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.
Public transport systems play a crucial role in the development of large cities. Bus network design to optimize passenger flow coverage in a global metropolis is a challenging task. As an essential part of bus travel planning, considering the bus transfer factor in the existing extremely complex and extensive public bus network usually leads to a optimization problem characterized by high-dimensionality and non-linearity. While classical computers struggle to deal with this kind of problems, quantum computers shed new light into this field. The coherent Ising machine (CIM), a specialized optical quantum computer using a photonic dissipative architecture, has shown its remarkable computational power in combinatorial optimization problems. We construct the classical model and the quadratic unconstrained binary optimization (QUBO) model of the bus route optimization problem, and solve it using a classical computer and CIM, respectively. Our experimental results demonstrate the significant acceleration capability of CIM over classical computers in finding the optimal or near-optimal solutions, albeit subject to the hardware limitations of the 100-qubit CIM.
Fraud detection within transaction data is crucial for maintaining financial security, especially in the era of big data. This paper introduces a novel fraud detection method that utilizes quantum computing to implement community detection in transaction networks. We model transaction data as an undirected graph, where nodes represent accounts and edges indicate transactions between them. A modularity function is defined to measure the community structure of the graph. By optimizing this function through the Quadratic Unconstrained Binary Optimization (QUBO) model, we identify the optimal community structure, which is then used to assess the fraud risk within each community. Using a Coherent Ising Machine (CIM) to solve the QUBO model, we successfully divide 308 nodes into four communities. We find that the CIM computes faster than the classical Louvain and simulated annealing (SA) algorithms. Moreover, the CIM achieves better community structure than Louvain and SA as quantified by the modularity function. The structure also unambiguously identifies a high-risk community, which contains almost 70% of all the fraudulent accounts, demonstrating the practical utility of the method for banks’ anti-fraud business.
Measurement-device-independent quantum key distribution (MDI QKD) provides inherent immunity against the attacks targeting the practical measurement devices. Existing MDI QKD protocols all rely on the Bell-state measurements (BSM) to establish the correlations between the users. However, the success probability of the linear-optics BSM is limited to 50%, which severely restricts MDI QKD’s achievable key rate. We propose a high capacity MDI-QKD protocol with entanglement-assisted linear-optical BSM. This protocol has three advantages. First, compared to original MDI QKD, at least a 25% increase in the key rate can be achieved. Second, the simulation results show that this protocol can effectively increase MDI-QKD’s maximum photon transmission distance from 262 km to 272 km. Third, this protocol is feasibility in a fully linear optical system under current experimental conditions. Our protocol provides potential value for improving the performance of future quantum communication networks.
Mode-pairing quantum key distribution (MP-QKD) is a promising protocol immune to detector side-channel attacks and capable of breaking the repeaterless PLOB bound without global phase locking. Existing MP-QKD protocols employ weak coherent sources (WCSs) with a low probability of single-photon emission, hindering MP-QKD’s performance improvement. We propose a new, to the best of our knowledge, MP-QKD protocol using the heralded single-photon source (HSPS) to significantly reduce the vacuum emission probability and increase the single-photon emission rate. Compared with the original WCS-MP-QKD protocol, this protocol has three advantages. First, its maximum transmission distance is extended from 488 km to 560 km. Second, the key rates at 100, 200, 300, and 400 km are 4.4 to 7.4 times those of the original protocol. Third, it does not change the original architecture of MP-QKD and is easy to implement experimentally. This HSPS-MP-QKD protocol has application potential in future metropolitan area QKD networks.