scholarly journals Quantum Fourier Transform Is the Building Block for Creating Entanglement

2021 ◽  
Author(s):  
Mario Mastriani
Keyword(s):  
Spectral Analysis ◽  
Fourier Transform ◽  
Quantum Computing ◽  
Building Block ◽  
Quantum Communication ◽  
Fault Tolerant ◽  
Quantum Fourier Transform ◽  
The Future ◽  
Quantum Internet

Abstract This study demonstrates entanglement can be exclusively constituted by quantum Fourier transform (QFT) blocks. A bridge between entanglement and QFT will allow incorporating a spectral analysis to the already traditional temporal approach of entanglement, which will result in the development of new more performant, and fault-tolerant protocols to be used in quantum computing as well as quantum communication, with particular emphasis in the future quantum Internet.

scholarly journals Quantum Fourier transform is the building block for creating entanglement

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Mario Mastriani
Keyword(s):  
Spectral Analysis ◽  
Fourier Transform ◽  
Quantum Computing ◽  
Building Block ◽  
Quantum Communication ◽  
Fault Tolerant ◽  
Quantum Fourier Transform ◽  
The Future ◽  
Quantum Internet

AbstractThis study demonstrates entanglement can be exclusively constituted by quantum Fourier transform (QFT) blocks. A bridge between entanglement and QFT will allow incorporating a spectral analysis to the already traditional temporal approach of entanglement, which will result in the development of new more performant, and fault-tolerant protocols to be used in quantum computing as well as quantum communication, with particular emphasis in the future quantum Internet.

scholarly journals Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming

2006 ◽  
Vol 14 (1) ◽  
pp. 21-40 ◽  
Author(s):  
Paul Massey ◽  
John A. Clark ◽  
Susan Stepney
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Genetic Programming ◽  
Quantum Algorithms ◽  
Quantum Circuits ◽  
Quantum Fourier Transform ◽  
Competitive Evolution ◽  
Specific Quantum

We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then quantum programs, and finally system-independent quantum algorithms. We conclude the paper by presenting a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.

scholarly journals QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS

2013 ◽  
Vol 11 (01) ◽  
pp. 1350008
Author(s):  
CHEN-FU CHIANG
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Diophantine Approximation ◽  
Great Difficulty ◽  
Quantum Computers ◽  
Phase Estimation ◽  
Quantum Fourier Transform ◽  
Factorization Algorithm ◽  
Simultaneous Diophantine Approximation ◽  
Parallel Circuits

Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose we have additional k qubits available. Given such a constraint k, we propose an approach for the phase estimation for an eigenphase of exactly n-bit precision. This approach adopts the standard recursive circuit for quantum Fourier transform (QFT) in [R. Cleve and J. Watrous, Fast parallel circuits for quantum fourier transform, Proc. 41st Annual Symp. on Foundations of Computer Science (2000), pp. 526–536.] and adopts classical bits to implement such a task. Our algorithm has the complexity of O(n log k), instead of O(n2) in the conventional QFT, in terms of the total invocation of rotation gates. We also design a scheme to implement the factorization algorithm by using k available qubits via either the continued fractions approach or the simultaneous Diophantine approximation.

Quantum Computing II

2020 ◽  
pp. 245-262
Author(s):  
M. Suhail Zubairy
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Entanglement ◽  
Arbitrary Number ◽  
Quantum Fourier Transform ◽  
Grover’S Algorithm ◽  
Computing Algorithm ◽  
Shor's Algorithm ◽  
Grover's Algorithm

This chapter deals with some of the most prominent successes of quantum computing. The most well-known quantum computing algorithm, Shor’s algorithm for factoring a number in its prime factors, is discussed in details. The key to Shor’s algorithm is the quantum Fourier transform that is explained with the help of simple examples. The role of quantum entanglement is also discussed. The next important quantum computing algorithm is Grover’s algorithm that helps in searching an item in an unsorted database. This algorithm is motivated by first discussing a quantum shell game in which a pea hidden under one of the four shells is found in one measurement with certainty each time. This amazing result is then generalized to an arbitrary number of objects and Grover’s algorithm.

scholarly journals Quantum Fourier transform to estimate drive cycles

2022 ◽  
Vol 12 (1) ◽  
Author(s):  
Vinayak Dixit ◽  
Sisi Jian
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computer ◽  
Quantum Fourier Transform ◽  
Real World Data ◽  
Drive Cycle ◽  
Cycle Frequency ◽  
Data Set ◽  
Simple Method ◽  
The Impact

AbstractDrive cycles in vehicle systems are important determinants for energy consumption, emissions, and safety. Estimating the frequency of the drive cycle quickly is important for control applications related to fuel efficiency, emission reduction and improving safety. Quantum computing has established the computational efficiency that can be gained. A drive cycle frequency estimation algorithm based on the quantum Fourier transform is exponentially faster than the classical Fourier transform. The algorithm is applied on real world data set. We evaluate the method using a quantum computing simulator, demonstrating remarkable consistency with the results from the classical Fourier transform. Current quantum computers are noisy, a simple method is proposed to mitigate the impact of the noise. The method is evaluated on a 15 qubit IBM-q quantum computer. The proposed method for a noisy quantum computer is still faster than the classical Fourier transform.

scholarly journals Magic state distillation with the ternary Golay code

2020 ◽  
Vol 476 (2241) ◽  
pp. 20200187 ◽  
Author(s):  
Shiroman Prakash
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Fault Tolerant ◽  
Error Correcting Code ◽  
Error Correcting Codes ◽  
High Threshold ◽  
Golay Code ◽  
Quadratic Error ◽  
Quantum Error ◽  
Error Suppression

The ternary Golay code—one of the first and most beautiful classical error-correcting codes discovered—naturally gives rise to an 11-qutrit quantum error correcting code. We apply this code to magic state distillation, a leading approach to fault-tolerant quantum computing. We find that the 11-qutrit Golay code can distil the ‘most magic’ qutrit state—an eigenstate of the qutrit Fourier transform known as the strange state —with cubic error suppression and a remarkably high threshold. It also distils the ‘second-most magic’ qutrit state, the Norell state, with quadratic error suppression and an equally high threshold to depolarizing noise.

scholarly journals Quantum Computing Concepts with Deutsch Jozsa Algorithm

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Poornima Aradyamath ◽  
Naghabhushana N M ◽  
Rohitha Ujjinimatad
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Mathematical Description ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Quantum Fourier Transform ◽  
Basic Concepts ◽  
Classical Computer

In this paper, we briefly review the basic concepts of quantum computation,  entanglement,  quantum cryptography and quantum fourier  transform.   Quantum algorithms like Deutsch Jozsa, Shor’s   factorization and Grover’s data search are developed using fourier  transform  and quantum computation concepts to build quantum computers.  Researchers are finding a way to build quantum computer that works more efficiently than classical computer.  Among the  standard well known  algorithms  in the field of quantum computation  and communication we  describe  mathematically Deutsch Jozsa algorithm  in detail for  2  and 3 qubits.  Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

scholarly journals One Green Quantum Computing Tablet Per Child

2019 ◽  
Author(s):  
Anil Kumar Bheemaiah
Keyword(s):  
Quantum Computing ◽  
Operating Systems ◽  
Fault Tolerant ◽  
Organic Polymer ◽  
Mathematical Truth ◽  
Last Mile ◽  
E Learning ◽  
The One ◽  
New Age Religion ◽  
Quantum Internet

Abstract:A Paper on the design for the One Quantum Tablet Per Child, the new E-Paper in Graphene and organic polymer on PLA substrate, with a Quantum Ising Glass architecture with spin wave based STT, Quantum Internet for last mile connectivity and a distributed QPU-GPU-MCU architecture for robust scalable fault tolerant computing.Keywords: Graphene, OLED, MCU-QPU-GPU, integration, E-Paper, Quantum Cloud, Quantum Operating systems, E-Learning, Quantum Tablet, Mathematical Truth, Light as New Age Religion.

scholarly journals Quantum Fourier Transform to Estimate Drive Cycles

2021 ◽  
Author(s):  
Vinayak Dixit ◽  
Sisi Jian
Keyword(s):  
Fourier Transform ◽  
Quantum Computing ◽  
Quantum Computer ◽  
Quantum Fourier Transform ◽  
Real World Data ◽  
Drive Cycle ◽  
Cycle Frequency ◽  
Data Set ◽  
Simple Method ◽  
The Impact

Abstract Drive cycles in vehicle systems are important determinants for energy consumption, emissions, and safety. Estimating the frequency of the drive cycle quickly is important for control applications related to fuel efficiency, emission reduction and improving safety. Quantum computing has established the computational efficiency that can be gained. A drive cycle frequency estimation algorithm based on the quantum Fourier transform is exponentially faster than the classical Fourier transform. The algorithm is applied on real world data set. We evaluate the method using a quantum computing simulator, demonstrating remarkable consistency with the results from the classical Fourier Transform. Current quantum computers are noisy, a simple method is proposed to mitigate the impact of the noise. The method is evaluated on a 15 qbit IBM-q quantum computer. The proposed method for a noisy quantum computer is still faster than the classical Fourier transform.

Sign in / Sign up

Export Citation Format

Share Document