Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
From MaRDI portal
Publication:548212
DOI10.1007/s11128-010-0187-9zbMath1216.81047MaRDI QIDQ548212
Samuel L. Braunstein, Byung-Soo Choi
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
68P10: Searching and sorting
81P68: Quantum computation
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-point quantum search for different phase shifts
- Threshold quantum cryptograph based on Grover's algorithm
- Entanglement in the Grover search algorithm
- Sure success partial search
- Quantum partial search of a database with several target items
- Simple algorithm for partial quantum search
- The quantum query complexity of approximating the median and related statistics
- Algebraic analysis of quantum search with pure and mixed states
- Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
- Optimization of partial search
- 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
- Fixed-Point Quantum Search
- Grover's Quantum Algorithm Applied to Global Optimization
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
- Phase matching condition for quantum search with a generalized initial state
- Solving a class of continuous global optimization problems using quantum algorithms
