Efficient quantum algorithms of finding the roots of a polynomial function
From MaRDI portal
Publication:1616488
DOI10.1007/s10773-018-3776-5zbMath1401.81038OpenAlexW2803676763WikidataQ62037277 ScholiaQ62037277MaRDI QIDQ1616488
Santanu Kumar Patro, Do Ngoc Diep, Ahmed Farouk, Tadao Nakamura, Koji Nagata, Han Geurdes, Josep 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
Quantum computation (81P68) Real polynomials: location of zeros (26C10) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix ⋮ Solving Bernstein and Vazirani's problem with the 2-bit permutation function
Cites Work
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Quantum computation with coherent spin states and the close Hadamard problem
- Quantum communication and quantum multivariate polynomial interpolation
- Quantum cryptography based on the Deutsch-Jozsa algorithm
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- 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
- Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Quantum Complexity Theory
- Quantum complexity theory
- Quantum theory: concepts and methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient quantum algorithms of finding the roots of a polynomial function
