Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0409122

Quantum Fourier Transform in a Decoherence-Free Subspace

Jianwu Wu, Chunwen Li, Re-Bing Wu

Published Sep 19, 2004• 1 citation
arXivHTMLPDF

Abstract

Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for quantum Fourier transform over the intrinsic decoherence-free subspaces. The scheme is then applied to the circuit design of quantum Fourier transform over quantum networks under collective decoherence. The encoding efficiency and possible improvements are also discussed.

DOI
10.48550/arxiv.quant-ph/0409122

Related papers

Efficient scheme for optimizing quantum fourier circuits

Min Jiang, Zengke Zhang, Tzyh‐Jong Tarn

In quantum circuits, importing of additional qubits can reduce the operation time and prevent decoherence induced by the environment. However, excessive qubits may make the quantum system vulnerable. This paper describes how to relax existing qubits without additional qubits to significantly reduce the operation time of the quantum Fourier circuit compared to a circuit without optimization. The results indicate that this scheme makes full use of the qubits relaxation. The concepts can be applied to improve similar quantum circuits and guide the physical implementations of quantum algorithms or devices.

Tsinghua Science & Technology•Jan 28, 2008•2 citations

Efficient schemes for reducing imperfect collective decoherences

Won-Young Hwang, Hyukjae Lee, Doyeol Ahn +1 more

We propose schemes that are efficient when each pair of qubits undergoes some imperfect collective decoherence with different baths. In the proposed scheme, each pair of qubits is first encoded in a decoherence-free subspace composed of two qubits. Leakage out of the encoding space generated by the imperfection is reduced by the quantum Zeno effect. Phase errors in the encoded bits generated by the imperfection are reduced by concatenation of the decoherence-free subspace with either a three-qubit quantum error correcting code that corrects only phase errors or a two-qubit quantum error detecting code that detects only phase errors connected with the quantum Zeno effect again.

arXiv:quant-ph/0008050•Physical Review A•Nov 1, 2000•20 citations

Approximate quantum Fourier transform and decoherence

Adriano Barenco, ARTUR K. EKERT, Kalle‐Antti Suominen +1 more

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyze quantum networks performing AQFT in the presence of decoherence and show that extensive approximations can be made before the accuracy of AQFT (as compared with regular quantum Fourier transform) is compromised. We show that for some computations an approximation may imply a better performance. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9601018•Physical Review A•Jul 1, 1996•180 citations

Quantum‐Inspired Fourier Transforms Based on Circuits

Hanxu Zhang, Yifan Sun, Xiangdong Zhang

Fourier transform (FT) is ubiquitous in modern society due to their broad applications in many branches of science and engineering. Improving the speed of FT is a common interest in the fields of signal processing. The quantum FT is generally believed to be superior to classical algorithms, but it requires a special quantum environment to perform, which has not yet been widely used. Inspired by quantum FT, here a new FT scheme is demonstrated based on circuits. In the circuit scheme, a new type of classical correlation, which its mathematical form corresponds to those of quantum entanglement, has been constructed. The calculation speed using the designed circuit scheme is equivalent to those based on the quantum FT algorithms, which is faster than those based on the classical fast FT algorithms. Furthermore, some basic gates have been designed and experimentally fabricated using classical circuit networks, which can emulate the functions of quantum gates. Fast calculation efficiencies for the FT based on the designed classical circuit networks have been demonstrated. Extensive applications of the FT scheme in the signal processing are anticipated.

Advanced Science•Aug 21, 2025•1 citation

Quantum Fourier Transform Circuit Simulator

Víctor H. Téllez, Antonio Campero, Cristina Iuga +2 more

Quantum Fourier transform is of primary importance in many quantum algorithms. This paper presents the development of a Quantum Fourier Transform Circuit Simulator system that processes classical analog signals and presents the results of the processing data. The data is acquired by an analog to digital classical converter, on a classical computer. The data stored is processed by computer using an algorithm that executes a Quantum Fast Fourier Transform (QFT).

•Jun 1, 2008•1 citation

Implementation of Quantum Fourier Transform and Its Applications via Quantum-Dot Spins and Microcavity

Dong Ping, Zheng Xiao-Hu, Zhang Gang +1 more

A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch–Jozsa algorithm and Shor's quantum factoring. In particular, the detailed process of implementing one-qubit Deutsch–Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.

Communications in Theoretical Physics•Sep 1, 2009•0 citations
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for quantum Fourier transform over the intrinsic decoherence-free subspaces. The scheme is then applied to the circuit design of quantum Fourier transform over quantum networks under collective decoherence. The encoding efficiency and possible improvements are also discussed.
In quantum circuits, importing of additional qubits can reduce the operation time and prevent decoherence induced by the environment. However, excessive qubits may make the quantum system vulnerable. This paper describes how to relax existing qubits without additional qubits to significantly reduce the operation time of the quantum Fourier circuit compared to a circuit without optimization. The results indicate that this scheme makes full use of the qubits relaxation. The concepts can be applied to improve similar quantum circuits and guide the physical implementations of quantum algorithms or devices.
We propose schemes that are efficient when each pair of qubits undergoes some imperfect collective decoherence with different baths. In the proposed scheme, each pair of qubits is first encoded in a decoherence-free subspace composed of two qubits. Leakage out of the encoding space generated by the imperfection is reduced by the quantum Zeno effect. Phase errors in the encoded bits generated by the imperfection are reduced by concatenation of the decoherence-free subspace with either a three-qubit quantum error correcting code that corrects only phase errors or a two-qubit quantum error detecting code that detects only phase errors connected with the quantum Zeno effect again.
Fourier transform (FT) is ubiquitous in modern society due to their broad applications in many branches of science and engineering. Improving the speed of FT is a common interest in the fields of signal processing. The quantum FT is generally believed to be superior to classical algorithms, but it requires a special quantum environment to perform, which has not yet been widely used. Inspired by quantum FT, here a new FT scheme is demonstrated based on circuits. In the circuit scheme, a new type of classical correlation, which its mathematical form corresponds to those of quantum entanglement, has been constructed. The calculation speed using the designed circuit scheme is equivalent to those based on the quantum FT algorithms, which is faster than those based on the classical fast FT algorithms. Furthermore, some basic gates have been designed and experimentally fabricated using classical circuit networks, which can emulate the functions of quantum gates. Fast calculation efficiencies for the FT based on the designed classical circuit networks have been demonstrated. Extensive applications of the FT scheme in the signal processing are anticipated.
A scheme for implementing discrete quantum Fourier transform is proposed via quantum dots embedded in a microcavity, and then some of its applications are investigated, i.e., Deutsch–Jozsa algorithm and Shor's quantum factoring. In particular, the detailed process of implementing one-qubit Deutsch–Jozsa algorithm and the factorization of N = 15 are given. The microcavity mode is only virtually excited in the whole interaction, so the effective decoherent has slight effect on the current scheme. These schemes would be an important step to fabricate a solid quantum computer.