Efficient protocol of $$N$$N-bit discrete quantum Fourier transform via transmon qubits coupled to a resonator

Authors:
A. -S. Obada;H. A. Hessian;A. -B. Mohamed;Ali H. Homid
Affiliations:
Faculty of Science, Al-Azhar University, Cairo, Egypt 11884;Faculty of Science, Assiut University, Assiut, Egypt 71516;Faculty of Science, Assiut University, Assiut, Egypt 71516;Faculty of Science, Al-Azhar University, Assiut, Egypt 71524
Venue:
Quantum Information Processing
Year:
2014

Citing 5
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the Power of Quantum Computation

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum computation and quantum information

Quantum computation and quantum information
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the one- and two-qubit gates defined and generated via superconducting transmon qubits homogeneously coupled to a superconducting stripline resonator, we present a new physical protocol for implementing an $$N$$N-bit discrete quantum Fourier transform. We propose and illustrate a detailed experimental feasibility for realizing the algorithm. The average fidelity is computed to prove the success of this algorithm. Estimated time for implementing the protocol using the proposed scheme is compared with previous schemes. Estimates show that the protocol can be successfully implemented within the present experimental limits.