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

DOI10.1007/S11128-013-0606-9zbMATH Open1283.81039DBLPjournals/qip/UyanikT13OpenAlexW2084272353WikidataQ58895424 ScholiaQ58895424MaRDI 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

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

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)

Cites Work

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

Cited In (4)

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

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)