首页/论文/2004.11347

arXiv 2004.113472020-04-25quant-ph

Multi-layer quantum search and inclusion of NP into BQP

Shan Jin, Xiaoting Wang, Bo Li

备注：: We found an error in the proof. The main conclusion of the paper does not hold

英文摘要：

In this work, we present a multi-layer quantum search method that generates an exponential speedup of the standard Grover's algorithm. As direct applications, any NP problems can be solved efficiently on a quantum circuit with only polynomial gate complexity. In particular, such multi-layer search can solve the factoring problem with an exponential speedup, providing an alternative to Shor's algorithm. Our results show that the exponential speedup of quantum circuits is ubiquitous, and Grover's search is much more powerful than that has been demonstrated. With no contradiction to the quadratic optimality of single-layer query complexity, the great potential of Grover's search is fully released by such multi-layer search design.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

A fast quantum search algorithm by controlled measurement and qubit comparison implying the complexity class inclusion NP in BQP

This paper has been withdrawn by the author due to an apparent misunderstanding of quantum feedback control.

2006-02-12quant-ph

The space "just above" BQP

We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum computers can perform measurements that do not collapse the wavefunction. This (non-physical) model of computation can efficiently solve problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers. Furthermore, it can search an unstructured N-element list in $\tilde O$(N^{1/3}) time, but no faste…

2014-12-19cs.CCquant-ph

恰好高于一个纯净量子比特的空间

The Space Just Above One Clean Qubit

本文研究了介于DQC1和BQP之间的计算模型1/2BQP，证明其能模拟IQP并解决因式分解等问题，但无法实现Grover算法的二次搜索加速。

2024-10-10cs.CCquant-ph

BQP，遇见NP：搜索到决策归约与近似计数

BQP, meet NP: Search-to-decision reductions and approximate counting

本文研究带NP预言机的量子计算能力，证明SAT见证搜索仅需Θ(log n)次NP查询且该界在黑盒模型下最优，并给出近似计数在量子情形下的查询下界，表明现有经典近似计数算法很可能已是最优。

2024-01-08cs.CCquant-ph

Limitations of Quantum Advice and One-Way Communication

Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only limited advantages over classical ones. First, we show that $\mathsf{BQP/qpoly}\subseteq\mathsf{PP/poly}$, where $\mathsf{BQP/qpoly}$ is the class of problems solvable in quantum polynomial time, given a polynomial-size "quantum advice state" that depends only on the input length. This resolves a question of Buhrman, and means that we should not hope for an …

2018-06-21cs.CCquant-ph

Computation in generalised probabilistic theories

From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? …

2015-09-11cs.CCquant-ph

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

A new way to accelerate the D-MORPH method to search for optimal quantum control

The paper introduces new corrections of different orders of smallness to the D-MORPH method by using the full form of the derivative of the exponential map, defined on a Lie algebra, to search for the optimal control of a quantum system that implements a desired unitary evolution. The inclusion of such corrections, which take into account information about different system Hamiltonian's commutators, results in faster optimal control's finding, even compared to the improved version of the method published earlier by the author.

2017-09-12quant-ph

具有惰性量子漫步的噪声鲁棒空间搜索

Noise-Resilient Spatial Search with Lackadaisical Quantum Walks

Federal University of Rio de Janeiro（里约热内卢联邦大学）

本文研究了噪声环境下惰性量子漫步在二维环形网格中的空间搜索性能，发现自环显著提高了其鲁棒性，拓展了LQWs在噪声环境中的应用优势。

2026-01-26quant-ph

An improvement of D-MORPH method for finding quantum optimal control

The paper examines the prominent algorithm D-MORPH to search for the optimal control of a quantum system in order to implement desired unitary evolution of the quantum system at the final time, and reveals new mathematical expressions for various orders' corrections to the algorithm, that include information about the commutators of the system's Hamiltonian. Inclusion of such corrections results in faster optimal quantum control's search with high precision, i.e. allows saving of computational resources.

2017-09-15quant-ph

The Quantum Strong Exponential-Time Hypothesis

The strong exponential-time hypothesis (SETH) is a commonly used conjecture in the field of complexity theory. It states that CNF formulas cannot be analyzed for satisfiability with a speedup over exhaustive search. This hypothesis and its variants gave rise to a fruitful field of research, fine-grained complexity, obtaining (mostly tight) lower bounds for many problems in P whose unconditional lower bounds are hard to find. In this work, we introduce a framework of Quantum Strong Exponential-Time Hypotheses, as quantum analogues to SETH. Using the QSETH framework, we are able to translate qua…

2019-11-14cs.CCquant-ph

Quantum Computational Phase Transition in Combinatorial Problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that $BQP\neq NP$, it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT -- random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA cir…

2022-06-15cond-mat.dis-nncond-mat.stat-mechcs.CC

Staggered Quantum Walks on Graphs

The staggered quantum walk model allows to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model, which in its turn is entirely included in the staggered model. In order to compare those three quantum walk models, we put them in the staggered formalism and we show that the Szegedy and coined models are defined on a special subclass of graphs. This inclusion scheme is also true when the searching framework is added. We use graph theory to characterize whic…

2016-06-04math.COquant-ph