Scholarlink

<p>Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an uncountably infinite space, presenting unique computational challenges. In this work, we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges, achieving a quadratic speedup. Inspired by the discrete search results, we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs, demonstrating the optimality of our approach. In addition, we demonstrate how to design the internal structure of the quantum search oracle for specific problems. Furthermore, we develop a general framework to apply this algorithm to a range of problem types, including optimization and eigenvalue problems involving continuous variables.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Fixed-point quantum continuous search algorithm with optimal query complexity

  • 期刊论文

  • 发表日期：

    2025年4月22日

查看全文
  • Shan Jin,
  • Yuhan Huang,
  • Shaojun Wu,
  • Guanyu Zhou,
  • Chang-Ling Zou,
  • Luyan Sun,
  • Xiaoting Wang

摘要

Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an uncountably infinite space, presenting unique computational challenges. In this work, we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges, achieving a quadratic speedup. Inspired by the discrete search results, we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs, demonstrating the optimality of our approach. In addition, we demonstrate how to design the internal structure of the quantum search oracle for specific problems. Furthermore, we develop a general framework to apply this algorithm to a range of problem types, including optimization and eigenvalue problems involving continuous variables.