RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomi...RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomial for a quantum computer, although technical difficulties mean that practical quantum computers that can tackle integer factorizations of meaningful size are still a long way away. Recently, Jiang et al. proposed a transformation that maps the integer factorization problem onto the quadratic unconstrained binary optimization(QUBO) model. They tested their algorithm on a D-Wave 2000 Q quantum annealing machine, raising the record for a quantum factorized integer to 376289 with only 94 qubits. In this study, we optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits. Tests of our improved algorithm using D-Wave's hybrid quantum/classical simulator qbsolv confirmed that performance was improved, and we were able to factorize 1005973, a new record for quantum factorized integers, with only 89 qubits. In addition, our improved algorithm can tolerate more errors than the original one. Factoring 1005973 using Shor's algorithm would require about 41 universal qubits,which current universal quantum computers cannot reach with acceptable accuracy. In theory, the latest IBM Q System OneTM(Jan. 2019) can only factor up to 10-bit integers, while the D-Wave have a thousand-fold advantage on the factoring scale. This shows that quantum annealing machines, such as those by D-Wave, may be close to cracking practical RSA codes, while universal quantum-circuit-based computers may be many years away from attacking RSA.展开更多
This work is the first to determine that a real quantum computer(including generalized and specialized)can decipher million-scale RSA relying solely on quantum algorithms,showing the real attack potential of D-Wave ma...This work is the first to determine that a real quantum computer(including generalized and specialized)can decipher million-scale RSA relying solely on quantum algorithms,showing the real attack potential of D-Wave machines.The influence of different column widths on RSA factorization results is studied on the basis of a multiplication table,and the optimal column method is determined by traversal experiments.The traversal experiment of integer factorization within 10000 shows that the local field and coupling coefficients are 75%–93%lower than the research of Shanghai University in 2020 and more than 85%lower than that of Purdue University in 2018.Extremely low Ising model parameters are crucial to reducing the hardware requirements,prompting factoring 1245407 on the D-Wave 2000Q real machine.D-Wave advantage already has more than 5000 qubits and will be expanded to 7000 qubits during 2023–2024,with remarkable improvements in decoherence and topology.This machine is expected to promote the solution of large-scale combinatorial optimization problems.One of the contributions of this paper is the discussion of the long-term impact of D-Wave on the development of post-quantum cryptography standards.展开更多
This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.S...This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.展开更多
将优化问题抽象成目标函数后,目标函数和启发式优化算法的匹配程度决定了优化求解的效率.为反映目标函数的优化特征并指导优化算法及其参数的选择,本文模拟绝热量子计算中的多基态演化,提出了一种适应度地形探索算法.根据基态波函数倾...将优化问题抽象成目标函数后,目标函数和启发式优化算法的匹配程度决定了优化求解的效率.为反映目标函数的优化特征并指导优化算法及其参数的选择,本文模拟绝热量子计算中的多基态演化,提出了一种适应度地形探索算法.根据基态波函数倾向于向势能较小处收敛且收敛程度受量子效应强度影响的特性,用目标函数编码势能场后算法引入了一个量子效应递减的多基态演化过程,用其持续收敛的基态波函数簇反映目标函数的适应度地形.根据量子路径积分,算法由尺度递减的扩散蒙特卡罗(diffusion Monte Carlo,DMC)实现.实验表明算法综合直观地反映了适应度地形的众多特征,所得信息能直接指导后续优化,其计算模式和启发式优化相似,无需引入其他计算,这为适应度地形研究引入了新的视角.展开更多
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.展开更多
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.展开更多
Quantum computing has already become a technology to be used by large companies in finance, distribution, health care, chemistry, etc. Among the different approaches, quantum annealing is one of the most promising in ...Quantum computing has already become a technology to be used by large companies in finance, distribution, health care, chemistry, etc. Among the different approaches, quantum annealing is one of the most promising in the short term. However, software development platforms do not offer user-friendly interfaces for the definition of annealing problems. In this paper we present a solution to this problem: QPath<sup><span style="white-space:nowrap;">®</span></sup>’s Annealer Compositor that facilitates the definition and execution of annealing algorithms in either quantum annealing or digital annealing computers. An example based on a nurse work schedule is used for illustrating this special interface.展开更多
In the conventional stochastic inversion method,the spatial structure information of underground strata is usually characterized by variograms.However,effectively characterizing the heterogeneity of complex strata is ...In the conventional stochastic inversion method,the spatial structure information of underground strata is usually characterized by variograms.However,effectively characterizing the heterogeneity of complex strata is difficult.In this paper,multiple parameters are used to fully explore the underground formation information in the known seismic reflection and well log data.The spatial structure characteristics of complex underground reservoirs are described more comprehensively using multiple statistical characteristic parameters.We propose a prestack seismic stochastic inversion method based on prior information on statistical characteristic parameters.According to the random medium theory,this method obtains several statistical characteristic parameters from known seismic and logging data,constructs a prior information model that meets the spatial structure characteristics of the underground strata,and integrates multiparameter constraints into the likelihood function to construct the objective function.The very fast quantum annealing algorithm is used to optimize and update the objective function to obtain the fi nal inversion result.The model test shows that compared with the traditional prior information model construction method,the prior information model based on multiple parameters in this paper contains more detailed stratigraphic information,which can better describe complex underground reservoirs.A real data analysis shows that the stochastic inversion method proposed in this paper can effectively predict the geophysical characteristics of complex underground reservoirs and has a high resolution.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.61332019,61572304,61572034,and 61272096)the Grant of the Special Zone Project of National Defense Innovation
文摘RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard(and hence intractable) problem for a classical computer. However, Shor's algorithm shows that its complexity is polynomial for a quantum computer, although technical difficulties mean that practical quantum computers that can tackle integer factorizations of meaningful size are still a long way away. Recently, Jiang et al. proposed a transformation that maps the integer factorization problem onto the quadratic unconstrained binary optimization(QUBO) model. They tested their algorithm on a D-Wave 2000 Q quantum annealing machine, raising the record for a quantum factorized integer to 376289 with only 94 qubits. In this study, we optimize the problem Hamiltonian to reduce the number of qubits involved in the final Hamiltonian while maintaining the QUBO coefficients in a reasonable range, enabling the improved algorithm to factorize larger integers with fewer qubits. Tests of our improved algorithm using D-Wave's hybrid quantum/classical simulator qbsolv confirmed that performance was improved, and we were able to factorize 1005973, a new record for quantum factorized integers, with only 89 qubits. In addition, our improved algorithm can tolerate more errors than the original one. Factoring 1005973 using Shor's algorithm would require about 41 universal qubits,which current universal quantum computers cannot reach with acceptable accuracy. In theory, the latest IBM Q System OneTM(Jan. 2019) can only factor up to 10-bit integers, while the D-Wave have a thousand-fold advantage on the factoring scale. This shows that quantum annealing machines, such as those by D-Wave, may be close to cracking practical RSA codes, while universal quantum-circuit-based computers may be many years away from attacking RSA.
基金supported by the Special Zone Project of National Defense Innovation.
文摘This work is the first to determine that a real quantum computer(including generalized and specialized)can decipher million-scale RSA relying solely on quantum algorithms,showing the real attack potential of D-Wave machines.The influence of different column widths on RSA factorization results is studied on the basis of a multiplication table,and the optimal column method is determined by traversal experiments.The traversal experiment of integer factorization within 10000 shows that the local field and coupling coefficients are 75%–93%lower than the research of Shanghai University in 2020 and more than 85%lower than that of Purdue University in 2018.Extremely low Ising model parameters are crucial to reducing the hardware requirements,prompting factoring 1245407 on the D-Wave 2000Q real machine.D-Wave advantage already has more than 5000 qubits and will be expanded to 7000 qubits during 2023–2024,with remarkable improvements in decoherence and topology.This machine is expected to promote the solution of large-scale combinatorial optimization problems.One of the contributions of this paper is the discussion of the long-term impact of D-Wave on the development of post-quantum cryptography standards.
基金Project supported by the National Natural Science Foundation of China (Grant No.62176140)。
文摘This paper introduces the quantum control of Lyapunov functions based on the state distance, the mean of imaginary quantities and state errors.In this paper, the specific control laws under the three forms are given.Stability is analyzed by the La Salle invariance principle and the numerical simulation is carried out in a 2D test system.The calculation process for the Lyapunov function is based on a combination of the average of virtual mechanical quantities, the particle swarm algorithm and a simulated annealing algorithm.Finally, a unified form of the control laws under the three forms is given.
文摘将优化问题抽象成目标函数后,目标函数和启发式优化算法的匹配程度决定了优化求解的效率.为反映目标函数的优化特征并指导优化算法及其参数的选择,本文模拟绝热量子计算中的多基态演化,提出了一种适应度地形探索算法.根据基态波函数倾向于向势能较小处收敛且收敛程度受量子效应强度影响的特性,用目标函数编码势能场后算法引入了一个量子效应递减的多基态演化过程,用其持续收敛的基态波函数簇反映目标函数的适应度地形.根据量子路径积分,算法由尺度递减的扩散蒙特卡罗(diffusion Monte Carlo,DMC)实现.实验表明算法综合直观地反映了适应度地形的众多特征,所得信息能直接指导后续优化,其计算模式和启发式优化相似,无需引入其他计算,这为适应度地形研究引入了新的视角.
基金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.
基金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.
文摘Quantum computing has already become a technology to be used by large companies in finance, distribution, health care, chemistry, etc. Among the different approaches, quantum annealing is one of the most promising in the short term. However, software development platforms do not offer user-friendly interfaces for the definition of annealing problems. In this paper we present a solution to this problem: QPath<sup><span style="white-space:nowrap;">®</span></sup>’s Annealer Compositor that facilitates the definition and execution of annealing algorithms in either quantum annealing or digital annealing computers. An example based on a nurse work schedule is used for illustrating this special interface.
基金the National Science Foundation of China(No.42074136 and U19B2008)the Major National Science and Technology Projects(No.2016ZX05027004-001 and 2016ZX05002-005-009)+1 种基金the Fundamental Research Funds for the Central Universities(No.19CX02007A)China Postdoctoral Science Foundation(No.2020M672170).
文摘In the conventional stochastic inversion method,the spatial structure information of underground strata is usually characterized by variograms.However,effectively characterizing the heterogeneity of complex strata is difficult.In this paper,multiple parameters are used to fully explore the underground formation information in the known seismic reflection and well log data.The spatial structure characteristics of complex underground reservoirs are described more comprehensively using multiple statistical characteristic parameters.We propose a prestack seismic stochastic inversion method based on prior information on statistical characteristic parameters.According to the random medium theory,this method obtains several statistical characteristic parameters from known seismic and logging data,constructs a prior information model that meets the spatial structure characteristics of the underground strata,and integrates multiparameter constraints into the likelihood function to construct the objective function.The very fast quantum annealing algorithm is used to optimize and update the objective function to obtain the fi nal inversion result.The model test shows that compared with the traditional prior information model construction method,the prior information model based on multiple parameters in this paper contains more detailed stratigraphic information,which can better describe complex underground reservoirs.A real data analysis shows that the stochastic inversion method proposed in this paper can effectively predict the geophysical characteristics of complex underground reservoirs and has a high resolution.
