Skip to main content
Book Chapter

Deutsch-Jozsa Algorithm for Continuous Variables

  • Pati A
  • Braunstein S
Springer Netherlands, (2003), 31-36
DOI: 10.1007/978-94-015-1258-9_4
N/ACitations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We 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.

Cite

CITATION STYLE

APA

Pati, A. K., & Braunstein, S. L. (2003). Deutsch-Jozsa Algorithm for Continuous Variables. In Quantum Information with Continuous Variables (pp. 31–36). Springer Netherlands. https://doi.org/10.1007/978-94-015-1258-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free