A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions

DOI10.1007/s11128-013-0606-9zbMath1283.81039OpenAlexW2084272353WikidataQ58895424 ScholiaQ58895424MaRDI QIDQ2436429

S. Turgut, Kıvanç Uyanık

Publication date: 25 February 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-013-0606-9

zbMATH Keywords

quantum algorithmweight decision problemquantum searchingGrover iteration

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Evaluation of exact quantum query complexities by semidefinite programming

Cites Work

• Optimality proofs of quantum weight decision algorithms
• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• Exact quantum algorithm to distinguish Boolean functions of different weights
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Strengths and Weaknesses of Quantum Computing
• Quantum cryptanalysis of hash and claw-free functions
• Unnamed Item
• Unnamed Item
• Unnamed Item