Quantum teleportation is one of basis study of quantum computing algorithms mostly used in quantum communication. This algorithm has so far been implemented using a variety of quantum realization models. In this study, quantum teleportation algorithm is realized experimentally using classical LC circuits. In addition, electrical simulation of some quantum gates such as Hadamard and CNOT gates used in algorithm are also given. The importance of implementation of such quantum algorithms onto classical electrical circuit is that it is being inexpensive and can work at room temperature. This study can contribute greatly to the experimental teaching of the emerging quantum technology revolution to students.Quantum teleportation is one of basis study of quantum computing algorithms mostly used in quantum communication. This algorithm has so far been implemented using a variety of quantum realization models. In this study, quantum teleportation algorithm is realized experimentally using classical LC circuits. In addition, electrical simulation of some quantum gates such as Hadamard and CNOT gates used in algorithm are also given. The importance of implementation of such quantum algorithms onto classical electrical circuit is that it is being inexpensive and can work at room temperature. This study can contribute greatly to the experimental teaching of the emerging quantum technology revolution to students.

AIP conference proceedingsJan 1, 20241 citation

Optimization and experimental realization of the quantum permutation algorithm

İ. Yalçınkaya, Z. Gedik

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its $n$ -qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$ -qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.

arXiv:1708.07900Physical Review ADec 29, 201730 citations

Experimental Aspects of Quantum Computing

Henry O. Everitt

Springer eBooksJan 1, 200538 citations

Experimental Realization of Arbitrary Accuracy Iterative Phase Estimation Algorithms on Ensemble Quantum Computers

Liu Xiu-Mei, Luo Jun, Xianping Sun

We report the first experimental demonstration of a nuclear magnetic resonance (NMR) realization of iterative phase estimation algorithms. Using feedback and iterations, we experimentally obtain the phase with 6 bits of precision on a two-qubit NMR quantum computer. Furthermore, we experimentally demonstrate the effect of gate noise on the iterative phase estimation algorithm. Our experimental results show that errors of measurements of the phase depend strongly on the precision of coupling gates. This experiment can be used as a benchmark for multi-qubit realizations of quantum information processing and precision measurements.We report the first experimental demonstration of a nuclear magnetic resonance (NMR) realization of iterative phase estimation algorithms. Using feedback and iterations, we experimentally obtain the phase with 6 bits of precision on a two-qubit NMR quantum computer. Furthermore, we experimentally demonstrate the effect of gate noise on the iterative phase estimation algorithm. Our experimental results show that errors of measurements of the phase depend strongly on the precision of coupling gates. This experiment can be used as a benchmark for multi-qubit realizations of quantum information processing and precision measurements.

Chinese Physics LettersDec 1, 200717 citations

Computer-inspired quantum experiments

Mario Krenn, Manuel Erhard, Anton Zeilinger

arXiv:2002.09970Nature Reviews PhysicsSep 29, 202090 citations

The quantum permutation algorithm provides computational speed-up over classical algorithms for determining the parity of a given cyclic permutation. For its

n

-qubit implementations, the number of required quantum gates scales quadratically with

n

due to the quantum Fourier transforms included. We show here for the

n

-qubit case that the algorithm can be simplified so that it requires only

O(n)

quantum gates, which theoretically reduces the complexity of the implementation. To test our results experimentally, we utilize IBM's 5-qubit quantum processor to realize the algorithm by using the original and simplified recipes for the 2-qubit case. It turns out that the latter results in a significantly higher success probability which allows us to verify the algorithm more precisely than the previous experimental realizations. We also verify the algorithm for the first time for the 3-qubit case with a considerable success probability by taking the advantage of our simplified scheme.