Quantum algorithm for the root-finding problem

DOI10.1007/S40509-018-0171-0MaRDI QIDQ2329950zbMATH OpenOpenAlexWikidataFDO

Authors Koji Nagata, Tadao Nakamura

Publication date 18 October 2019

Published in Quantum Studies: Mathematics and Foundations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40509-018-0171-0

zbMATH Keywords

quantum algorithmsquantum computation

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Efficient quantum algorithms of finding the roots of a polynomial function
• Efficient quantum algorithm for identifying hidden polynomials
• Quantum mechanical algorithm for solving quadratic residue equation
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Polynomial-time quantum algorithms for finding the linear structures of Boolean function

Cites work

• A quantum algorithm for approximating the influences of Boolean functions and its applications
• Creating very true quantum algorithms for quantum energy based computing
• 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
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 799789 (Why is no real title available?)
• New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
• Quantum algorithms revisited
• Quantum communication and quantum multivariate polynomial interpolation
• Quantum complexity theory
• 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 Gauss-Jordan elimination and simulation of accounting principles on quantum computers
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation

Cited in

(5)

• Efficient quantum algorithms of finding the roots of a polynomial function
• Necessary and sufficient condition for quantum computing
• Quantum computing based state domain equations and feedback control
• New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
• Quantum mechanical algorithm for solving quadratic residue equation

This page was built for publication: Quantum algorithm for the root-finding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329950)