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

DOI10.1007/S11128-013-0606-9zbMATH1283.81039DBLPjournals/qip/UyanikT13OpenAlexW2084272353WikidataQ58895424MaRDI QIDQ2436429FDOQ2436429

Authors Kıvanç Uyanık, S. Turgut

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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Exact quantum algorithm to distinguish Boolean functions of different weights
• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• scientific article; zbMATH DE number 1796991
• scientific article; zbMATH DE number 2103524
• FORMULATION OF A FAMILY OF SURE-SUCCESS QUANTUM SEARCH ALGORITHMS

Cites work

• scientific article; zbMATH DE number 5320369 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303143 (Why is no real title available?)
• Exact quantum algorithm to distinguish Boolean functions of different weights
• On the Power of Quantum Computation
• Optimality proofs of quantum weight decision algorithms
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• Quantum cryptanalysis of hash and claw-free functions
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation
• Strengths and Weaknesses of Quantum Computing

Cited in

(4)

• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• Exact quantum algorithm to distinguish Boolean functions of different weights
• Optimality proofs of quantum weight decision algorithms
• Evaluation of exact quantum query complexities by semidefinite programming

This page was built for publication: A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436429)