【代码贡献】新增BBHT未知解数量随机Grover搜索 - #67
Open
tokenjunkielabs wants to merge 3 commits into
Open
tokenjunkielabs wants to merge 3 commits into
tokenjunkielabs wants to merge 3 commits into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
概要
本提交为 #13 的代码贡献类参赛条目,新增 Boyer–Brassard–Høyer–Tapp (BBHT) 随机 Grover 搜索,用于目标解数量未知的场景。
主要内容
BBHTSearch,采用扩张随机迭代区间并在sqrt(N)封顶的 BBHT 调度。mark_data便捷模式,但调度仍不读取目标数量。BBHTResult,返回是否找到、bitstring、尝试次数和累计 Grover 迭代次数。Grover/ amplitude-amplification 实现,而不是维护第二套 Grover 栈。未运行额外测试矩阵;本条目直接提交源代码、公开 API 与示例。
相关:#13