Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2021 Nov 15;11:22210. doi: 10.1038/s41598-021-01745-x

Quantum Fourier transform is the building block for creating entanglement

Mario Mastriani 1,
PMCID: PMC8593191  PMID: 34782671

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.

Subject terms: Physics, Quantum physics

Introduction

Jean-Baptiste Joseph Fourier (Auxerre, France, 21 March 1768, Paris, 16 May 1830) was a French mathematician and physicist, a disciple of Joseph-Louis Lagrange (Turin, Italy, 25 January 1736, Paris, 10 April 1813), known for his work on the decomposition of periodic functions into convergent trigonometric series called Fourier series, a method with which he managed to solve the heat equation. The projection of his work in the two centuries following his death on areas as diverse as electricity, optics, electronics, and so on, culminated during the twentieth century in the creation of the famous Discrete Fourier Transform1, Fast Fourier Transform2, and Quantum Fourier Transform3 (QFT), where the latter constitutes a key piece within Quantum Information Processing4 for the case of those quantum algorithms that require a phase estimation5, or phase estimation in qudit systems6, as well as, the presence of QFT in a d-level quantum system7.

On the other hand, entanglement810, so reviled by Albert Einstein, Boris Podolsky, and Nathan Rosen in their so famous 1935 paper11, has become the cornerstone of Quantum Computing4 and Quantum Communication12, in particular, in communications protocols such as quantum teleportation13, quantum secret sharing14, quantum key distribution15, quantum secure direct communication16, and quantum repeaters17, with a marked commitment to the future quantum Internet1822.

The union of both entities, i.e. QFT, and entanglement, seems at first something quite strange, at least in the way it is presented in this work, where the first becomes a basal element for the creation of the second, however, the approach that will be presented then it will allow access to the hidden face of the entanglement, its spectral face.

QFT is constituted by an important family of quantum operations over the ring ℤ2n. The n-qubit QFT makes a coherent mapping from an input state or qubit string x=x1xn to an output state or qubit string y=y1yn in the computational basis23 as follows:

y12nv=02n-1ω2nu.vx,u=0,1,2,,2n-1 1

where ω2n=ei2π/2n is the 2n root of unity, while the inverse QFT is:

x12nu=02n-1ω2n-v.uy,v=0,1,2,,2n-1 2

The Hadamard matrix H is equivalent to the 1-qubit QFT and its inverse24,25,

F21=H=12111-1=H-1=F21-1C21×21. 3

That is, for the 1-qubit QFT all its components are equivalent. Instead, for the 2-qubit QFT, the same does not happen, since

F22=1211111i-1-i1-11-11-i-1i, 4a

and

F22-1=1211111-i-1i1-11-11i-1-i, 4b

are different: F22F22-1, where F22F22-1C22×22. On the other hand, the Feynman’s gate4 (also known as Controlled-X, CNOT, or CX gate), as well as its flipped version are respectively:

CNOT=1000010000010010, 5a

and

CNOTflipped=1000000100100100, 5b

where the difference between them consists in that in Eq. (5a) the upper qubit is the control qubit, while the lower qubit is the target qubit. Instead, in the version of Eq. (5b) it is exactly the opposite, being: CNOTflipped=HH×CNOT×HH, “×” the matrix product, and “⊗” the Kronecker product4.

Multiplying both F22 by itself and F22-1 by itself, both multiplications result equal to the CNOTflipped gate of Eq. (5b): F22×F22=F22-1×F22-1=CNOTflipped. This can be easily verified by multiplying CNOTflipped by itself, and F22×F22 by F22-1×F22-1 and regrouping,

CNOTflipped×CNOTflipped=F22×F22×F22-1×F22-1=F22×F22×F22-1×F22-1=F22×I×F22-1=F22×F22-1=I22×22. 6

However,

CNOT=10000100001+i/21-i/2001-i/21+i/2, 7a

and

CNOTflipped=100001+i/201-i/2001001-i/201+i/2, 7b

Therefore, CNOTF22 and CNOTflippedF22. Finally, the CNOT gate is equal to the flipped version of the multiplication of QFT F22 by itself,

HH×F22×F22×HH=HH×F22-1×F22-1×HH=CNOT. 8

Equation (8) is fundamental in the creation of the entanglement for two or more qubits, as well as in all the applications that require it, as is the case of quantum teleportation11.

Bell states

Pauli’s matrices4 can be expressed in terms of the so-named Hadamard rotation gates26 or the general unitary operator Uθ,φ,λ=cosθ/2-eiλsinθ/2eiφsinθ/2eiλ+φcosθ/2 as follows:

I=HIHI=HIIIHIII=HIIHIV=HIVHII, 9a
X=HIIIHII=HIIHI=HIHIV=HIVHIII, 9b
Y=iHIIIHI=iHIIHII=-iHIVHIV=-iHIHIII,and 9c
Z=-HIIHIII=HIHII=-HIIIHIV=HIVHI, 9d

where I is a 2 × 2 identity matrix, i=-1, HI=H=Uπ/2,0,π of Eq. (3), while

HII=121-111=Uπ/2,0,0,,HIII=12-1111=U5π/2,π,0andHIV=1211-11=Uπ/2,π,π 10

The equivalence of Eq. (9b) can be used to represent the four Bell states:

β00=Φ+=1/200+11=CNOTHI00, 11a
β01=Ψ+=1/201+10=CNOTHI01=CNOTHI0X0, 11b
β10=Φ-=1/200-11=CNOTHI10=CNOTHIX00,and 11c
β11=Ψ-=1/201-10=CNOTHI11=CNOTHIX0X0, 11d

with 0=10, and 1=01. That is, replacing in Eqs. (11a11d) the equivalence corresponding to X of Eq. (9b),

H of Eq. (3), I of Eq. (9a), and CNOT of Eq. (8), it is possible to implement the four Bell states exclusively basing on QFT blocks. Without losing generality, Fig. 1a,c represents the implementation of the β00=Φ+ Bell state in terms of its two original versions (direct and flipped), while Fig. 1c,d constitute their respective counterparts based exclusively on QFT blocks, confirming that these blocks are all that is needed to create entanglement while revealing its spectral nature.

Figure 1.

Figure 1

Representation of the β00=Φ+ Bell state in terms of QFT: (a) original version based on H and CNOT gates, (b) its representations in terms of one QFT21×21 and two flipped QFT22×22, (c) original version with one H and one flipped CNOT gates, and (d) its representations in terms of one QFT21×21 and two QFT22×22.

N-qubits Greenberger–Horne–Zeilinger (GHZN) states

This family of configurations is the most commonly used in practice when it comes to entanglement between three or more particles4,810, being its general form as follows:

GHZN=1/20N+1N 12

Without loss of generality, in this study only GHZ3 and GHZ4 are implemented in terms of QFT blocks, where:

GHZ3=1/2000+111=I2×2CNOTCNOTI2×2HI4×4000,and 13
GHZ4=1/20000+1111=I4×4CNOTI2×2CNOTI2×2CNOTI4×4HI8×80000. 14

Equations (13) and (14) are graphically represented in Fig. 2a and d, respectively. Figure 2b shows GHZ3 with one QFT21×21 and four flipped QFT22×22, while Fig. 2c represents it thanks to one QFT21×21 and two flipped QFT23×23. Finally, Fig. 2e shows GHZ4 with one QFT21×21 and six flipped QFT22×22, while Fig. 2f represents it thanks to one QFT21×21 and two flipped QFT24×24.

Figure 2.

Figure 2

Implementations of GHZ3 and GHZ4: (a) original version of GHZ3 in terms of one H and two CNOT gates, (b) GHZ3 thanks to one QFT21×21 and four flipped QFT22×22, (c) GHZ3 based on one QFT21×21 and two flipped QFT23×23, (d) original version of GHZ4 in terms of one H and three CNOT gates, (e) GHZ4 thanks to one QFT21×21 and six flipped QFT22×22, (f) GHZ4 based on one QFT21×21 and two flipped QFT24×24.

Equivalences between Fig. 2a–c as well as between Fig. 2d–f, show again the spectral nature of the entanglement even for the case of more than two particles entangled at the same time. In fact, the equivalences present in Fig. 2 between (N − 1) pairs of flipped QFT22×22 and two flipped QFT2N×2N, show that the equivalence of Fig. 1 is not a simple coincidence for a particular case like a Bell state, but actually, the entanglement in all its manifestations has a spectral nature, where the QFT is the essential instrument for a spectral tomography of it. It only remains to project this equivalence, in perhaps the most conspicuous application of entanglement, quantum teleportation13.

Teleportation

This protocol13 is implemented in three different ways in Fig. 3, where a qubit ψ to be teleported is prepared and introduced in the upper qubit on the left of the protocol. A Bell state like that of Fig. 1 is distributed between Alice and Bob. Subsequently, a module applied in the two upper qubits and constituted by a CNOT gate, an H gate, and two quantum measurement blocks (QuMe) constitute what in practice is known as a Bell State Measurement (BSM) module4,810. The double lines at the output of each QuMe convey classical information from Alice to Bob in the form of two classical disambiguation or control bits. For this reason, this means of transport is known as a classic channel of disambiguation, control, or simply as an auxiliary channel.

Figure 3.

Figure 3

Quantum teleportation protocol: (a) the original implementation, (b) Controlled-Z is replaced with its equivalent in terms of one CX and two H gates, and (c) a version based exclusively on QFT blocks, where QuMe means quantum measurement, and the double lines represent classical information obtained after each QuMe.

A 2-qubits Controlled-Z gate or simply CZ gate can be constructed from QFT blocks according to the equivalence of Eq. (9d), or in terms of two H and one CNOT (Controlled-X or CX) gates from the following identity:

CZ=I2×2HCXI2×2H 15

As can be seen in Fig. 3c, except for the QuMe blocks, everything else in this protocol is representable using QFT blocks. This extends, with identical results, to all other protocols that are based on entanglement such as quantum secret sharing14, quantum key distribution15, quantum secure direct communication16, and quantum repeaters17, and that are used in quantum Internet18.

Quantum spectral analysis

A time decomposition, based on Fig. 4, is developed according to the intervention of each QFT block in the creation of the β00=Φ+ Bell state. This analysis begins with the creation of a flipped QFT22×22 in terms of a QFT22×22 and four Hadamard (H) gates, where the last ones are used for flipping it as follows,

F22,flipped=HHF22HH=1211111-11-111-1-11-1-111211111i-1-i1-11-11-i-1i1211111-11-111-1-11-1-11=12111111-1-11-1i-i1-1-ii 16

Figure 4.

Figure 4

Timeline of the β00=Φ+ Bell state of Fig. 1b based on QFT blocks.

Next, the complete timeline is developed according to Fig. 4, starting at t1, where ψt1 is the wave-function in that instant,

ψt1=00=00=1000=qut1qlt1 17

qut1=0 is the upper qubit in Fig. 4, and qlt1=0 is the lower qubit in that figure. The qubits obtained qu and ql at time t1 are completely independents8, and are used as inputs to the next step, which is made up of an H gate in qu and an identity matrix in ql,

ψt2=HIψt1=HI00=1/201/2001/201/21/20-1/2001/20-1/21000=1/201/20=H00=+0=qut2qlt2, 18

where +=1/21/2, qut2=+, and qdt2=0. As in the previous case, Eq. (18) shows us that both qubits obtained at time t2 are also completely independent8. Instead, in the next step yields,

ψt3=F22,flippedψt2=12111111-1-11-1i-i1-1-ii1/201/20=1/201+i/221-i/22qut3qlt3, 19

where Eq. (19) indicates that qu and ql at time t3 are correlated8, i.e. although this case does not result in entanglement, ψt3 cannot be factored. In this intermediate instance, between both flipped QFT22×22, the impossibility of factoring can be observed, since there are no values of qut3 and qlt3, such that ψt3=qut3qlt3. Undoubtedly, this constitutes advance respect to the literature on the subject in force to date, which associated the aforementioned impossibility with the intervention of the CNOT gate, as a whole, in an exclusive way, or with an inappropriate coupling between the individual contributions of H and CNOT gates. In consequence, this analysis makes explicit an intermediate instance to the one already known for the non-separability and indistinguishability of the states during entanglement, which is exclusively the responsibility of a particular characteristic of the Discrete Fourier Transform1 (DFT) and that is inherited by the QFT3. This characteristic refers to the fact that the DFT is a dense matrix, i.e. all its elements are different from zero, since, they are the N roots of the unit or twiddle factors1, which when they are multiplied by the input vector produce an output vector where each of its elements represents a mixture or weighted sum of the incoming vector. Finally, the intervention of the second flipped QFT22×22 allows obtaining the wave-function at the time t4,

ψt4=F22,flippedψt3=12111111-1-11-1i-i1-1-ii1/201+i/221-i/22=1/2001/2qut4qlt4, 20

where, as in the previous case, it is impossible to decompose ψt4 into two independent states qu and ql, that is, ψt4 is not factorable. This gives rise to a very particular state of null spin called entanglement8.

The four density matrices associated with every wave-function of Fig. 4 are the following:

ρt1=ψt1ψt1=10001000=1000000000000000, 21

where (•)* is the complex conjugate of (•),

ρt2=ψt2ψt2=1/201/201/201/20=1/201/2000001/201/200000, 22
ρt3=ψt3ψt3=1/201+i/221-i/221/201+i/221-i/22=1/201+i/41-i/400001+i/40i/41/41-i/401/4-i/4,and 23
ρt4=ψt4ψt4=1/2001/21/2001/2=1/2001/2000000001/2001/2. 24

The four density matrices can be seen in Table 1, where only ρt3 has an imaginary part. On the other hand, comparing the 3D bars of the density matrices at t2 and t4, it can be seen that the consecutive action of both flipped QFT22×22 has a stretching effect as far as the locations of the bars are concerned. This shows that both flipped QFT22×22 are the architect of a bad copy of wave-function ψt2 of Eq. (18), that is to say,

Uψt2=U+0++, 25

where U = flipped QFT22×22 × flipped QFT22×22, being the true result generated by both,

Uψt2=U+0=β00. 26

Table 1.

Density matrices of the four wave-functions of Fig. 4.

Instant Real part of the density matrices Imaginary part of the density matrices
t1 graphic file with name 41598_2021_1745_Figa_HTML.gif
t2 graphic file with name 41598_2021_1745_Figb_HTML.gif
t3 graphic file with name 41598_2021_1745_Figc_HTML.gif graphic file with name 41598_2021_1745_Figd_HTML.gif
t4 graphic file with name 41598_2021_1745_Fige_HTML.gif

This shows that entanglement is the result of an inadequate copy by a very inefficient copy machine embodied by both flipped QFT22×22. The aforementioned stretching effect added to the unification of the entanglement's own wave-function triggers its most conspicuous characteristic, that is to say, the impossibility of factoring the wave function of Eq. (20).

Moreover, given two subsystems (A, and B) that interact with each other, their density matrices treated individually are,

ρA=ρB=1200+11=12I=121001, 27

and their von Neumann entropies are,

SA=SB=-trρAlogρA=-trρBlogρB=-tr121001log121001=1, 28

where tr(•) is the trace of the square matrix (•), and log(•) is logarithm base 2 of (•). In the same way, for a composed system, the entropy is,

SAB=-trρABlogρAB. 29

SAB depends on the degree of correlation (completely independent, correlated, and entangled) between both subsystems. Besides, in the classical and the quantum worlds, the correlations between the subsystems are those established by the additional information. In the case of composite quantum systems, the mutual information SAB is introduced to quantify that additional information, allowing us to obtain the degree of correlation between both subsystems8,

SAB=SA+SB-SAB0. 30

Therefore, the entropy of the composite system SAB indicates that the uncertainty of a state ρAB is less than the two subsystems SA and SB added together.

Table 2 shows entropies in terms of the degree of correlations between both subsystems, in such a way that when SAB=2, the entropy of the composite system SAB=SA+SB-SAB=1+1-2=0, which means that both subsystems do not have mutual information, and this null degree of correlation corresponds to the case of Eq. (18) of Fig. 4 at time t2, where ψt2 is factored into qut2=+, and qlt2=0, that is, both subsystems are completely independents. Instead, when SAB=1, the entropy of the composite system SAB=SA+SB-SAB=1+1-1=1, this case corresponds to Eq. (19) at time t3 of Fig. 4, where both subsystems are correlated, i.e., ψt3 cannot be factored in terms of qut3 and qlt3. Although both subsystems (A, and B) share information and are not separable, they do not give rise to entanglement. Finally, if SAB=0, the entropy of the composite system SAB=SA+SB-SAB=1+1-0=2, that is to say, the mutual information between both subsystems is maxima. It is about the presence of entanglement corresponding to Eq. (20) at time t4 of Fig. 4, where, as in the previous case, it is impossible to decompose ψt4 into two independent states qu and ql, that is, ψt4 is not factorable.

Table 2.

Entropies in terms of the degree of correlations between both subsystems.

Degree of correlation between both subsystems SAB SAB Graphic of sets
Completely independent 2 0 graphic file with name 41598_2021_1745_Figf_HTML.gif
Correlated 1 1 graphic file with name 41598_2021_1745_Figg_HTML.gif
Entangled 0 2 graphic file with name 41598_2021_1745_Figh_HTML.gif

Conclusions

This study demonstrated the existing relationship between the Feynman4 gate, known as Controlled-X, CNOT, or CX, with a pair of flipped QFT22×22. This, added to the already known equivalence between the Hadamard gate (H), and one QFT21×21 matrix, gives rise to the creation of entanglement based exclusively on QFT blocks. This equivalence is extended to the creation of entanglement between more than two particles, as is the case of the states GHZ3, and GHZ4.

A representation of the famous quantum teleportation protocol11 based exclusively on QFT3,4 blocks is achieved, which highlights a clear projection of the study carried out here on the future quantum Internet1822.

The decomposition of the configuration for the creation of the entanglement in QFT blocks allows, through the timeline of Fig. 4, to perform an internal tomography of the entanglement, revealing, for the first time in the literature, the three degrees of correlation between particles8, that is, completely independent, correlated, and entanglement, from a single configuration.

In the same process mentioned previously, it becomes evident as never before that entanglement arises from a defective copy starring both flipped QFT22×22.

Finally, the spectral analysis of all quantum computing and quantum communication protocols, added to the traditional temporal analysis present in the literature, will allow a better understanding of the inner nature of the entanglement, so that this new approach can help to create new and more efficient algorithms and fault tolerant protocols.

Acknowledgements

M.M. thanks the staff of the Knight Foundation School of Computing and Information Sciences at Florida International University for all their help and support.

Author contributions

M.M. conceived the idea and fully developed the theory, wrote the complete manuscript, prepared figures, and reviewed the manuscript.

Competing interests

The author declares no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Briggs WL, van Emden H. The DFT: An Owner’s Manual for the Discrete Fourier Transform. SIAM; 1995. [Google Scholar]
  • 2.Jain AK. Fundamentals of Digital Image Processing. Englewood Cliffs; 1989. [Google Scholar]
  • 3.Weinstein YS, et al. Implementation of the quantum Fourier transform. Phys Rev Lett. 2001;86:1889. doi: 10.1103/PhysRevLett.86.1889. [DOI] [PubMed] [Google Scholar]
  • 4.Nielsen MA, Chuang IL. Quantum Computation and Quantum Information. Cambridge University Press; 2004. [Google Scholar]
  • 5.Shor PW. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 1997;26(5):1484–1509. doi: 10.1137/S0097539795293172. [DOI] [Google Scholar]
  • 6.Cao Y, Peng S-G, Zheng C, Long G-L. Quantum Fourier transform and phase estimation in qudit system. Commun. Theor. Phys. 2011;55(5):790–794. doi: 10.1088/0253-6102/55/5/11. [DOI] [Google Scholar]
  • 7.Cao, Y., Peng, S.-G. & Long, G.-L. Quantum Fourier Transform in a d-level Quantum System, in Conference on Lasers and Electro-Optics/Pacific Rim 2007, (Optical Society of America, 2007), paper TuH3_4. https://www.osapublishing.org/abstract.cfm?URI=CLEOPR-2007-TuH3_4.
  • 8.Audretsch J. Entangled Systems: New Directions in Quantum Physics. Wiley-VCH Verlag GmbH & Co.; 2007. [Google Scholar]
  • 9.Jaeger G. Entanglement, Information, and the Interpretation of Quantum Mechanics. Springer; 2009. [Google Scholar]
  • 10.Horodecki R, et al. Quantum entanglement. Rev. Mod. Phys. 2009;81(2):865–942. doi: 10.1103/RevModPhys.81.865. [DOI] [Google Scholar]
  • 11.Einstein A, Podolsky B, Rosen N. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 1935;47(10):777–780. doi: 10.1103/PhysRev.47.777. [DOI] [Google Scholar]
  • 12.Cariolaro G. Quantum Communications: Signals and Communication Technology. Springer; 2015. [Google Scholar]
  • 13.Bennett CH, et al. Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 1993;70(13):1895–1899. doi: 10.1103/PhysRevLett.70.1895. [DOI] [PubMed] [Google Scholar]
  • 14.Joy D, et al. Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer. Quantum Inf. Process. 2020;19:33. doi: 10.1007/s11128-019-2531-z. [DOI] [Google Scholar]
  • 15.Ekert AK. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 1991;67(6):661–663. doi: 10.1103/PhysRevLett.67.661. [DOI] [PubMed] [Google Scholar]
  • 16.Zhou Z, et al. Measurement-device-independent quantum secure direct communication. Sci. Chin. Phys. Mech. Astron. 2020;63(3):230362. doi: 10.1007/s11433-019-1450-8. [DOI] [Google Scholar]
  • 17.Ruihong Q, Ying M. Research progress of quantum repeaters. IOP J. Phys. Conf. Ser. 2019;1237:052032. doi: 10.1088/1742-6596/1237/5/052032. [DOI] [Google Scholar]
  • 18.Caleffi M, et al. The rise of the quantum Internet. Computer. 2020;53(06):67–72. doi: 10.1109/MC.2020.2984871. [DOI] [Google Scholar]
  • 19.Cacciapuoti AS, et al. The quantum Internet: Networking challenges in distributed quantum computing. IEEE Netw. 2020;34(1):137–143. doi: 10.1109/MNET.001.1900092. [DOI] [Google Scholar]
  • 20.Gyongyosi L, Imre S. Entanglement accessibility measures for the quantum Internet. Quant. Inf. Proc. 2020;19:115. doi: 10.1007/s11128-020-2605-y. [DOI] [Google Scholar]
  • 21.Gyongyosi, L. & Imre, S. Entanglement Access Control for the Quantum Internet. http://arxiv.org/quant-ph/1905.00256 (2019).
  • 22.Gyongyosi, L. & Imre, S. Opportunistic Entanglement Distribution for the Quantum Internet. http://arxiv.org/abs/quant-ph/1905.00258 (2019). [DOI] [PMC free article] [PubMed]
  • 23.Browne DE. Efficient classical simulation of the quantum Fourier transform. New J. Phys. 2007;9:146. doi: 10.1088/1367-2630/9/5/146. [DOI] [Google Scholar]
  • 24.Rieffel E, Polak W. Quantum Computing: A Gentle Introduction. The MIT Press; 2011. [Google Scholar]
  • 25.Fijany, A. & Williams, C. P. Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits. http://arxiv.org/abs/quant-ph/9809004 (1998).
  • 26.Gruska, J. Quantum Computing (McGraw-Hill, 1999–2005).

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES