arXiv:1501.06798 · Scientific Reports

Demonstration of quantum permutation algorithm with a single photon ququart

Feiran Wang, Yunlong Wang, Ruifeng Liu, Dong‐Xu Chen, Pei Zhang, Hong Gao, Fuli Li

Published Jun 5, 2015• 13 citations

Abstract

We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon's polarization and spatial mode, we realize the quantum ququart states and all the essential permutation transformations. The quantum permutation determining algorithm displays the speedup of quantum algorithm by determining the parity of the permutation in only one step of evaluation compared with two for classical algorithm. This experiment is accomplished in single photon level and the method exhibits universality in high-dimensional quantum computation.

DOI: 10.1038/srep10995

Related papers

Demonstration of quantum permutation algorithm with a single photon ququart

Pei Zhang, Feiran Wang, Yunlong Wang +2 more

We report an experiment to demonstrate a quantum permutation determining algorithm by employing photon polarization and spatial modes. This work displays the remarkable speedup of quantum algorithm and strong universality in quantum computation.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)Aug 1, 20151 citation

Implementation of quantum permutation algorithm with classical light

Shihao Zhang, Pengyun Li, Bo Wang +2 more

We report the experimental implementation of quantum permutation algorithm using polarization and orbital angular momentum of the classical optical beam. The easy-handling optical setup to realize all eight cyclic permutation transformations for an input four-dimensional system has been constructed. The two-to-one speed-up ratio to determine the parity of each permutation has been demonstrated. Moreover, we have theoretically discussed the extension to the case with eight elements, and the limitations on the generalization of our proposal to higher-dimensional cases. Our scheme exhibits outstanding stability and demonstrates that optical quantum computation is possible using classical states of light.

Journal of Physics CommunicationsJan 4, 20197 citations

Demonstration of quantum permutation parity determine algorithm in a superconducting qutrit

Kunzhe Dai, Peng Zhao, Mengmeng Li +3 more

A quantum algorithm provides a new way in solving certain computing problems and usually faster than classical algorithms. Here we report an implementation of a quantum algorithm to determine the parity of permutation in a single three-dimensional (3D) superconducting transmon qutrit system. The experiment shows the capacity to speed up in a qutrit, which can also be extended to a multi-level system for solving high-dimensional permutation parity determination problem.

Chinese Physics BJun 1, 20187 citations

Realization of quantum permutation algorithm in high dimensional Hilbert space

Dong‐Xu Chen, Ruifeng Liu, Pei Zhang +4 more

Quantum algorithms provide a more efficient way to solve computational tasks than classical algorithms. We experimentally realize quantum permutation algorithm using light's orbital angular momentum degree of freedom. By exploiting the spatial mode of photons, our scheme provides a more elegant way to understand the principle of quantum permutation algorithm and shows that the high dimension characteristic of light's orbital angular momentum may be useful in quantum algorithms. Our scheme can be extended to higher dimension by introducing more spatial modes and it paves the way to trace the source of quantum speedup.

Chinese Physics BJun 1, 201713 citations

Experimental demonstration of a three-qubit quantum computation algorithm using a single photon and linear optics

Shigeki Takeuchi

A quantum computer that gives us the result of a single quantum computation has been constructed. The quantum register was realized by modes and polarization of photons, and the unitary transformation was implemented with linear optics. For each quantum computation, the answer to the Deutsch Jozsa problem for any four-bit digit is given by a single-photon detection signal with a small error rate of less than 4%.

Physical Review AAug 3, 200055 citations

Computational speed-up with a single qudit

Z. Gedik, I. A. Silva, Barış Çakmak +5 more

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given permutation is even or odd, requires evaluation of the function for at least two elements. We demonstrate that a quantum circuit with a single qudit can determine the parity of the permutation with only one evaluation of the function. Our algorithm provides an example for quantum computation without entanglement since it makes use of the pure state of a qudit. We also present an experimental realization of the proposed quantum algorithm with a quadrupolar nuclear magnetic resonance using a single four-level quantum system, i.e., a ququart.

Oct 8, 201531 citations