| Literature DB >> 30167159 |
Mario Arnolfo Ciampini1, Adeline Orieux1, Stefano Paesani1, Fabio Sciarrino1, Giacomo Corrielli2,3, Andrea Crespi2,3, Roberta Ramponi2,3, Roberto Osellame2,3, Paolo Mataloni1.
Abstract
Encoding many qubits in different degrees of freedom (DOFs) of single photons is one of the routes toward enlarging the Hilbert space spanned by a photonic quantum state. Hyperentangled photon states (that is, states showing entanglement in multiple DOFs) have demonstrated significant implications for both fundamental physics tests and quantum communication and computation. Increasing the number of qubits of photonic experiments requires miniaturization and integration of the basic elements, and functions to guarantee the setup stability, which motivates the development of technologies allowing the precise control of different photonic DOFs on a chip. We demonstrate the contextual use of path and polarization qubits propagating within an integrated quantum circuit. We tested the properties of four-qubit linear cluster states built on both DOFs, and we exploited them to perform the Grover's search algorithm according to the one-way quantum computation model. Our results pave the way toward the full integration on a chip of hybrid multi-qubit multiphoton states.Entities:
Keywords: hyperentanglement; integrated photonics; quantum information; quantum optics
Year: 2016 PMID: 30167159 PMCID: PMC6059950 DOI: 10.1038/lsa.2016.64
Source DB: PubMed Journal: Light Sci Appl ISSN: 2047-7538 Impact factor: 17.782
Figure 1Experimental setup. The state is generated by the hyperentangled source in the blue area. The four-hole screen in (a) selects the spatial modes , rA and rB. In the green area, the four modes are independently addressed using half-mirrors, half-waveplates and half-lenses to compensate their polarization and to couple them into the fiber array. A translation stage is used to control the path indistinguishability between left and right modes. A glass plate in mode is used to control the path phase. The chip is connected to the fiber array using a 6-axis stage (NanoMax, Thorlabs Inc., Newton, NJ, USA). In the orange area, measurements are performed: two of the outputs of the chip are addressed into multi-mode fibers connected to SPADs in coincidence mode. Polarization analysis is performed using QWP, HWP and PBS. (b) Schematic representation of the integrated device. (c) Hong-Ou-Mandel (HOM) dip of BSA and BSB. BBO, beta barium borate; BS, beam splitter; HWP, half waveplate; MMF, multi-mode fiber; PBS, polarising beam splitter; QWP, quarter waveplate; SMF, single-mode fiber; SPAD, single-photon avalanche diode.
Figure 2Chip mount assembly. GRIN, gradient index.
Figure 3HE state interference. Interference pattern between modes and when varying both θ and φ. Peaks and dips derive from the symmetry of the entire HE wave function. Experimental data of each curve are fitted with the convolution of a Gaussian with a sinc function; error bars are derived from the Poisson statistical distribution of counts. Errors on the peak/dip visibilities are estimated using a Monte Carlo statistical analysis of the experimental data.
Figure 4Cluster state. (a) Graphical representation of four-qubit hyperentangled and cluster states. (b) Real part of the two-qubit polarization tomography of pair of the cluster state, which is compensated to be a state. (c) Real part of the two-qubit polarization tomography of pair of the cluster state, compensated to be a state. The imaginary parts of the two tomographies are negligible.
Measured outcomes of the stabilizer used for calculating the genuine multipartite entanglement witness W
| +0.940±0.028 | |
| −0.860±0.030 | |
| +0.860±0.030 | |
| −0.990±0.007 | |
| +0.809±0.036 | |
| +0.808±0.035 |
Figure 5Grover's algorithm scheme. (a) Quantum circuit for Grover's algorithm. The black box tags the item through the measurements of qubits 1 and 4. The information is then encoded and processed in qubits 2 and 3 of the cluster state . The single-qubit operations are implemented by the choice of the measurement basis. (b) Outcome probability for different tagged items for the probabilistic Grover's algorithm. The average success rate of the algorithm is s=(0.960±0.007).