Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0510179 · Quantum Information Processing

Quest for Fast Partial Search Algorithm

V. E. Korepin, Jinfeng Liao

Published May 9, 2006• 22 citations
arXivHTMLPDF
DOI
10.1007/s11128-006-0024-3

Related papers

Quantum Algorithm for Partial Search

V. E. Korepin

Bulletin of the American Physical Society•Mar 8, 2007•0 citations

Simple Algorithm for Partial Quantum Search

V. E. Korepin, Lov K. Grover

arXiv:quant-ph/0504157•Quantum Information Processing•Feb 1, 2006•54 citations

Fast Search Method for Large Polarization Kernels

Grigorii Trofimiuk

A novel search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing the depth-first search combined with the computation of coset leaders weight tables and sufficient conditions of code non-equivalence. Using the proposed method, we improved all existing lower bounds on the maximum error exponent for kernels of size from 17 to 29. We also obtained kernels which admit low complexity processing by the recently proposed recursive trellis algorithm. Numerical results demonstrate the advantage of polar codes with the obtained kernels compared with shortened polar codes and polar codes with small kernels.

arXiv:2310.08369•IEEE Transactions on Communications•Oct 16, 2023•3 citations

Multi-pattern Partial Quantum Search Algorithm

Ri‐Gui Zhou

A multi-pattern partial quantum search algorithm was proposed to increase database searching speed.The algorithm groups the items of a database into equal blocks,neglects some unimportant information,and uses the multi-pattern quantum search algorithm to increase searching speed and concurrently search multi-patterns in the database.An example indicates that the proposed partial algorithm saves 1.325×106 iterations against the global search algorithm in a database with 7.206×1016 items.

Journal of Southwest Jiaotong University•Jan 1, 2008•1 citation

Enhanced algorithms for Local Search

Yves F. Verhoeven

arXiv:quant-ph/0506019•Information Processing Letters•Dec 6, 2005•10 citations

Fast Heuristics and Approximation Algorithms

Abraham P. Punnen

Springer eBooks•Jan 1, 2022•0 citations
A novel search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing the depth-first search combined with the computation of coset leaders weight tables and sufficient conditions of code non-equivalence. Using the proposed method, we improved all existing lower bounds on the maximum error exponent for kernels of size from 17 to 29. We also obtained kernels which admit low complexity processing by the recently proposed recursive trellis algorithm. Numerical results demonstrate the advantage of polar codes with the obtained kernels compared with shortened polar codes and polar codes with small kernels.