期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
A Survey of Analysis on Quantum Algorithms for Communication
1
作者 Huang Yuhong Cui Chunfeng +5 位作者 Pan Chengkang Hou Shuai Sun Zhiwen Lu Xian Li Xinying Yuan Yifei 《China Communications》 2025年第6期1-23,共23页
Quantum computing is a promising technology that has the potential to revolutionize many areas of science and technology,including communication.In this review,we discuss the current state of quantum computing in comm... Quantum computing is a promising technology that has the potential to revolutionize many areas of science and technology,including communication.In this review,we discuss the current state of quantum computing in communication and its potential applications in various areas such as network optimization,signal processing,and machine learning for communication.First,the basic principle of quantum computing,quantum physics systems,and quantum algorithms are analyzed.Then,based on the classification of quantum algorithms,several important basic quantum algorithms,quantum optimization algorithms,and quantum machine learning algorithms are discussed in detail.Finally,the basic ideas and feasibility of introducing quantum algorithms into communications are emphatically analyzed,which provides a reference to address computational bottlenecks in communication networks. 展开更多
关键词 network optimization physical system quantum computing quantum machine learning quantum optimization algorithm signal processing
在线阅读 下载PDF
Problem-structure-informed quantum approximate optimization for large-scale unit commitment with limited qubits
2
作者 Jingxian Zhou Ziqing Zhu +1 位作者 Linghua Zhu Siqi Bu 《iEnergy》 2025年第4期215-218,共4页
As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and soluti... As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex. 展开更多
关键词 Unit commitment problem quadratic unconstrained binary optimization quantum approximate optimization algorithm
在线阅读 下载PDF
Direction of arrival estimation method based on quantum electromagnetic field optimization in the impulse noise 被引量:1
3
作者 DU Yanan GAO Hongyuan CHEN Menghan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第3期527-537,共11页
In order to resolve direction finding problems in the impulse noise,a direction of arrival(DOA)estimation method is proposed.The proposed DOA estimation method can restrain the impulse noise by using infinite norm exp... In order to resolve direction finding problems in the impulse noise,a direction of arrival(DOA)estimation method is proposed.The proposed DOA estimation method can restrain the impulse noise by using infinite norm exponential kernel covariance matrix and obtain excellent performance via the maximumlikelihood(ML)algorithm.In order to obtain the global optimal solutions of this method,a quantum electromagnetic field optimization(QEFO)algorithm is designed.In view of the QEFO algorithm,the proposed method can resolve the difficulties of DOA estimation in the impulse noise.Comparing with some traditional DOA estimation methods,the proposed DOA estimation method shows high superiority and robustness for determining the DOA of independent and coherent sources,which has been verified via the Monte-Carlo experiments of different schemes,especially in the case of snapshot deficiency,low generalized signal to noise ratio(GSNR)and strong impulse noise.Beyond that,the Cramer-Rao bound(CRB)of angle estimation in the impulse noise and the proof of the convergence of the QEFO algorithm are provided in this paper. 展开更多
关键词 direction of arrival(DOA)estimation impulse noise infinite norm exponential kernel covariance matrix maximum-likelihood(ML)algorithm quantum electromagnetic field optimization(QEFO)algorithm Cramer-Rao bound(CRB)
在线阅读 下载PDF
Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
4
作者 Yulin Chi Hongyi Shi +8 位作者 Wen Zheng Haoyang Cai Yu Zhang Xinsheng Tan Shaoxiong Li Jianwei Wang Jiangyu Cui Man-Hong Yung Yang Yu 《Science China(Physics,Mechanics & Astronomy)》 2026年第1期162-174,共13页
In the noisy intermediate-scale quantum era,emerging classical-quantum hybrid optimization algorithms,such as variational quantum algorithms(VQAs),can leverage the unique characteristics of quantum devices to accelera... In the noisy intermediate-scale quantum era,emerging classical-quantum hybrid optimization algorithms,such as variational quantum algorithms(VQAs),can leverage the unique characteristics of quantum devices to accelerate computations tailored to specific problems with shallow circuits.However,these algorithms encounter biases and iteration difficulties due to significant noise in quantum processors.These difficulties can only be partially addressed without error correction by optimizing hardware,reducing circuit complexity,or fitting and extrapolating.A compelling solution is applying probabilistic error cancellation(PEC),a quantum error mitigation technique that enables unbiased results without full error correction.Traditional PEC is challenging to apply in VQAs due to its variance amplification,contradicting iterative process assumptions.This paper proposes a novel noise-adaptable strategy that combines PEC with the quantum approximate optimization algorithm(QAOA).It is implemented through invariant sampling circuits(invariant-PEC,or IPEC)and substantially reduces iteration variance.This strategy marks the first successful integration of PEC and QAOA,resulting in efficient convergence.Moreover,we introduce adaptive partial PEC(APPEC),which modulates the error cancellation proportion of IPEC during iteration.We experimentally validate this technique on a superconducting quantum processor,cutting sampling cost by 90.1%.Notably,we find that dynamic adjustments of error levels via APPEC can enhance the ability to escape from local minima and reduce sampling costs.These results open promising avenues for executing VQAs with large-scale,low-noise quantum circuits,paving the way for practical quantum computing advancements. 展开更多
关键词 variational quantum algorithms probabilistic error cancellation quantum approximate optimization algorithm
原文传递
The Quantum Approximate Algorithm for Solving Traveling Salesman Problem 被引量:5
5
作者 Yue Ruan Samuel Marsh +2 位作者 Xilin Xue Zhihao Liu Jingbo Wang 《Computers, Materials & Continua》 SCIE EI 2020年第6期1237-1247,共11页
The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by tw... The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by two operators labelled the mixing and problem Hamiltonians.To fit this framework,one needs to transform the original problem into a suitable form and embed it into these two Hamiltonians.In this paper,for the well-known NP-hard Traveling Salesman Problem(TSP),we encode its constraints into the mixing Hamiltonian rather than the conventional approach of adding penalty terms to the problem Hamiltonian.Moreover,we map edges(routes)connecting each pair of cities to qubits,which decreases the search space significantly in comparison to other approaches.As a result,our method can achieve a higher probability for the shortest round-trip route with only half the number of qubits consumed compared to IBM Q’s approach.We argue the formalization approach presented in this paper would lead to a generalized framework for finding,in the context of QAOA,high-quality approximate solutions to NP optimization problems. 展开更多
关键词 quantum approximate optimization algorithm traveling salesman problem NP optimization problems
在线阅读 下载PDF
Fuzzy energy management strategy for parallel HEV based on pigeon-inspired optimization algorithm 被引量:15
6
作者 PEI JiaZheng SU YiXin ZHANG DanHong 《Science China(Technological Sciences)》 SCIE EI CAS CSCD 2017年第3期425-433,共9页
Improvements in fuel consumption and emissions of hybrid electric vehicle(HEV)heavily depend upon an efficient energy management strategy(EMS).This paper presents an optimizing fuzzy control strategy of parallel hybri... Improvements in fuel consumption and emissions of hybrid electric vehicle(HEV)heavily depend upon an efficient energy management strategy(EMS).This paper presents an optimizing fuzzy control strategy of parallel hybrid electric vehicle em- 展开更多
关键词 parallel hybrid electric vehicles(parallel HEV) energy management strategy(EMS) fuzzy controller pigeon-inspired optimization(PIO) algorithm quantum evolution chaotic search
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部