Quantum search algorithm for binary constant weight codes
From MaRDI portal
Publication:6639960
DOI10.1007/s11128-024-04573-wMaRDI QIDQ6639960
Naoki Ishikawa, Kein Yukiyoshi
Publication date: 18 November 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling constant weight codes using tabu search
- Implementing pure adaptive search with Grover's quantum algorithm
- The theory of Newton's method
- A new table of constant weight codes of length greater than 28
- A new table of constant weight codes
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Optical orthogonal codes: design, analysis and applications
- A few new constant weight codes (Corresp.)
- New constant weight codes from linear permutation groups
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Strengths and Weaknesses of Quantum Computing
- Design of balanced and constant weight codes for VLSI systems
- Orthogonal Frequency Division Multiplexing With Index Modulation
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- Reducibility among Combinatorial Problems
- Grover's Quantum Algorithm Applied to Global Optimization
This page was built for publication: Quantum search algorithm for binary constant weight codes