Quantum algorithm for the root-finding problem
From MaRDI portal
Publication:2329950
DOI10.1007/s40509-018-0171-0zbMath1423.81057OpenAlexW2885150696WikidataQ62037267 ScholiaQ62037267MaRDI QIDQ2329950
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Numerical computation of roots of polynomial equations (65H04)
Related Items (2)
Quantum computing based state domain equations and feedback control ⋮ Necessary and sufficient condition for quantum computing
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces
- Quantum computation with coherent spin states and the close Hadamard problem
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm
- Creating very true quantum algorithms for quantum energy based computing
- 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
This page was built for publication: Quantum algorithm for the root-finding problem
