首页/论文/quant-ph/0703231

arXiv quant-ph/07032312007-03quant-ph

Quantum Search in an Ordered List via Adaptive Learning

M. Ben-Or, Avinatan Hassidim

备注：: 10 pages no figures

英文摘要：

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: 1. Each comparison can be erroneous with some probability $1 - p$. 2. At each stage $k$ comparisons can be performed in parallel and a noisy answer is returned We present a (classic) algorithm which optimally solves both variants together, up to an additive term of O(\log \log(n)), and prove matching information theoretic lower bounds. We use the algorithm to improve the results of Farhi et al \cite{FGGS99} presenting a quantum (error free) search algorithm in an ordered list of expected complexity less than (\log_2n) / 3.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Limit on the Speed of Quantum Computation for Insertion into an Ordered List

We consider the problem of inserting a new item into an ordered list of N-1 items. The length of an algorithm is measured by the number of comparisons it makes between the new item and items already on the list. Classically, determining the insertion point requires log N comparisons. We show that, for N large, no quantum algorithm can reduce the number of comparisons below log N/(2 loglog N).

1998-12-18quant-ph

Searching an Ordered List on a Quantum Computer

Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least 1/2, whereas classically, log N - O(1) queries are needed to obtain constant success probability. Moreover, our algorithm employs the Haar transform and thus differs substantially from Grover's search algorithm and from algorithms relying on the quantum Fourier transform.

1999-04-22quant-ph

Invariant Quantum Algorithms for Insertion into an Ordered List

We consider the problem of inserting one item into a list of N-1 ordered items. We previously showed that no quantum algorithm could solve this problem in fewer than log N/(2 log log N) queries, for N large. We transform the problem into a "translationally invariant" problem and restrict attention to invariant algorithms. We construct the "greedy" invariant algorithm and show numerically that it outperforms the best classical algorithm for various N. We also find invariant algorithms that succeed exactly in fewer queries than is classically possible, and iterating one of them shows that the in…

1999-01-19quant-ph

Quantum complexities of ordered searching, sorting, and element distinctness

We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all distinct. Letting N be the number of elements in the input list, we prove a lower bound of \frac{1}π(\ln(N)-1) accesses to the list elements for ordered searching, a lower bound of Ω(N\log{N}) binary comparisons for sorting, and a lower bound of Ω(\sqrt{N}\log{N}) binary comparisons for element distinctness. The previously best known lower bounds are {1/12}\log_2(N) - O(1) due to Ambainis, Ω(N), and Ω(\sqrt{N}), respecti…

2001-04-27quant-ph

A better lower bound for quantum algorithms searching an ordered list

We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057).

1999-02-14cs.CCcs.DSquant-ph

Improved quantum algorithms for the ordered search problem via semidefinite programming

One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion…

2006-08-21quant-ph

更多相关论文收起更多论文

有序搜索的平移不变量子算法是最优的

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

该研究针对有序搜索问题，探究平移不变量子算法的性能，通过算法转化与线性规划方法，证明该类算法的最优性，给出精确量子有序搜索的查询复杂度相关结果。

2025-07-30quant-ph

Bounds on quantum ordered searching

We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}π(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof is based on a weighted all-pairs inner product argument, and it generalizes to bounded-error quantum algorithms. The currently best known upper bound for exact searching is roughly 0.526 \log_2(N). We give an exact quantum algorithm that uses \log_3(N) + O(1) queries, which is roughly 0.631 \log_2(N). The main principles in our algorithm are an quantum parallel …

2001-04-27quant-ph

Optimal quantum adversary lower bounds for ordered search

The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Hoyer, Neerbek, and Shi proved a quantum lower bound for this problem of (1/pi) ln n + Theta(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the original problem by at most 1). Thus we show that the best lower bound for ordered search that can be proved by the adversary method is (1/pi) ln n + O(1). Furthermore, we show that this remains true fo…

2007-08-24quant-ph

Quantum search of partially ordered sets

We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can achieve at most a quadratic improvement in query complexity over classical algorithms, up to logarithmic factors; we also give quantum algorithms that almost achieve this optimal reduction in complexity. In one model, we give an improved quantum algorithm for searching forest-like posets; in the other, we give an optimal O(sqrt(m))-query quantum algorithm for sea…

2007-03-02quant-ph

后量子迁移的延迟成本：将经典风险与先收集后解密风险置于同一有序列表

Cost of Delay for Post-Quantum Migration: Putting Classical and Harvest-Now-Decrypt-Later Risk on One Ordered List

本研究提出以货币化延迟成本统一量化后量子迁移与经典风险，构建竞争风险模型并证明排序最优性，通过模拟验证，为资产迁移优先级提供决策依据。

2026-10-08cs.CRquant-ph

有序搜索的最优量子算法

Optimal Quantum Algorithms for Ordered Search

University of Maryland（马里兰大学）

本文提出两种有序搜索的最优量子算法，均达到 $\frac{1}{\pi}\ln n+o(\log n)$ 查询复杂度，解决了长期悬而未决的常数因子问题，分别基于连续松弛和多项式规划的解析解。

2026-09-29quant-ph

一个记忆恶魔：面向量子热力学中时间相关性的代理方法

A Demon that remembers: An agential approach towards quantum thermodynamics of temporal correlations

Nanyang Technological University（南洋理工大学）

本文提出一个决策理论框架，用于从量子系统中的时间相关性中提取热力学功，通过引入ρ*理想协议，展示了利用记忆效应可使适应性策略超越非适应性界限，并引入了时间有序自由能（TOFE）作为新型上界，揭示了与适应有序discord相关的热力学间隙。

2026-04-06quant-ph

A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits

Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimisation and execution of the expressed computations. However, the specification format makes it difficult to verify that optimised or executed computations still conform to the initial gate list specifications: showing the computational equivalence between two quantum circuits expressed by different lists of quantum gates is exponentially complex in the worst case. In order to solve this issue, this work presents a deriv…

2018-07-08quant-ph

有限与渐近机制下时间序过程的优化

Optimisation of time-ordered processes in the finite and asymptotic regime

本研究提出可处理的松弛方法，解决量子信息理论中动力系统顺序结果的优化问题，并应用于有限状态自动机输出概率计算、多体纠缠检测协议开发及幻态检测自适应协议设计，同时提供无限时间步极限下不可计算最大得分的启发式边界估计。

2024-06-06math.OCquant-ph

An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the i-th block. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argument shows that the multiple-block ordered search needs a large number of nonadaptive oracle queries on a black-box model of quantum computation that is also supplemented with advice. Our argument is also …

2004-07-15cs.CCquant-ph

表面码错误综合征的高性能列表解码算法

A High-Performance List Decoding Algorithm for Surface Codes with Erroneous Syndrome

本文提出一种针对表面码错误综合征的高性能列表解码算法，结合BP预处理与OSD后处理，利用综合征软信息，无需额外测量即可恢复量子比特和综合征，显著提升解码性能。

2024-11-08cs.ITmath.ITquant-ph