期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到159,738篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Enhanced multiscale quantum approximate optimization algorithm in multibody combinatorial optimization problems 认领 引用
1
作者 Lei-Lei Chen Ping Zou Ya-Fei Yu 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第7期424-434,共11页
At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability def... At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum(NISQ)devices.This study focuses on the multiscale quantum approximate optimization algorithm(MQAOA),which integrates renormalization group(RG)transformations with QAOA to address these limitations.Based on the connections between the variables in the problem to be solved,the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation.This approach not only extends the applicability of MQAOA to satisfiability(SAT)problems—including those with three-body and higher-order interactions in the problem Hamiltonian—but also eliminates the algorithm's sensitivity to problem density.Validations conducted on quantum simulators show that,after running two-round MQAOA,its capability is enhanced to identify optimal solutions with approximately 97%success probability as defined by the ground-state overlap for Max-2-SAT problems(78%success probability for Max-3-SAT problems).The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems,providing a pathway for NISQ-era deployment. 展开更多
关键词 quantum algorithm parameterized quantum circuit renormalization group transformation combinatorial optimization Max-SAT problems
暂未订购 下载PDF
Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem 认领 引用
2
作者 Guanghui Li Xiaohui Ni +5 位作者 Junjian Su Sujuan Qin Fenzhuo Guo Bingjie Xu Wei Huang Fei Gao 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第5期326-344,共19页
Quantum approximate optimization algorithm(QAOA)is a promising framework for solving combinatorial optimization problems on near-term quantum devices.One such problem is the minimum dominating set(MDS),which is known ... Quantum approximate optimization algorithm(QAOA)is a promising framework for solving combinatorial optimization problems on near-term quantum devices.One such problem is the minimum dominating set(MDS),which is known to be NP-hard.Existing QAOA algorithms for this problem typically require numerous auxiliary qubits,increasing circuit overhead and hardware requirements.In this paper,we propose an auxiliary-qubit-free QAOA algorithm based on Hamiltonian evolution(AQFH-QAOA)for the MDS problem.Unlike previous studies that require numerous auxiliary qubits,our algorithm eliminates the need for auxiliary qubits,thereby significantly reducing circuit overhead.In addition,we present an auxiliary-qubit-free optimized implementation of the previously proposed Guerrero's QAOA algorithm(AQFG-QAOA)by utilizing gate decomposition techniques.Through a detailed analysis of gate complexity,we evaluate the applicability of these two algorithms.Numerical experiments demonstrate that our proposed algorithm achieves competitive solution quality compared with existing QAOA algorithms,making it a promising candidate for implementation on near-term quantum devices. 展开更多
关键词 quantum algorithm quantum approximate optimization algorithm minimum dominating set Boolean algebra identities
暂未订购 下载PDF
State-Space Reduction Techniques Exploiting Specific Constraints for Quantum Search Initialization,Application to an Outage Planning Problem 认领 引用
3
作者 Rodolphe Griset Ioannis Lavdas Jiri Guth Jarkovsky 《Journal of Quantum Computing》 2025年第1期81-105,共25页
Quantum search has emerged as one of the most promising fields in quantum computing.Stateof-the-art quantum search algorithms enable the search for specific elements in a distribution by monotonically increasing the d... Quantum search has emerged as one of the most promising fields in quantum computing.Stateof-the-art quantum search algorithms enable the search for specific elements in a distribution by monotonically increasing the density of these elements relative to the rest of the distribution.These kinds of algorithms demonstrate a theoretical quadratic speed-up on the number of queries compared to classical search algorithms in unstructured spaces.Unfortunately,the major part of the existing literature applies quantum search to problems whose size grows exponentially with the input size without exploiting any specific problem structure,rendering this kind of approach not exploitable in real industrial problems.In contrast,this work proposes exploiting specific constraints of an outage planning problem,consisting in setting outage dates of production units under specific fuel management constraints and resource constraints limiting the number of outages in parallel,to build an initial superposition of states with size almost quadratically increasing as a function of the problem size.This state space reduction,inspired by the quantum walk algorithm,constructs a state superposition corresponding to all paths in a state-graph,embedding spacing constraints between outages.Our numerical results on quantum emulators highlight the potential of the statespace reduction approach.In our simplified use case,the number of iterations required to reach a 90% probability of measuring a feasible solution is reduced by a factor between 2 and 4.More importantly,the squared ratio between the number of possible configurations and the number of valid solutions shifts from exponential to linear behavior,demonstrating that the quadratic speedup offered by Grover-based algorithms becomes sufficient in this setting.While these results are based on a simplified scenario and further investigation is needed to generalize them to large-scale industrial problems,they illustrate the promise of structure-aware initialization in significantly improving the efficiency of quantum search by focusing on a smaller,more relevant solution space. 展开更多
关键词 Quantum search amplitude amplification quantum walk scheduling planning problem
暂未订购 下载PDF
Problem-structure-informed quantum approximate optimization for large-scale unit commitment with limited qubits 认领 引用
4
作者 Jingxian Zhou Ziqing Zhu +1 位作者 Linghua Zhu Siqi Bu 《iEnergy》 EI 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
An Improved Chaotic Quantum Multi-Objective Harris Hawks Optimization Algorithm for Emergency Centers Site Selection Decision Problem 认领 引用 被引量：2
5
作者 Yuting Zhu Wenyu Zhang +3 位作者 Hainan Wang Junjie Hou Haining Wang Meng Wang 《Computers, Materials & Continua》 SCIE EI 2025年第2期2177-2198,共22页
Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urge... Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urgency of demand at disaster-affected sites. Firstly, urgency cost, economic cost, and transportation distance cost were identified as key objectives. The study applied fuzzy theory integration to construct a triangular fuzzy multi-objective site selection decision model. Next, the defuzzification theory transformed the fuzzy decision model into a precise one. Subsequently, an improved Chaotic Quantum Multi-Objective Harris Hawks Optimization (CQ-MOHHO) algorithm was proposed to solve the model. The CQ-MOHHO algorithm was shown to rapidly produce high-quality Pareto front solutions and identify optimal site selection schemes for emergency resource distribution centers through case studies. This outcome verified the feasibility and efficacy of the site selection decision model and the CQ-MOHHO algorithm. To further assess CQ-MOHHO’s performance, Zitzler-Deb-Thiele (ZDT) test functions, commonly used in multi-objective optimization, were employed. Comparisons with Multi-Objective Harris Hawks Optimization (MOHHO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Grey Wolf Optimizer (MOGWO) using Generational Distance (GD), Hypervolume (HV), and Inverted Generational Distance (IGD) metrics showed that CQ-MOHHO achieved superior global search ability, faster convergence, and higher solution quality. The CQ-MOHHO algorithm efficiently achieved a balance between multiple objectives, providing decision-makers with satisfactory solutions and a valuable reference for researching and applying emergency site selection problems. 展开更多
关键词 Site selection triangular fuzzy theory chaotic quantum Harris Hawks optimization multi-objective optimization
暂未订购 下载PDF
Quantum-inspired ant algorithm for knapsack problems 认领 引用 被引量：5
6
作者 Wang Honggang Ma Liang +1 位作者 Zhang Huizhen Li Gaoya 《Journal of Systems Engineering and Electronics》 SCIE EI 2009年第5期1012-1016,共5页
The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.Q... The knapsack problem is a well-known combinatorial optimization problem which has been proved to be NP-hard.This paper proposes a new algorithm called quantum-inspired ant algorithm(QAA)to solve the knapsack problem.QAA takes the advantage of the principles in quantum computing,such as qubit,quantum gate,and quantum superposition of states,to get more probabilistic-based status with small colonies.By updating the pheromone in the ant algorithm and rotating the quantum gate,the algorithm can finally reach the optimal solution.The detailed steps to use QAA are presented,and by solving series of test cases of classical knapsack problems,the effectiveness and generality of the new algorithm are validated. 展开更多
关键词 knapsack problem,quantum computing ant algorithm,quantum-inspired ant algorithm.
暂未订购 下载PDF
The Quantum Approximate Algorithm for Solving Traveling Salesman Problem 认领 引用 被引量：5
7
作者 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
A Quantum Protocol for Millionaire Problem with Continuous Variables 认领 引用 被引量：3
8
作者 周艺华 侍伟敏 杨宇光 《Communications in Theoretical Physics》 SCIE CAS CSCD 2014年第4期452-456,共5页
In this paper, a protocol for quantum millionaire problem with continuous variables is proposed. In the protocol, two participants can compare the values of their fortune with the assistance of a semi-trusted third pa... In this paper, a protocol for quantum millionaire problem with continuous variables is proposed. In the protocol, two participants can compare the values of their fortune with the assistance of a semi-trusted third party(STTP). Only EPR states are exploited in our protocol while most other protocols exploited d-dimensional Bell states.Two participants are just required to perform single particle operations, which makes our protocol more efficiently. Our protocol can ensure fairness, correctness, security and high efficiency as well. In our protocol, only the two participants can deduce the results of comparisons, others include STTP will learn no information. Our protocol can resist various kinds of attacks from both the outside eavesdroppers and the inside participants, even the STTP. 展开更多
关键词 secure multiparty quantum computation millionaire problem continuous variables quantumcryptography
暂未订购 下载PDF
Quantum Secure Multiparty Computation:Bridging Privacy,Security,and Scalability in the Post-Quantum Era 认领 引用
9
作者 Sghaier Guizani Tehseen Mazhar Habib Hamam 《Computers, Materials & Continua》 SCIE EI 2026年第4期1-25,共25页
The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreser... The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation. 展开更多
关键词 Quantum computing secure multiparty computation(MPC) post-quantum cryptography(PQC) quantum key distribution(QKD) privacy-preserving computation quantum homomorphic encryption quantum network security federated learning blockchain security quantum cryptography
暂未订购 下载PDF
Quantum algorithm for a set of quantum 2SAT problems 认领 引用
10
作者 Yanglin Hu Zhelun Zhang Biao Wu 《Chinese Physics B》 SCIE EI CAS CSCD 2021年第2期59-63,共5页
We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability(Q2SAT)problem,which is a generalization of 2-satisfiability(2SAT)problem.For a Q2SAT problem,we construct the Hamiltonian which is similar... We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability(Q2SAT)problem,which is a generalization of 2-satisfiability(2SAT)problem.For a Q2SAT problem,we construct the Hamiltonian which is similar to that of a Heisenberg chain.All the solutions of the given Q2SAT problem span the subspace of the degenerate ground states.The Hamiltonian is adiabatically evolved so that the system stays in the degenerate subspace.Our numerical results suggest that the time complexity of our algorithm is O(n3.9)for yielding non-trivial solutions for problems with the number of clauses m=dn(n-1)/2(d■0.1).We discuss the advantages of our algorithm over the known quantum and classical algorithms. 展开更多
关键词 adiabatic quantum computation quantum Hamiltonian algorithm quantum 2SAT problem
暂未订购 下载PDF
Quantum walks advantage on the dihedral group for uniform sampling problem 认领 引用
11
作者 Shyam Dhamapurkar Yuhang Dang +1 位作者 Saniya Wagh Xiu-Hao Deng 《Communications in Theoretical Physics》 SCIE CAS CSCD 2025年第2期87-98,共12页
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science.The mixing property is necessary for Markov chains to approach stationary distribution... Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science.The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated by walks.Quantum walks show promise for faster mixing times than classical methods but lack universal proof,especially in finite group settings.Here,we investigate the continuous-time quantum walks on Cayley graphs of the dihedral group D2nfor odd n,generated by the smallest inverse closed symmetric subset.We present a significant finding that,in contrast to the classical mixing time on these Cayley graphs,which typically takes at least orderΩ(n2log(1/2∈)),the continuous-time quantum walk mixing time on D2nis of order O(n(log n)5log(1/∈)),achieving a quadratic improvement over the classical case.Our paper advances the general understanding of quantum walk mixing on Cayley graphs,highlighting the improved mixing time achieved by continuous-time quantum walks on D2n.This work has potential applications in algorithms for a class of sampling problems based on non-abelian groups. 展开更多
关键词 continuous time quantum walks Cayley graphs non-abelian groups mixing time
暂未订购 下载PDF
An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem 认领 引用
12
作者 张大剑 仝殿民 +1 位作者 陆遥 龙桂鲁 《Communications in Theoretical Physics》 SCIE CAS CSCD 2015年第5期554-558,共5页
We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether ... We put forward an alternative quantum algorithm for finding ttamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a yon Neumann measurement on the final state, one may determine whether there is a HamiRonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness. 展开更多
关键词 Iquantum algorithm Hamiltonian cycle problem adiabatic quantum computation
暂未订购 下载PDF
Conceptual Problems in Bell’s Inequality and Quantum Entanglement 认领 引用 被引量：2
13
作者 Yingqiu Gu 《Journal of Applied Mathematics and Physics》 2022年第7期2216-2231,共16页
The description of the microscopic world in quantum mechanics is very different from that in classical physics, and there are some points of view that are contrary to intuition and logic. The first is the problem of r... The description of the microscopic world in quantum mechanics is very different from that in classical physics, and there are some points of view that are contrary to intuition and logic. The first is the problem of reality;quantum mechanics believes the behavior of micro particles is random and jumping. The second is the loss of certainty;the conjugate physical variables of a system cannot be determined synchronously, they satisfy the Heisenberg uncertainty principle. The third is the non-local correlation. The measurement of one particle in the quantum entanglement pair will influence the state of the other entangled particle simultaneously. In this paper, some concepts related to quantum entanglement, such as EPR correlation, quantum entanglement correlation function, Bell’s inequality and so on, are analyzed in detail. Analysis shows that the mystery and confusion in quantum theory may be caused by the logical problems in its basic framework. Bell’s inequality is only a mathematical theorem, but its physical meaning is actually unclear. The Bell state of quantum entangled pair may not satisfy the dynamic equation of quantum theory, so it cannot describe the true state of microscopic particles. In this paper, the correct correlation functions of spin entanglement pair and photonic entanglement pair are strictly derived according to normal logic. Quantum theory is a more fundamental theory than classical mechanics, and they are not equal relation in logic. However, there are still some unreasonable contents in the framework of quantum theory, which need to be improved. In order to disclose the real relationship between quantum theory and classical mechanics, we propose some experiments which provide intuitionistic teaching materials for the new interpretation of quantum theory. 展开更多
关键词 Quantum Mechanics Interpretation Mathematical Foundation of Quantum Mechanics EPR Correlation Bohm’s Hidden Variable Theory Quantum Entanglement Bell’s Inequality Quantum Correlation Function Schrödinger Equation Heisenberg Uncertainty Relation
暂未订购 下载PDF
Quafu-Qcover:Explore combinatorial optimization problems on cloud-based quantum computers 认领 引用 被引量：2
14
作者 许宏泽 庄伟峰 +29 位作者 王正安 黄凯旋 时运豪 马卫国 李天铭 陈驰通 许凯 冯玉龙 刘培 陈墨 李尚书 杨智鹏 钱辰 靳羽欣 马运恒 肖骁 钱鹏 顾炎武 柴绪丹 普亚南 张翼鹏 魏世杰 增进峰 李行 龙桂鲁 金贻荣 于海峰 范桁 刘东 胡孟军 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第5期104-115,共12页
We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and c... We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers. 展开更多
关键词 quantum cloud platform combinatorial optimization problems quantum software
暂未订购 下载PDF
A Parallel Quantum Algorithm for the Satisfiability Problem 认领 引用 被引量：2
15
作者 LIU Wen-Zhang ZHANG Jing-Fu LONG Gui-Lu 《Communications in Theoretical Physics》 SCIE CAS 2008年第3期629-630,共2页
In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （... In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found. 展开更多
关键词 satisfiability problem quantum search algorithm long algorithm
暂未订购 下载PDF
Quantum Monty Hall Problem under Decoherence 认领 引用 被引量：1
16
作者 Salman Khan M.Ramzan M.K.Khan 《Communications in Theoretical Physics》 SCIE CAS 2010年第7期47-54,共8页
We study the effect of decoherence on quantum Monty Hall problem under the influence of amplitude damping, depolarizing, and dephasing channels. It is shown that under the effect of decoherence, there is a Nash equili... We study the effect of decoherence on quantum Monty Hall problem under the influence of amplitude damping, depolarizing, and dephasing channels. It is shown that under the effect of decoherence, there is a Nash equilibrium of the game in case of depolarizing channel for Alice＇s quantum strategy. Whereas in case of dephasing noise, the game is not influenced by the quantum channel. For amplitude damping channel, Bob＇s payoffs are found symmetrical about a decoherence of 50% and the maximum occurs at this value of decoherence for his classical strategy. However, it is worth-mentioning that in case of depolarizing channel, Bob＇s classical strategy remains always dominant against any choice of Alice＇s strategy. 展开更多
关键词 quantum Monty Hall problem decoherence entanglement payoffs
暂未订购 下载PDF
Quantum demonstration of a bio-molecular solution of the satisfiability problem on spin-based ensemble 认领 引用 被引量：1
17
作者 任婷婷 冯芒 +1 位作者 张云龙 罗军 《Chinese Physics B》 SCIE EI CAS 2009年第12期5173-5178,共6页
DNA computation （DNAC） has been proposed to solve the satisfiability （SAT） problem due to operations in parallel on extremely large numbers of strands. This paper attempts to treat the DNA-based bio-molecular solu... DNA computation （DNAC） has been proposed to solve the satisfiability （SAT） problem due to operations in parallel on extremely large numbers of strands. This paper attempts to treat the DNA-based bio-molecular solution for the SAT problem from the quantum mechanical perspective with a purpose to explore the relationship between DNAC and quantum computation （QC）. To achieve this goal, it first builds up the correspondence of operations between QC and DNAC. Then it gives an example for the case of two variables and three clauses for details of this theory. It also demonstrates a three-qubit experiment for solving the simplest SAT problem with a single variable on a liquid-state nuclear magnetic resonance ensemble to verify this theory. Some discussions are made for the potential application and for further exploration of the present work. 展开更多
关键词 DNA computation liquid-state nuclear magnetic resonance SAT problem quantum computation
暂未订购 下载PDF
An adiabatic quantum optimization for exact cover 3 problem 认领 引用
18
作者 张映玉 许丽莉 李俊青 《Chinese Physics B》 SCIE EI CAS CSCD 2014年第3期139-141,共3页
A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evol... A perturbation method is applied to study the structure of the ground state of the adiabatic quantum optimization for the exact cover 3 problem. It is found that the instantaneous ground state near the end of the evolution is mainly composed of the eigenstates of the problem Hamiltonian, which are Hamming close to the solution state. And the instantaneous ground state immediately after the starting is mainly formed of low energy eigenstates of the problem Hamiltonian. These results are then applied to estimate the minimum gap for a special case. 展开更多
关键词 adiabatic quantum optimization exact cover 3 problem perturbation expansion
暂未订购 下载PDF
Systematic Algebraic Method to Identify Clifford Operations for Quantum Error-Correction Codes 认领 引用
19
作者 Sheng-Chen Liu Yu-Xuan Lin +1 位作者 Ying-Xiang Wang Liang-You Peng 《Chinese Physics Letters》 SCIE EI CAS CSCD 2026年第4期122-141,共20页
In the domain of quantum error correction,a critical task involves identifying logical operations on logical qubits for various quantum codes.However,owing to the inherent complexity of many quantum codes,devising an ... In the domain of quantum error correction,a critical task involves identifying logical operations on logical qubits for various quantum codes.However,owing to the inherent complexity of many quantum codes,devising an efficient method to implement the desired logical operations utilizing the structure of these codes presents a significant challenge.In previous studies,several methods were used to realize specific logical operations for certain quantum codes;however,they usually do not work for other quantum codes. 展开更多
关键词 logical operations quantum codesdevising quantum codeshoweverthey systematic algebraic method quantum codeshoweverowing quantum error correctiona quantum co identifying logical operations logical qubits
暂未订购 下载PDF
An Effective Hybridization of Quantum-based Avian Navigation and Bonobo Optimizers to Solve Numerical and Mechanical Engineering Problems 认领 引用 被引量：1
20
作者 Mohammad H.Nadimi-Shahraki 《Journal of Bionic Engineering》 SCIE EI CSCD 2023年第3期1361-1385,共25页
Hybrid metaheuristic algorithms play a prominent role in improving algorithms'searchability by combining each algorithm's advantages and minimizing any substantial shortcomings.The Quantum-based Avian Navigati... Hybrid metaheuristic algorithms play a prominent role in improving algorithms'searchability by combining each algorithm's advantages and minimizing any substantial shortcomings.The Quantum-based Avian Navigation Optimizer Algorithm(QANA)is a recent metaheuristic algorithm inspired by the navigation behavior of migratory birds.Different experimental results show that QANA is a competitive and applicable algorithm in different optimization fields.However,it suffers from shortcomings such as low solution quality and premature convergence when tackling some complex problems.Therefore,instead of proposing a new algorithm to solve these weaknesses,we use the advantages of the bonobo optimizer to improve global search capability and mitigate premature convergence of the original QANA.The effectiveness of the proposed Hybrid Quantum-based Avian Navigation Optimizer Algorithm(HQANA)is assessed on 29 test functions of the CEC 2018 benchmark test suite with different dimensions,30,50,and 100.The results are then statistically investigated by the Friedman test and compared with the results of eight well-known optimization algorithms,including PSO,KH,GWO,WOA,CSA,HOA,BO,and QANA.Ultimately,five constrained engineering optimization problems from the latest test suite,CEC 2020 are used to assess the applicability of HQANA to solve complex real-world engineering optimization problems.The experimental and statistical findings prove that the proposed HQANA algorithm is superior to the comparative algorithms. 展开更多
关键词 Optimization Metaheuristic algorithms Evolutionary algorithm Quantum-based avian navigation optimizer algorithm Engineering optimization problems,Bionic algorithm
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈