Optimality proofs of quantum weight decision algorithms
From MaRDI portal
Publication:430107
DOI10.1007/S11128-011-0233-2zbMATH Open1243.81056OpenAlexW2022050874MaRDI QIDQ430107FDOQ430107
Authors: Byung-Soo Choi 
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
Recommendations
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- An optimal quantum algorithm for the oracle identification problem
- Quantum algorithms for weighing matrices and quadratic residues
- Optimal quantum query bounds for almost all Boolean functions
- Almost optimal solution of initial-value problems by randomized and quantum algorithms
- On the universality of the quantum approximate optimization algorithm
- A universal quantum algorithm for weighted maximum cut and Ising problems
- An Optimal Separation of Randomized and Quantum Query Complexity
- An optimal separation of randomized and Quantum query complexity
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
Decision theory (91B06) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)
Cites Work
- The quantum query complexity of approximating the median and related statistics
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- 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
- Rapid solution of problems by quantum computation
- Simple algorithm for partial quantum search
- Optimization of partial search
- Quantum lower bounds by polynomials
- Fixed-point quantum search
- Quantum lower bounds by quantum arguments
- Quantum partial search of a database with several target items
- Title not available (Why is that?)
- Grover's Quantum Algorithm Applied to Global Optimization
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Phase matching condition for quantum search with a generalized initial state
- Solving a class of continuous global optimization problems using quantum algorithms
- Fixed-point quantum search for different phase shifts
Cited In (3)
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
- Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
This page was built for publication: Optimality proofs of quantum weight decision algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q430107)
