arXiv 0806.15392008-06-09quant-ph

Quantum Search Algorithm for Set Operation

Chao-Yang Pang, Cong-Bao Ding, Ben-Qiong Hu

备注：: 15 page 2 Figure

英文摘要：

The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set operation. In this paper, the quantum algorithm for intersection is presented. And its running time is sqrt(|A|*|B|*|C|) for set operation C = A intersection B, while classical computation needs O (|A| *|B|) steps of computation in general, where |.| denotes the size of set. The presented algorithm is the combination of Grover's algorithm, classical memory and classical iterative computation, and the combination method decrease the complexity of designing quantum algorithm.The method can be used to design other set operations also. Keywords: Set operation, General Grover iteration, Grover's algorithm

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Additive decomposition of iterative quantum search operations in the Grover-type algorithm

In the Grover-type quantum search process a search operator is iteratively applied, say, k times, on the initial database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational space, as a linear combination of k operators, each of which consists of a single Grover-search followed by an overall phase-rotation. The value of k and the rotation phase are the same as those determined in the framework of the search with certainty. We further show that the final state can be expressed in terms of a single oracle operator of the Grover-se…

2017-06-05quant-ph

Tradeoffs in the Quantum Search Algorithm

Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This has been proved to be the best possible algorithm for the exhuastive search problem in the sense the number of queries it requires cannot be reduced. However, as this paper shows, the number of non-query operations, and thus the total number of operations, can be reduced. The number of non-query unitary operations can be reduced by a factor of log N/alpha*log(log N) while increasing the number of queries by a factor of only (1+(log N)^{-alpha}). Various choices of alpha yield different va…

2002-01-31quant-ph

Superlinear Amplitude Amplification

Quantum search/amplitude amplification algorithms are designed to be able to amplify the amplitude in the target state linearly with the number of operations. Since the probability is the square of the amplitude, this results in the success probability rising quadratically with the number of operations. This paper presents a new kind of quantum search algorithm in which the amplitude of the target state, itself increases quadratically with the number of operations. However, the domain of applications of this is much more limited than standard amplitude amplification.

2008-06-02quant-ph

Superadiabatic Control of Quantum Operations

Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce a new approach to adiabatic control that uses the superadiabatic quality or $Q$-factor as a performance metric to design robust, high fidelity pulses. This approach permits the systematic design of quantum control schemes to maximize the adiabaticity of a unitary operation in a particular time interval given the available control resources. The interplay between adiabaticity, fidelity and robustness of the resulting pulses is examined for the case of single-qubit inversion, and superadiabatic pul…

2016-04-20quant-ph

Quantum computers can search rapidly by using almost any transformation

A quantum computer has a clear advantage over a classical computer for exhaustive search. The quantum mechanical algorithm for exhaustive search was originally derived by using subtle properties of a particular quantum mechanical operation called the Walsh-Hadamard (W-H) transform. This paper shows that this algorithm can be implemented by replacing the W-H transform by almost any quantum mechanical operation. This leads to several new applications where it improves the number of steps by a square-root. It also broadens the scope for implementation since it demonstrates quantum mechanical algo…

1997-12-03quant-ph

Universal construction for the unsorted quantum search algorithms

The multiple-quantum operator algebra formalism has been exploited to construct generally an unsorted quantum search algorithm. The exponential propagator and its corresponding effective Hamiltonian are constructed explicitly that describe in quantum mechanics the time evolution of a multi- particle two-state quantum system from the initial state to the output of the unsorted quantum search problem. The exponential propagator usually may not be compatible with the mathematical structure and principle of the search problem and hence is not a real quantum search network, but it can be further de…

2001-06-20quant-ph

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

Grover's search algorithm for $n$ qubits with optimal number of iterations

The success probability of a search of $M$ targets from a database of size $N$, using Grover's search algorithm depends critically on the number of iterations of the composite operation of the oracle followed by Grover's diffusion operation. Although the required number of iterations scales as $\mathcal{O}(\sqrt{N})$ for large $N$, the asymptote is not a good indicator of the optimal number of iterations when $\sqrt{M/N}$ is not small. A scheme for the determination of the exact number of iterations, subject to a threshold set for the success probability of the search (probability of detecting…

2020-11-22quant-ph

Similarity between Grover's quantum search algorithm and classical two-body collisions

By studying the attribute of the inversion about average operation in quantum searching algorithm, we find the similarity between the quantum searching and the course of two rigid bodies'collision. Some related questions are discussed from this similarity.

2002-09-12quant-ph

Quantum Algorithms with Fixed Points: The Case of Database Search

The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which get around this limitation. The first replaces selective inversions in the algorithm by selective phase shifts of $\fracπ{3}$. The second controls the selective inversion operations using two ancilla qubits, and irreversible measurement operations on the ancilla qubits drive the starting state towards the target state. Using $q$ oracle queries, these variatio…

2006-03-15quant-ph

A new algorithm for fixed point quantum search

The standard quantum search lacks a feature, enjoyed by many classical algorithms, of having a fixed point, i.e. monotonic convergence towards the solution. Recently a fixed point quantum search algorithm has been discovered, referred to as the Phase-$π/3$ search algorithm, which gets around this limitation. While searching a database for a target state, this algorithm reduces the error probability from $ε$ to $ε^{2q+1}$ using $q$ oracle queries, which has since been proved to be asymptotically optimal. A different algorithm is presented here, which has the same worst-case behavior as the Phas…

2006-03-22quant-ph

确定性且精确地逆转未知量子比特幺正操作

Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly

本文提出一种确定性精确逆转未知量子比特幺正操作的协议，通过4次调用输入操作并利用催化态实现时间反演，同时简化了最优协议搜索的半定规划方法。

2023-09-07quant-ph

Grover search revisited; application to image pattern matching

The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the original motivating application of the algorithm, i.e., the database search or more broadly the pattern matching in a practical setting, mainly due to the technical difficulty in efficiently implementing the data loading and amplitude amplification processes. In this paper, we propose a quantum algorithm that approximately executes the entire Grover database sea…

2021-10-01quant-ph

Solving the quantum search problem in polynomial time on an NMR quantum computer

The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in polynomial time on an NMR quantum computer. The NMR ensemble quantum computation is based on the quantum mechanical unitary dynamics that both a closed quantum system and its ensemble obey the same quantum mechanical unitary dynamics instead of on the pseudopure state or the effective pure state of the classical NMR quantum computation. Based on the new principle …

2002-06-16quant-ph

量子 Grover 搜索算法的经典模拟电路仿真

Classical analog circuit emulation of quantum Grover search algorithm

本文提出基于运算放大器、电阻和电容的全模拟电路框架，通过复振幅干涉仿真通用量子门，并实现 3 量子比特 Grover 搜索，实验输出与预测准确一致。

2025-06-06cond-mat.dis-nnquant-ph

启发式前瞻蒸馏协议搜索

Heuristic Lookahead Distillation Protocol Search

University of York（约克大学）

本研究提出启发式前瞻蒸馏协议搜索方法，实现了更高的量子比特Werner态蒸馏速率，提升了量子比特去极化信道双向辅助量子容量的最优下界，推动了量子信息理论问题的解决。

2026-08-17cond-mat.othermath-phmath.MP