Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 7 users not shown)
Property / author
 
Property / author: Josep Batle / rank
Normal rank
 
Property / author
 
Property / author: Josep Batle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10773-018-3776-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2803676763 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62037277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5847989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5340540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory: concepts and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantum algorithm for approximating the influences of Boolean functions and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computation with coherent spin states and the close Hadamard problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography, quantum communication, and quantum computer in a noisy environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography based on the Deutsch-Jozsa algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and quantum multivariate polynomial interpolation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:17, 17 July 2024

scientific article
Language Label Description Also known as
English
Efficient quantum algorithms of finding the roots of a polynomial function
scientific article

    Statements

    Efficient quantum algorithms of finding the roots of a polynomial function (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computation
    0 references
    quantum algorithms
    0 references
    0 references
    0 references