Optimality proofs of quantum weight decision algorithms
From MaRDI portal
Publication:430107
DOI10.1007/s11128-011-0233-2zbMath1243.81056OpenAlexW2022050874MaRDI QIDQ430107
Publication date: 20 June 2012
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-011-0233-2
Decision theory (91B06) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Fixed-point quantum search for different phase shifts
- Entanglement in the Grover search algorithm
- 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
- 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
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Fixed-Point Quantum Search
- Grover's Quantum Algorithm Applied to Global Optimization
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Phase matching condition for quantum search with a generalized initial state
- Solving a class of continuous global optimization problems using quantum algorithms
This page was built for publication: Optimality proofs of quantum weight decision algorithms
