Computing Boolean Functions via Quantum Hashing (Q2944885): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62045227, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computing Boolean Functions via Quantum Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of probabilistic and quantum branching program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of characteristic polynomials of Boolean functions and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computational networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic verification of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Small Sets that are Uniform in Arithmetic Progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum branching programs and space-bounded nonuniform quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Revision as of 17:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Computing Boolean Functions via Quantum Hashing
scientific article

    Statements

    Identifiers