Efficient quantum algorithms of finding the roots of a polynomial function
DOI10.1007/S10773-018-3776-5zbMATH Open1401.81038OpenAlexW2803676763WikidataQ62037277 ScholiaQ62037277MaRDI QIDQ1616488FDOQ1616488
Authors: Koji Nagata, Tadao Nakamura, Han Geurdes, Ahmed Farouk, Do Ngoc Diep, Santanu Kumar Patro, J. Batle 
Publication date: 6 November 2018
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-018-3776-5
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
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Real polynomials: location of zeros (26C10)
Cites Work
- Title not available (Why is that?)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Quantum algorithms revisited
- Quantum Complexity Theory
- Rapid solution of problems by quantum computation
- Quantum theory: concepts and methods
- Quantum computation with coherent spin states and the close Hadamard problem
- Title not available (Why is that?)
- Quantum complexity theory
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers
- Fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms with three qubits
- Quantum communication and quantum multivariate polynomial interpolation
Cited In (8)
- Solving Bernstein and Vazirani's problem with the 2-bit permutation function
- Generalization of the Bernstein-Vazirani algorithm beyond qubit systems
- Necessary and sufficient condition for quantum computing
- Quantum communication based on an algorithm of determining a matrix
- 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
- Title not available (Why is that?)
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)
