Generalization of the Deutsch algorithm using two qudits
| dc.creator | Cereceda, Jose L. | |
| dc.date | 2004-07-29 | |
| dc.date | 2004-09-13 | |
| dc.date.accessioned | 2026-07-07T06:10:28Z | |
| dc.date.available | 2026-07-07T06:10:28Z | |
| dc.description | Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain oracle function by just one query, instead of the $2^{n-1}+1$ queries required by classical means. The given algorithm for two qudits also solves efficiently the Bernstein-Vazirani problem. Entanglement does not occur at any step of the computation. | |
| dc.description | LaTeX file, 7 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0407253 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0407253 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92267 | |
| dc.subject | Quantum Physics | |
| dc.title | Generalization of the Deutsch algorithm using two qudits | |
| dc.type | text |