Quantum searching with continuous variables

Abstract

A fast quantum search algorithm for continuous variables is presented. The result is the quantum continuous variable analog of Grover's algorithm originally proposed for qubits. A continuous variable analog of the Hadamard (i.e., Fourier transform) operation is used in conjunction with inversion about the average of quantum states to allow the approximate identification of an unknown quantum state in a way that gives a square-root speed-up over search algorithms using classical continuous variables. Also, we show that this quantum search algorithm is robust for a generalised Fourier transformation on continuous variables.

4 pages, few changes

Cited by in corpus (12)

• Gaussian Quantum Information
• Entanglement Swapping of Generalized Cat States and Secret Sharing
• Quantum key distribution for d-level systems with generalized Bell states
• The Hidden Subgroup Problem - Review and Open Problems
• Quantum Imaginary Time Evolution Algorithm for Quantum Field Theories with Continuous Variables
• Exact gate decompositions for photonic quantum computing
• Implementing quantum algorithms on temporal photonic cluster states
• Quantum Computation of Scattering Amplitudes in Scalar Quantum Electrodynamics
• Towards Large-Scale Quantum Computation
• Countinuous Quantum Hidden Subgroup Algorithms
• Continuous Variable Quantum Algorithms: an Introduction
• Universal Continuous Variable Quantum Computation in the Micromaser