Optimality proofs of quantum weight decision algorithms
From MaRDI portal
(Redirected from Publication:430107)
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
Cites work
- scientific article; zbMATH DE number 5899240 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- 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
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- 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
- The quantum query complexity of approximating the median and related statistics
Cited in
(3)- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
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)
