Deutsch-Jozsa algorithm for continuous variables

Simple item page
dc.creatorPati, Arun K.
dc.creatorBraunstein, Samuel L.
dc.date2002-07-18
dc.date.accessioned2026-07-07T06:04:37Z
dc.date.available2026-07-07T06:04:37Z
dc.descriptionWe present an idealized quantum continuous variable analog of the Deutsch-Jozsa algorithm which can be implemented on a perfect continuous variable quantum computer. Using the Fourier transformation and XOR gate appropriate for continuous spectra we show that under ideal operation to infinite precision that there is an infinite reduction in number of query calls in this scheme.
dc.descriptionLatex file, 3 pages To appear in "Quantum Inoformation with Continuous Variables" Edited by S. L. Braunstein and A. K. Pati, Kluwer Academic Publisher, 2002
dc.identifierhttps://arxiv.org/abs/quant-ph/0207108
dc.identifierhttp://arxiv.org/abs/quant-ph/0207108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90361
dc.subjectQuantum Physics
dc.titleDeutsch-Jozsa algorithm for continuous variables
dc.typetext

Files

Collections

arXiv