The Special Thematic Session on"Challenges of the Geoscience Organizations and the Impact on Their Current Status and Organizational Structure"was held on 26 October,2001,in Phnom Penh,Cambodia in conjunctio...The Special Thematic Session on"Challenges of the Geoscience Organizations and the Impact on Their Current Status and Organizational Structure"was held on 26 October,2001,in Phnom Penh,Cambodia in conjunction with the 38th CCOP Annual Session.Delegates from CCOP Member Countries,Cooperating Countries/Organizations participated in the Session.The Session was chaired by the CCOP honorary Advisors Cr.Yoshihiko Shimazaki and Prof.HE Qi-xiang.Mr.JIANG Shi-jin from China was elected the rapporteur.The Delegates of Cambodia,China,Indonesia,Japan,Malaysia,Thailand,Vietnam,the Philippines and the representatives from Germany,Sweden,Texas A & M University and the Netherlands made presentations at the Session.Although the situation of geoscientific work varies from country to country,challenges are common for the geoscience organizations in the region.In order to meet the needs in the development of country’s economy,reorganization or re-structuring of geoscience organizations has been made or is undertaking in CCOP Member Countries.展开更多
The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a prog...The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.展开更多
文摘The Special Thematic Session on"Challenges of the Geoscience Organizations and the Impact on Their Current Status and Organizational Structure"was held on 26 October,2001,in Phnom Penh,Cambodia in conjunction with the 38th CCOP Annual Session.Delegates from CCOP Member Countries,Cooperating Countries/Organizations participated in the Session.The Session was chaired by the CCOP honorary Advisors Cr.Yoshihiko Shimazaki and Prof.HE Qi-xiang.Mr.JIANG Shi-jin from China was elected the rapporteur.The Delegates of Cambodia,China,Indonesia,Japan,Malaysia,Thailand,Vietnam,the Philippines and the representatives from Germany,Sweden,Texas A & M University and the Netherlands made presentations at the Session.Although the situation of geoscientific work varies from country to country,challenges are common for the geoscience organizations in the region.In order to meet the needs in the development of country’s economy,reorganization or re-structuring of geoscience organizations has been made or is undertaking in CCOP Member Countries.
基金supported by the National Natural Science Foundation of China(Grant Nos.62371069,62372048,and 62272056)BUPT Excellent Ph.D.Students Foundation(Grant No.CX2023123)。
文摘The quantum alternating operator ansatz algorithm(QAOA+)is widely used for constrained combinatorial optimization problems(CCOPs)due to its ability to construct feasible solution spaces.In this paper,we propose a progressive quantum algorithm(PQA)to reduce qubit requirements for QAOA+in solving the maximum independent set(MIS)problem.PQA iteratively constructs a subgraph likely to include the MIS solution of the original graph and solves the problem on it to approximate the global solution.Specifically,PQA starts with a small-scale subgraph and progressively expands its graph size utilizing heuristic expansion strategies.After each expansion,PQA solves the MIS problem on the newly generated subgraph using QAOA+.In each run,PQA repeats the expansion and solving process until a predefined stopping condition is reached.Simulation results show that PQA achieves an approximation ratio of 0.95 using only 5.57%(2.17%)of the qubits and 17.59%(6.43%)of the runtime compared with directly solving the original problem with QAOA+on Erd?s-Rényi(3-regular)graphs,highlighting the efficiency and scalability of PQA.
