Efficient quantum algorithms of finding the roots of a polynomial function
From MaRDI portal
(Redirected from Publication:1616488)
Recommendations
- Quantum algorithm for the root-finding problem
- Efficient quantum algorithm for identifying hidden polynomials
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Quantum algorithm for multivariate polynomial interpolation
- On zeros of exponential polynomials and quantum algorithms
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3987248 (Why is no real title available?)
- scientific article; zbMATH DE number 3213336 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- Quantum Complexity Theory
- Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
- Quantum algorithms revisited
- Quantum communication and quantum multivariate polynomial interpolation
- Quantum complexity theory
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum theory: concepts and methods
- Rapid solution of problems by quantum computation
Cited in
(8)- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- Generalization of the Bernstein-Vazirani algorithm beyond qubit systems
- Quantum algorithm for the root-finding problem
- Efficient quantum algorithm for the parity problem of a certain function
- On zeros of exponential polynomials and quantum algorithms
- scientific article; zbMATH DE number 6820205 (Why is no real title available?)
This page was built for publication: Efficient quantum algorithms of finding the roots of a polynomial function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616488)
