© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais

Simulação da Transformada Quântica de Fourier

Francisco Pereira, Elloá B. Guedes, Francisco de Assis

Published Jan 1, 2013• 0 citations

Abstract

The quantum Fourier Transform is an important algorithm in Quantum Information Theory due to its capabilities to solve some Quantum Computation and Communication problems.However, so far, no practical quantum computer has been build neither its simulation is efficient on classical computers.Given these difficulties, this paper presents a software able to simulate the quantum Fourier transform -called FTSimulatorand also an analysis of its time performance.

DOI: 10.14209/sbrt.2013.211

Related papers

Simulating the Quantum Fourier Transform

Francisco Revson F. Pereira, Elloá B. Guedes, Francisco de Assis

Quantum Computing is a computational paradigm that takes into account the laws of Quantum Physics in the steps of the computation which advantages were verified both in Computation and Communications. No scalable quantum computer was developed so far and to execute, to test, and to create new quantum algorithms the simulation of quantum computers on classical computers plays an important role. In this work, we show the design, tools and results obtained for the simulation of the Quantum Fourier Transform algorithm. As a result, we developed an open-source tool, called FTSimulator, and we could simulate up to 12 qubits according to the procedures specified by an experimental test.

Workshop-School on Theoretical Computer Science•Oct 1, 2013•3 citations

SIMULAÇÃO DA TRANSFORMADA QUÂNTICA DE FOURIER COM O SIMULADOR ZENO

José Filipe Lima, Rodrigo Soares Semente

A computação quântica vem sendo amplamente estudada ao longo dos últimos anos. A mesma vem mostrando-se uma tecnologia bastante promissora para o desenvolvimento da computação. Este trabalho tem como objetivo falar sobre os conceitos envolvidos para a realização da computação quântica. Para tal, foi realizada uma revisão da literatura existente sobre o tema afim de se obter o conhecimento desenvolvido sobre o mesmo até o momento. Fala-se sobre os q-bits, que é a unidade fundamental de informação da computação quântica, e suas propriedades. Em seguida são apresentadas algumas das portas lógicas quânticas que são fundamentais para a realização da computação. É apresentada uma breve introdução sobre a Transformada Quântica de Fourier (TQF) e sua forma de cálculo para um vetor ket. É apresentado o simulador de circuitos quânticos Zeno e a simulação do algoritmo da DFT, bem como possibilidade implementação de outros algoritmos no mesmo.

Anais do Encontro de Computação do Oeste Potiguar ECOP/UFERSA•May 29, 2018•0 citations

The Study of Simulation Technique of Quantum Compute and Quantum Fourier Transform

Jiajia Wang, Hanwu Chen, Zhiqiang Li

For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.

International Conference on Computer Supported Cooperative Work in Design (CSCWD)•Apr 1, 2007•3 citations

Implementation of Period-Finding Algorithm by Means of Simulating Quantum Fourier Transform

Moghareh Abed Zohreh, Mohsen Ashorian, Kiumars Ghowsi

In this paper, we introduce quantum fourier transform as a key ingredient for many useful algorithms. These algorithms make a solution for problems which is considered to be intractable problems on a classical computer. Quantum Fourier transform is propounded as a key for quantum phase estimation algorithm. In this paper our aim is the implementation of period-finding algorithm.Quantum computer solves this problem, exponentially faster than classical one. Quantum phase estimation algorithm is the key for the period-finding problem .Therefore, by means of simulating quantum Fourier transform, we are able to implement the period-finding algorithm. In this paper, the simulation of quantum Fourier transform is carried out by Matlab software.

•Jan 1, 2010•0 citations

Hardware emulation of Quantum Fourier Transform

Jose F. Rivera-Miranda, Alvaro J. Caicedo-Beltran, Juan D. Valencia-Payan +2 more

The Quantum Fourier Transform (QFT) has an important role in some of the most interesting and useful quantum algorithms, such as those for period finding, order finding, phase estimation and factoring. Most of the research carried out on the QFT has been developed using software simulators, however these do not emulate efficiently the quantum parallelism present in the quantum algorithms. Addressing this problem, this paper presents the hardware design of an emulator for computing the QFT using FPGAs. This emulator was designed considering a modular philosophy and it is expected to be a powerful tool to evaluate quantum algorithms that include a many-qubit QFT.

IEEE Latin American Symposium on Circuits and Systems (LASCAS)•Feb 1, 2011•9 citations

A decomposition of quantum Fourier transformation

Cao Huai-xin

Quantum Fourier Transform(QFT) is an important algorithm in quantum computation.Quantum computer can solve the problem using QFT and Quantum Searching Algorithm,which problem need too much resource in classical computer. In this paper,the factorization of QFT is presented and proved so as to it can be well-understanded and used.

Basic Sciences Journal of Textile Universities•Jan 1, 2007•0 citations

The quantum Fourier Transform is an important algorithm in Quantum Information Theory due to its capabilities to solve some Quantum Computation and Communication problems.However, so far, no practical quantum computer has been build neither its simulation is efficient on classical computers.Given these difficulties, this paper presents a software able to simulate the quantum Fourier transform -called FTSimulatorand also an analysis of its time performance.

Quantum Computing is a computational paradigm that takes into account the laws of Quantum Physics in the steps of the computation which advantages were verified both in Computation and Communications. No scalable quantum computer was developed so far and to execute, to test, and to create new quantum algorithms the simulation of quantum computers on classical computers plays an important role. In this work, we show the design, tools and results obtained for the simulation of the Quantum Fourier Transform algorithm. As a result, we developed an open-source tool, called FTSimulator, and we could simulate up to 12 qubits according to the procedures specified by an experimental test.

A computação quântica vem sendo amplamente estudada ao longo dos últimos anos. A mesma vem mostrando-se uma tecnologia bastante promissora para o desenvolvimento da computação. Este trabalho tem como objetivo falar sobre os conceitos envolvidos para a realização da computação quântica. Para tal, foi realizada uma revisão da literatura existente sobre o tema afim de se obter o conhecimento desenvolvido sobre o mesmo até o momento. Fala-se sobre os q-bits, que é a unidade fundamental de informação da computação quântica, e suas propriedades. Em seguida são apresentadas algumas das portas lógicas quânticas que são fundamentais para a realização da computação. É apresentada uma breve introdução sobre a Transformada Quântica de Fourier (TQF) e sua forma de cálculo para um vetor ket. É apresentado o simulador de circuitos quânticos Zeno e a simulação do algoritmo da DFT, bem como possibilidade implementação de outros algoritmos no mesmo.

For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.

In this paper, we introduce quantum fourier transform as a key ingredient for many useful algorithms. These algorithms make a solution for problems which is considered to be intractable problems on a classical computer. Quantum Fourier transform is propounded as a key for quantum phase estimation algorithm. In this paper our aim is the implementation of period-finding algorithm.Quantum computer solves this problem, exponentially faster than classical one. Quantum phase estimation algorithm is the key for the period-finding problem .Therefore, by means of simulating quantum Fourier transform, we are able to implement the period-finding algorithm. In this paper, the simulation of quantum Fourier transform is carried out by Matlab software.

The Quantum Fourier Transform (QFT) has an important role in some of the most interesting and useful quantum algorithms, such as those for period finding, order finding, phase estimation and factoring. Most of the research carried out on the QFT has been developed using software simulators, however these do not emulate efficiently the quantum parallelism present in the quantum algorithms. Addressing this problem, this paper presents the hardware design of an emulator for computing the QFT using FPGAs. This emulator was designed considering a modular philosophy and it is expected to be a powerful tool to evaluate quantum algorithms that include a many-qubit QFT.