Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/9257Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Waffa faeik keidan | - |
| dc.date.accessioned | 2023-11-16T09:21:35Z | - |
| dc.date.available | 2023-11-16T09:21:35Z | - |
| dc.date.issued | 2013-07-01 | - |
| dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/9257 | - |
| dc.description.abstract | We shall study the problem Input :A computable vectorial Boolean function That is either with mask, i.e. Output: Distinguish between the two eases, and in the second case produce S. To solve this problem exactly or with high probability, for every such f , a classical (probabilistic) computer needs to evaluate f an exponential number of times. However, this problem can be solved with high probability, by a quantum algorithm with only quantum evaluation of f . | en_US |
| dc.description.sponsorship | https://djps.uodiyala.edu.iq/pages?id=67 | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | university of Diyala | en_US |
| dc.subject | quantum algorithm, quantum computation, Hilbert space, qubit, vector, Walsh – Hadamard | en_US |
| dc.title | Quantum vectorial Boolean function Algorithm | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 120-133 E.pdf | 682.81 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.