Exact quantum algorithm to distinguish Boolean functions of different weights
From MaRDI portal
Publication:3594687
DOI10.1088/1751-8113/40/29/017zbMath1117.81016arXivquant-ph/0410043OpenAlexW3104664905MaRDI QIDQ3594687
Samuel L. Braunstein, Subhroshekhar Ghosh, Byung-Soo Choi, Subhamoy Maitra
Publication date: 9 August 2007
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0410043
Related Items (9)
Application of Grover's algorithm to check non-resiliency of a Boolean function ⋮ Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters ⋮ An exact quantum algorithm for a restricted subtraction game ⋮ Geometric pictures for quantum search algorithms ⋮ Optimality proofs of quantum weight decision algorithms ⋮ A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions ⋮ Quantum algorithms on Walsh transform and Hamming distance for Boolean functions ⋮ QUANTUM DIRECT COMMUNICATION BASED ON QUANTUM SEARCH ALGORITHM ⋮ Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
This page was built for publication: Exact quantum algorithm to distinguish Boolean functions of different weights
