Raj Alexandru Guţoiu, Andrei Tănăsescu, Pantelimon George Popescu
{"title":"Simple exact quantum search","authors":"Raj Alexandru Guţoiu, Andrei Tănăsescu, Pantelimon George Popescu","doi":"10.1007/s11128-024-04548-x","DOIUrl":null,"url":null,"abstract":"<div><p>While Grover’s search algorithm is asymptotically optimal, it does not always result in a real solution. If the search fails, the algorithm must be ran again from the beginning, conditionally doubling the effective number of oracle calls. Previous research attempted to fix this issue by modifying the oracle or alternating between numerically optimized reflectors. In this paper, we present an optimal initial state and reflector that produce an exact search with Grover’s algorithm at the cost of at most one additional oracle call beyond the optimum, a cost which can be nullified if we know a non-solution. We do this without modifying the oracle, without changing the diffuser at each step and even without any numerical optimization procedure required.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s11128-024-04548-x.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04548-x","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0
Abstract
While Grover’s search algorithm is asymptotically optimal, it does not always result in a real solution. If the search fails, the algorithm must be ran again from the beginning, conditionally doubling the effective number of oracle calls. Previous research attempted to fix this issue by modifying the oracle or alternating between numerically optimized reflectors. In this paper, we present an optimal initial state and reflector that produce an exact search with Grover’s algorithm at the cost of at most one additional oracle call beyond the optimum, a cost which can be nullified if we know a non-solution. We do this without modifying the oracle, without changing the diffuser at each step and even without any numerical optimization procedure required.
期刊介绍：
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
