ﻻ يوجد ملخص باللغة العربية
We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by manipulating quantum two--level systems, qubits. We show that this gain, already known to be optimal, is preserved, irrespectively of the dimension of the system used to encode quantum information. This is shown by adapting the protocol to Hilbert spaces of any dimension using the same sequence of operations/logical gates as its original qubit formulation. Our results are detailed and illustrated for a system described by continuous variables, where qubits can be encoded in infinitely many distinct states using the modular variable formalism.
We introduce a novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing quantum inform
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal operations. The
Integrated quantum photonics provides a scalable platform for the generation, manipulation, and detection of optical quantum states by confining light inside miniaturized waveguide circuits. Here we show the generation, manipulation, and interferomet
We investigate the properties of an atmospheric channel for free space quantum communication with continuous polarization variables. In our prepare-and-measure setup, coherent polarization states are transmitted through an atmospheric quantum channel
We present a new hybrid, local search algorithm for quantum approximate optimization of constrained combinatorial optimization problems. We focus on the Maximum Independent Set problem and demonstrate the ability of quantum local search to solve larg