Kaydedildi:
Detaylı Bibliyografya
Yazar: Fan, Yale
Materyal Türü: Preprint
Baskı/Yayın Bilgisi: 2008
Konular:
Online Erişim:https://arxiv.org/abs/0809.0932
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
_version_ 1866929716051574784
author Fan, Yale
author_facet Fan, Yale
contents This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine logical functions in quantum oracles, accurate to a constant term. Furthermore, our multi-valued extension of the Grover algorithm for quantum database search requires fewer qudits and hence a substantially smaller memory register, as well as fewer wasted information states, to implement. We note several applications of these algorithms and their advantages over the binary cases.
format Preprint
id arxiv_https___arxiv_org_abs_0809_0932
institution arXiv
publishDate 2008
record_format arxiv
spellingShingle Applications of Multi-Valued Quantum Algorithms
Fan, Yale
Quantum Physics
This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine logical functions in quantum oracles, accurate to a constant term. Furthermore, our multi-valued extension of the Grover algorithm for quantum database search requires fewer qudits and hence a substantially smaller memory register, as well as fewer wasted information states, to implement. We note several applications of these algorithms and their advantages over the binary cases.
title Applications of Multi-Valued Quantum Algorithms
topic Quantum Physics
url https://arxiv.org/abs/0809.0932