Necessary and sufficient condition for quantum computing (Q1740946): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62037273, #quickstatements; #temporary_batch_1710970253704
ReferenceBot (talk | contribs)
Changed an Item
 
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: Creating very true quantum algorithms for quantum energy based computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient quantum algorithm for the parity problem of a certain function / 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: Efficient quantum algorithms of finding the roots of a polynomial function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithm for the root-finding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank

Latest revision as of 03:58, 19 July 2024

scientific article
Language Label Description Also known as
English
Necessary and sufficient condition for quantum computing
scientific article

    Statements

    Necessary and sufficient condition for quantum computing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2019
    0 references
    0 references
    quantum algorithms
    0 references
    quantum computation
    0 references
    0 references
    0 references