Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

DOI10.1007/S11128-010-0187-9MaRDI QIDQ548212zbMATH OpenOpenAlexFDO

Authors Byung-Soo Choi, Samuel L. Braunstein

Publication date 28 June 2011

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

Full work available at URL https://eprints.whiterose.ac.uk/66825/1/cb10.pdf

zbMATH Keywords

quantum algorithmquery complexitygeneralized weight decision problem

Mathematics Subject Classification ID

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

Recommendations

• Exact quantum algorithm to distinguish Boolean functions of different weights
• A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
• Optimality proofs of quantum weight decision algorithms
• Quantum weighted model counting
• Revisiting Deutsch-Jozsa algorithm

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1303143 (Why is no real title available?)
• scientific article; zbMATH DE number 1424160 (Why is no real title available?)
• Algebraic analysis of quantum search with pure and mixed states
• Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
• Entanglement in the Grover search algorithm
• Exact quantum algorithm to distinguish Boolean functions of different weights
• Fixed-point quantum search
• Fixed-point quantum search for different phase shifts
• Grover's Quantum Algorithm Applied to Global Optimization
• Optimization of partial search
• Phase matching condition for quantum search with a generalized initial state
• Quantum partial search of a database with several target items
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation
• Simple algorithm for partial quantum search
• Solving a class of continuous global optimization problems using quantum algorithms
• Sure success partial search
• THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
• The quantum query complexity of approximating the median and related statistics
• Threshold quantum cryptograph based on Grover's algorithm

Cited in

(6)

• Optimality proofs of quantum weight decision algorithms
• Evaluation of exact quantum query complexities by semidefinite programming
• A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
• Quantum weighted model counting
• An exact quantum algorithm for a restricted subtraction game
• Exact quantum algorithm to distinguish Boolean functions of different weights

This page was built for publication: Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

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