The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quan...The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.展开更多
Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Define...Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Defined Network (SDN) to dynamically predict the traffic and comprehensively consider the current and predicted load of the network in order to select the optimal forwarding path and balance the network load. Experiments have demonstrated that the algorithm achieves significant improvement in both system throughput and average packet loss rate for the purpose of improving network quality of service.展开更多
In recent years,the urbanization process has brought modernity while also causing key issues,such as traffic congestion and parking conflicts.Therefore,cities need a more intelligent"brain"to form more intel...In recent years,the urbanization process has brought modernity while also causing key issues,such as traffic congestion and parking conflicts.Therefore,cities need a more intelligent"brain"to form more intelligent and efficient transportation systems.At present,as a type of machine learning,the traditional clustering algorithm still has limitations.K-means algorithm is widely used to solve traffic clustering problems,but it has limitations,such as sensitivity to initial points and poor robustness.Therefore,based on the hybrid architecture of Quantum Annealing(QA)and brain-inspired cognitive computing,this study proposes QA and Brain-Inspired Clustering Algorithm(QABICA)to solve the problem of urban taxi-stand locations.Based on the traffic trajectory data of Xi’an and Chengdu provided by Didi Chuxing,the clustering results of our algorithm and K-means algorithm are compared.We find that the average taxi-stand location bias of the final result based on QABICA is smaller than that based on K-means,and the bias of our algorithm can effectively reduce the tradition K-means bias by approximately 42%,up to approximately 83%,with higher robustness.QA algorithm is able to jump out of the local suboptimal solutions and approach the global optimum,and brain-inspired cognitive computing provides search feedback and direction.Thus,we will further consider applying our algorithm to analyze urban traffic flow,and solve traffic congestion and other key problems in intelligent transportation.展开更多
In order to solve the problems of road traffic congestion and the increasing parking time caused by the imbalance of parking lot supply and demand,this paper proposes an asymptotically optimal public parking lot locat...In order to solve the problems of road traffic congestion and the increasing parking time caused by the imbalance of parking lot supply and demand,this paper proposes an asymptotically optimal public parking lot location algorithm based on intuitive reasoning to optimize the parking lot location problem.Guided by the idea of intuitive reasoning,we use walking distance as indicator to measure the variability among location data and build a combinatorial optimization model aimed at guiding search decisions in the solution space of complex problems to find optimal solutions.First,Selective Attention Mechanism(SAM)is introduced to reduce the search space by adaptively focusing on the important information in the features.Then,Quantum Annealing(QA)algorithm with quantum tunneling effect is used to jump out of the local extremum in the search space with high probability and further approach the global optimal solution.Experiments on the parking lot location dataset in Luohu District,Shenzhen,show that the proposed method has improved the accuracy and running speed of the solution,and the asymptotic optimality of the algorithm and its effectiveness in solving the public parking lot location problem are verified.展开更多
基金the National Natural Science Foundation of China(NSFC)(Grant No.61972050)the Open Foundation of StateKey Laboratory ofNetworking and Switching Technology(Beijing University of Posts and Telecommunications)(SKLNST-2020-2-16).
文摘The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given.
文摘Traditional traffic management techniques appear to be incompetent in complex data center networks, so proposes a load balancing strategy based on Long Short-Term Memory (LSTM) and quantum annealing by Software Defined Network (SDN) to dynamically predict the traffic and comprehensively consider the current and predicted load of the network in order to select the optimal forwarding path and balance the network load. Experiments have demonstrated that the algorithm achieves significant improvement in both system throughput and average packet loss rate for the purpose of improving network quality of service.
基金the Special Zone Project of National Defense Innovation,the National Natural Science Foundation of China(Nos.61572304 and 61272096)the Key Program of the National Natural Science Foundation of China(No.61332019)Open Research Fund of State Key Laboratory of Cryptology。
文摘In recent years,the urbanization process has brought modernity while also causing key issues,such as traffic congestion and parking conflicts.Therefore,cities need a more intelligent"brain"to form more intelligent and efficient transportation systems.At present,as a type of machine learning,the traditional clustering algorithm still has limitations.K-means algorithm is widely used to solve traffic clustering problems,but it has limitations,such as sensitivity to initial points and poor robustness.Therefore,based on the hybrid architecture of Quantum Annealing(QA)and brain-inspired cognitive computing,this study proposes QA and Brain-Inspired Clustering Algorithm(QABICA)to solve the problem of urban taxi-stand locations.Based on the traffic trajectory data of Xi’an and Chengdu provided by Didi Chuxing,the clustering results of our algorithm and K-means algorithm are compared.We find that the average taxi-stand location bias of the final result based on QABICA is smaller than that based on K-means,and the bias of our algorithm can effectively reduce the tradition K-means bias by approximately 42%,up to approximately 83%,with higher robustness.QA algorithm is able to jump out of the local suboptimal solutions and approach the global optimum,and brain-inspired cognitive computing provides search feedback and direction.Thus,we will further consider applying our algorithm to analyze urban traffic flow,and solve traffic congestion and other key problems in intelligent transportation.
基金supported by the Special Zone Project of National Defense Innovation and the Science and Technology Program of Education Department of Jiangxi Province(No.GJJ171503).
文摘In order to solve the problems of road traffic congestion and the increasing parking time caused by the imbalance of parking lot supply and demand,this paper proposes an asymptotically optimal public parking lot location algorithm based on intuitive reasoning to optimize the parking lot location problem.Guided by the idea of intuitive reasoning,we use walking distance as indicator to measure the variability among location data and build a combinatorial optimization model aimed at guiding search decisions in the solution space of complex problems to find optimal solutions.First,Selective Attention Mechanism(SAM)is introduced to reduce the search space by adaptively focusing on the important information in the features.Then,Quantum Annealing(QA)algorithm with quantum tunneling effect is used to jump out of the local extremum in the search space with high probability and further approach the global optimal solution.Experiments on the parking lot location dataset in Luohu District,Shenzhen,show that the proposed method has improved the accuracy and running speed of the solution,and the asymptotic optimality of the algorithm and its effectiveness in solving the public parking lot location problem are verified.
