Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2020 Jul 3;10:10968. doi: 10.1038/s41598-020-67364-0

Theory of quantum path computing with Fourier optics and future applications for quantum supremacy, neural networks and nonlinear Schrödinger equations

Burhan Gulbahar 1,
PMCID: PMC7335213  PMID: 32620792

Abstract

The scalability, error correction and practical problem solving are important challenges for quantum computing (QC) as more emphasized by quantum supremacy (QS) experiments. Quantum path computing (QPC), recently introduced for linear optic based QCs as an unconventional design, targets to obtain scalability and practical problem solving. It samples the intensity from the interference of exponentially increasing number of propagation paths obtained in multi-plane diffraction (MPD) of classical particle sources. QPC exploits MPD based quantum temporal correlations of the paths and freely entangled projections at different time instants, for the first time, with the classical light source and intensity measurement while not requiring photon interactions or single photon sources and receivers. In this article, photonic QPC is defined, theoretically modeled and numerically analyzed for arbitrary Fourier optical or quadratic phase set-ups while utilizing both Gaussian and Hermite-Gaussian source laser modes. Problem solving capabilities already including partial sum of Riemann theta functions are extended. Important future applications, implementation challenges and open issues such as universal computation and quantum circuit implementations determining the scope of QC capabilities are discussed. The applications include QS experiments reaching more than 2100 Feynman paths, quantum neuron implementations and solutions of nonlinear Schrödinger equation.

Subject terms: Computational science, Applied optics


The scalability of quantum resources including qubits and quantum gates, improved error correction capabilities and practical problem solving ability are the most important challenges for modern quantum computing (QC). Recent quantum supremacy experiments (QS) of Google as a success milestone for the human history of computing emphasize the importance of these properties in their set-up with 53 qubits and 20 cycles reaching Hilbert space size of 266 Feynman paths making it significantly difficult to classically calculate their result1,2. QS experiments target to show the computational capability of QCs such that feasible computations obtained with QCs require significant resources to perform with classical computers3. In the global and highly competitive race including technology giants, a wide variety of but quite complex hardware architectures are used. For example, Google, IBM and Rigetti Computing use superconducting circuits while Microsoft using topological anions generated by frozen nanowires, Ion-Q using ion traps at room temperature and D-Wave using quantum annealing technology4. On the other hand, both the challenges of scalability and practical problem solving capability continue to exist such that QCs that can show significant advantages in practical problem solving compared to conventional computers require much more resources such as thousands of logical qubits and hundreds of thousands physical qubits5. Therefore, building QC system architectures which are more tolerant to noise and decoherence combined with capabilities of error correction, practical problem solving, low hardware complexity and resource scalability is significantly important for near-term advantages of QC.

Linear optic (LO) based QCs (LOQCs) have a special place among the existing QC architectures due to easy manipulation of photons, unique features of photons not interacting with the environment in terms of decoherence, working at room temperature and maturity in classical optics for centuries79. For example, boson sampling10 as a candidate for LOQC based QS promises experimental implementation of QS in the future while the recent experimental achievements in Ref.11 improve the complexity of the solved problems gradually reaching Hilbert space size of 248. However, the existing LOQC candidates for QS have still the fundamental challenges of scalability of the resources, e.g., the requirement of single photon sources and receivers, and practical problem solving capability, e.g., matrix permanents in boson sampling. Furthermore, multi-photon entanglement resources and quantum circuits are challenging to create due to the difficulty in the interaction of photons with each other. Multi-plane diffraction (MPD) based QC system denoted by quantum path computing (QPC) as shown in Fig. 1 is recently proposed in Ref.6 as one of the simple LOQC architectures targeting to realize scalability and practical problem solving capabilities. Sampling from the interference of exponentially increasing number of propagation paths and the freely entangled projections at different time instants12 are utilized for QC purposes, for the first time, by exploiting coherent and classical sources such as standard laser sources. Exponentially increasing number of Feynman paths with respect to the given amount of slits and diffraction planes makes the classical calculation of the interference output significantly hard6. The unique form of temporal correlation freely available among the exponentially increasing number of Feynman paths in the MPD set-up is denoted as quantum path entanglement (QPE) in Ref.12 as a novel resource to exploit for QC based on the coherence and superposition of the classical light source13,14. In fact, a quantum mechanical propagator for photons with the form of the classical Fresnel diffraction integral is verified in Ref.15 such that the classical intensity of the field is proportional to the probability density of photon detection for the position observable transversal to the propagation and in the limit for large number of quanta. Therefore, FO based set-up exploits classical light source and its intensity measurement while exploiting quantum temporal correlations in a unique MPD design. QPC promises a significant alternative to cope with the fundamental challenges of scalability of multi-photon entanglement resources and the complex requirements of single photon sources and detection mechanisms observed in conventional linear optical QC systems9,1618. It has important all-in-one advantages combining the utilization of the classical sources, i.e., either fermion or boson, hardware simplicity based on diffraction slits and detection with conventional photon counting intensity detectors without requiring simultaneous detection of multiple photons in multiple registers10.

Figure 1.

Figure 1

QPC set-up composed of N-1 diffraction planes, FSP between the planes and a single sensor plane on which exponentially increasing number of propagation paths interfere6.

Besides that, another QC architecture related to multi-slit structures is denoted as duality computer (DC) which exploits duality parallelism for performing different gate operations on the sub-wave functions through sub-waves corresponding to each slit1922 while utilized in various machine learning23 and photonic chip applications24. The quantum wave divider (QWD) divides wave functions into sub-waves. In addition, sub-sub-waves can also be obtained in a multi-level QWD while quantum wave combiner (QWC) is utilized to combine the waves after performing operations on each path. It is firstly required as an open issue to explicitly model the theoretical computational complexity and QC capabilities of a multi-level version of DC with respect to the targeted QWD/QWC configurations before comparing with MPD design. For example, combined operations of uniform QWD/QWC in a DC leaving the state unchanged is not comparable with MPD modifying the state with diffractions as time evolves. Single level complexity discussions in the DC related literature include the requirement of an extra qudit20,21 for simulating DC device with an ordinary quantum computer which is not comparable with the tensor product structure of MPD requiring multiple qudits. The division of each wave into a sub-wave and then into a sub-sub-wave could require an exponentially increasing number of slit resources making it challenging as discussed next for Ref.25. On the other hand, DC based architectures have a long history and maturity along two decades with many capabilities and applications including practical database search without requiring extra resources19 verified with quantum circuit modeling in Ref.20. DC utilizes linear combination of unitaries (LCU) for QC while becoming one of the five major techniques for designing quantum algorithms26, in multi-party secure computation27 and HHL quantum algorithm28.

Furthermore, simple optical setups exploiting wave-particle duality and interferometers have the cost of exponential complexity of resources either in time, space or energy domains to achieve QC advantages as discussed in Ref.6. For example, wave particle (WP) computer29 exploits full optical interconnections of an N×N input signal array with an N×N output signal creating N4 channels with a tensor product. WP computer also utilizes a filter array between the input and output to increase the number of connections in an additive manner with respect to the connections in each inter-planar region. Such architectures, including also Ref.25 for a slit based modeling, provide advantages of parallelism compared with classical models without exploiting temporal correlations of quantum histories and their tensor product structure12. They utilize the tensor product only for a single inter-planar propagation, i.e., a single measurement plane directly detecting propagation from the input array. The rich set of two and three dimensional alternative optical interconnection architectures and opto-electronic computing are discussed in detail in Ref.30 by also including multi-stage interconnection topology. Analog Fourier optics (FO) and its digital equivalent, i.e., digital FO architectures composed of smart pixel arrays of two-dimensional electronic processing units connected with optical interconnections, exploit speed and parallelism advantages of the optical design31. Furthermore, programmable directed logic networks are discussed in Ref.32 by emphasizing the energy efficiency of optical architectures.

On the other hand, QPC formulation is performed for electron based set-up in Ref.6 while theoretical studies modeling QPE in Ref.12 and classical optical communications in Ref.33 formulate free space propagation (FSP) of light. They do not generalize to arbitrary set-ups of FO, i.e., first order centered optical or quadratic-phase systems including arbitrary sections of free space, thin lenses, graded index media and spatial filters34 and mathematically characterized as linear canonical transforms (LCTs)35. LCTs are linear integral transforms including the Fresnel and fractional Fourier transform (FRFT), scaling, chirp multiplication and some other operations as special cases while being equivalent to spatial distribution of light in phase-space optics for quadratic-phase systems34. Besides that, previous MPD studies utilize Gaussian sources without extending to Hermite-Gaussian (HG) beams compatible with the standard laser sources within the paraxial approximation36. Photonic QPC formulation is not available while important applications of QPC other than the partial sum of Riemann theta function (RTF) and period finding presented in Ref.6 are not discussed and theoretically analyzed yet.

Diffractive and phase space optics are also getting attention in quantum technologies with periodic single plane diffraction for implementing quantum logic gates using quantum Talbot effect37, for testing D-dimensional (qudit) Bell inequality with free space entangled quantum carpets38 and for the evaluation of entanglement over the entire transverse field distribution of the photons39 while without any discussion regarding the MPD based advantages. Proposed theoretical modeling and system design of photonic QPC with widely available optical components, e.g., thin lenses, free space and diffraction planes as a form of spatial filtering, provide a unique opportunity to exploit conventional FO for QC. The large amount of theoretical and experimental maturity in FO since the last century is combined with MPD based system design to realize scalable and low complexity QC systems with important capabilities and global resources for efficient implementation and development.

In this article, QPC set-up is defined, theoretically modeled and numerically analyzed for FO with arbitrary LCTs between diffraction planes. QPC system exploiting diffraction in an unconventional manner maintains photonic advantages including decoherence and noise while avoids the need to interact with multiple photons by eliminating many problems encountered in multi-photon entanglement and circuit implementations. Furthermore, the quantum nature of FO is discussed based on the experimental15,40 and theoretical41 studies verifying the validity of Fresnel diffraction formulation for quantum optical propagation. Classical monochromatic light sources of both Gaussian and Hermite-Gaussian (HG) beams are utilized compatible with the standard laser sources within the paraxial approximation36. LCT based design which provides more flexibility is numerically compared with FSP in terms of improvement on the detection efficiency and the interference complexity defined with the magnitudes of the interfering paths and negative volume of Wigner distribution function6,42.

Important future applications of photonic QPC are, for the first time, introduced and theoretically modeled in an introductory and brief manner. These include the feasibility of QS experiments compared with alternative technologies, adapting certified random number generation protocols for the photonic QPC architecture4346, quantum neural network (QNN) implementations and making the solutions of nonlinear Schrödinger equation (NLSE) easier. The detailed modeling and utilization of photonic QPC for these applications are presented as open issues.

The potential of QS experiments with photonic QPC is presented in this article to reach more than 2100 Feynman paths in a scalable set-up with several tens of diffraction planes while requiring experimental implementations for better modeling and verifying the scalability for large scale QPC set-ups. A feasible method is proposed to exponentially increase the number of Feynman paths with the cost of linearly increasing number of planes and slits allowing to obtain significantly large Hilbert space. However, it is an open issue to verify QS capability both complexity theoretically and experimentally based on the promising results in Ref.6 and the modeling in this article such as by performing analogous modeling and experiments in Refs.10,11 and47 achieved for Boson sampling. Moreover, QPC with Gaussian sources results in unique mathematical forms of wave functions on the sensor plane in (16) to be exploited for the solutions of the partial sum of RTF4851, period finding52 and Diophantine approximation53 similar to the algorithms and methods in Ref.6 but with much more design flexibility due to LCTs, diversity of the tools and maturity in the science of FO. HG sources result in different forms in (25) and (27) while closely related to the standard RTF form and requiring future studies to exploit for the solutions of numerical problems in various scientific disciplines. On the other hand, open issues and challenges for FO based QPC design are discussed to determine the scope of the proposed design for QC purposes, e.g., universal quantum computation capability, implementations of quantum circuit gates and basic search algorithms such as Grover search.

Neural networks (NNs) exploiting the quantum advantages, i.e., QNNs, improve the capabilities of classical NNs with quantum interference and superposition for deep learning applications54 in various disciplines55. On the other hand, linear and unitary framework of quantum mechanics results in the challenges of implementing non-linear and dissipative dynamics of classical neural networks55. The state-of-the-art neuron implementations utilize various methods to introduce non-linearity including quantum measurements55,56. The quantum interference among the exponentially increasing number of paths and the entanglement denoted as QPE in Ref.12 are promising for designing and practically implementing novel design of QNNs. QPC set-up has inherently nonlinear formulation with respect to slit positions to encode the input and it operates on the quantum superposition of the inputs. Besides that, implementations of diffractive NNs utilizing single-layer57,58 and all-optical multi-layer diffractive architectures59 do not exploit interference among the paths or quantum domain advantages. Photonic QPC succeeds to combine the implementations of QC and QNNs with the same hardware design of MPD as a uniquely valuable unconventional hardware architecture.

NLSE solution is very important in the analysis and performance measurement of fiber optic cables60,61. It is also necessary for the solution of nonlinear Fourier transform (NLFT) which is a transformation that finds a wide range of applications with increasing importance60. NLSE and NLFT play a similar role for nonlinear and integration equations compared with the role of the FT in linear systems. NLFT is a transformation system for expressing the signal in the time plane by using nonlinear periodic waves or solitons60. It is also referred to as scattering transform. NLSE is expressed as follows60,61:

ıδq(x,t)δt+δ2q(x,t)δx2+2κ|q(x,t)|2q(x,t)=0 1

where q(xt) is the solution wave function that provides the periodic boundary condition (q(x+l,t)=q(x,t) and period l>0) and κ is some variable. In this article, the speed up in NLSE solution is conjectured by exploiting RTF summations in QPC.

The remainder of the paper is organized as follows. We firstly define and theoretically model photonic QPC and its extension for FO followed by the discussion of the performance based on Wigner distribution function. Then, future applications including QS, quantum neuron implementation and solution of NLSE are introduced, theoretically modeled and the challenges are discussed. Numerical analysis for photonic MPD is provided and then open issues for realizing photonic QPC are presented.

Results

Quantum path computing with optical multi-plane diffraction and coherent light sources

MPD set-up introduced in Ref.6 as shown in Fig. 1 is extended to optical implementations for QC by using coherent laser sources and conventional photodetectors. The set-up is composed of N-1 diffraction planes with Kj slits on each plane for j[1,N-1] and a single sensor plane indexed with N while the central position of a slit is given by Xj,i for i[1,Kj] as shown in Fig. 1a. Each slit is assumed to apply a spatial filtering of G(Xj,i,β~j,i,xj)exp(-(xj-Xj,i)2/(2β~j,i2)), i.e., slit mask function, where β~j,i determines the slit width. The wave function on jth plane is denoted with Ψj(xj) which is the wave form after diffraction through the previous planes, i.e., with the indices k[1,j-1], while before diffraction through the slits on jth plane. There is an exponentially increasing number of propagation paths through the slits until to the final sensor plane, i.e., Npj=1N-1Kj, while nth path includes the diffraction through a single slit on each plane with the corresponding wave function Ψj,n(xj) on jth plane. Assume that nth path passes through the slit indexed with sn,j on jth plane and we define the path vectors xN-1,nTX1,sn,1X2,sn,2XN-1,sn,N-1 and xN-1,sTX1,s1X2,s2XN-1,sN-1 where ss1s2sN-1 and (.)T is the transpose operation. The mapping between the path index n and slit index sn,j for the path is defined with the function n=fs2n(s) where sn,j is predefined for each n. Furthermore, 0k is the column vector of length k with all zeros and 0k is the square matrix of all zeros with the size k×k. Similarly, rectangular matrices are shown with 0k,l. In the rest of the article, a parameter B depending only on βN-1,n[β~1,sn,1β~N-1,sn,N-1] but not on xN-1,n is denoted with B~j,n on each jth plane including .~ over the symbol. Therefore, if the slits are chosen with the same β~j,sn,j=βj specific to each plane, then B~j,n becomes independent of n and is converted to the notation Bj.

MPD set-up shown in Fig. 1 is utilized for QC denoted by QPC in Ref.6 by sampling the interference of exponentially increasing number of interfering paths. The capability to theoretically characterize QPC with quantum FO provides future applications for both QC and quantum information theory by exploiting energy efficient combination of optical elements. Intensity sampling on the sensor plane (I[k]) for the MPD set-up in Refs.6,12 generates a black-box (BB) function fBB[k] with the following special form to utilize in solutions of important and classically hard number theoretical problems:

fBB[k]I[k]|s1=1K1sN-1=1KN-1e(A~s+ıB~s)(kTs)2Υ~sexN-1,sTH~sxN-1,se(h~sTxN-1,s)kTs|2 2

where kZ, TsR+ is a sampling interval, A~sR-, B~sR+ and Υ~sC. The complex valued matrix H~sH~R,s+ıH~I,s and the vector h~sc~s+ıd~s have the values depending on β~j,i for j[1,N-1] and i[1,Kj] corresponding to the specific selection of slits in the path s, inter-plane durations for the particle propagation, particle mass m (for electron based set-ups in Refs.6,12), beam width σ0 of the Gaussian source wave packet and Planck’s constant ħ. The calculation of (2) in an efficient manner is significantly hard while two different methods utilizing (2) for practical problems are introduced. Solution for the partial sum of RTF or multi-dimensional theta function is the first application with importance in number theory and geometry4851. The second method utilizes MPD with the phase term d~sTxN-1,s in exp(h~sTxN-1,skTs) for period finding52 and the solution of specific instances of SDA problems53.

The basic unit of QC systems, i.e., the qubit, is defined on a two-state system where discretized degrees of freedom (DoF) of photons including path, transverse-spatial modes and time/frequency bins are exploited to create high-dimensional entanglement62. For example, multi-slit structures are already utilized to define spatial qudits by projecting the wave function into the transverse position and momentum Hilbert spaces through slits and characterizing their properties using their propagation in free space63,64. The qubit states in Ref.64 are expressed in the basis |l,|r representing the photons passing through either the left or the right slit. However, entangled multiple photons, e.g., photon pair A and B, are conventionally generated through spontaneous parametric down-conversion (SPDC) to realize multi-photon entangled state, e.g., (1/2)(|lA|rB+|rA|lB). The fundamental difference of MPD based qudits from multi-photon slit based entangled spatial qudits is the utilization of the tensor product structure for each single photon in time domain rather than spatially among multiple photons obtained through SPDC6. The projection events through the slits of consecutive planes are freely entangled at two different time instants denoted as QPE with the detailed modeling presented in Ref.12 based on consistent histories and entangled histories frameworks. The presented free entanglement in time domain provides an important advantage exploiting directly the classical light sources and not requiring the difficult coupling of multiple photons. The concept of free entanglement is introduced for boson sampling exploiting boson statistics of a number of indistinguishable bosons while they still require multiple photons, and generation and detection mechanisms for single photons10.

History state in MPD is composed of diffraction events as follows12:

nπnPN-1,sn,N-1PN-2,sn,N-2P1,sn,1ρ0 3

where Pj,sn,j represents the projection operator through the slit indexed with sn,j, πn as 0 or 1 determines a compound set of trajectories, denotes tensor product operation and ρ0 denotes the initial state. The analogy of MPD based multiple qubits with the general two qubit state of two photons is represented as shown in Fig. 2 in the basis of |U and |L for the upper and lower slits, respectively. The general state for the projection through two diffraction planes indexed with A and B is represented as follows:

|Ψ3auu|UAUB+alu|LAUB+all|LALB+aul|UALB 4

where the amplitudes are denoted by aij, and i and j denote the projection through upper or lower slits. The A and B in the MPD set-up denote the indices of planes for the projection of a single photon at different time instants rather than the indices of two photons as in the entangled state of two spatial qubits of two photons. There are four different projection history states where the wave function whose intensity to be measured on the final detection plane, i.e., Ψ3(x) , is described as the interference of four different wave function histories corresponding to each trajectory, i.e., Ψ3,j(x) for j[1,4]:

Ψ3(x)=Ψ3,1(x)+Ψ3,2(x)+Ψ3,3(x)+Ψ3,4(x) 5

Ψ3,1(x) corresponds to auu|UAUB and the other components are defined as shown in Fig. 2. Each component depends in a complex manner on the slit geometries as modeled by the RTF. QPC applications of MPD based high dimensional entangled states do not include any measurement by closing or opening slits but a final measurement on the detector plane obtaining the complicated interference pattern of exponentially many Feynman paths6.

Figure 2.

Figure 2

MPD based two-qubit state represented with four quantum histories of a single photon with the tensor product structure in time domain in analogy with the entangled state of two spatial qubits of two photons.

QPC based on FO promises expanding the set of solvable problems both with LCT based general system design and also the sources including HG beams. Furthermore, a discussion is included to utilize non-Gaussian slits with the proposed mathematical modeling in the Open Issues and Discussion section. Propagation through Fourier optical systems based on Fresnel diffraction is modeled emphasizing the quantum nature of Fresnel diffraction and FO in the Methods section. Next, MPD modeling is proposed for Fresnel diffraction and arbitrary LCT based optical systems by utilizing the proposed kernels.

Quantum path computing with Fourier optical systems

The set-up in Fig. 1 defined with FSP and electron based theoretical formulation is extended to optical systems of LCT as shown in Fig. 3. The kernel of one dimensional (1D) quadratic-phase system or LCT converting the input signal f(x0) to the output -dx0KLCT(a,b,c,d)(x1,x0)f(x0) is represented as follows:

KLCT(a,b,c,d)(x1,x0)1be-ıπ4eıπb(dx12-2x1x0+ax02) 6

In matrix notation, it is shown with the following unit-determinant matrix:

MLCT=abcd 7

where ad-bc=1 and the matrix for the composition of two consecutive systems represented by M1 and M2 is calculated by the multiplication M2M1. The kernel matrices KFS(x1,x0) and KHO(x1,x0) denoting FSP kernel in phase-space optics34 and the kernel based on quantum mechanical harmonic oscillator (HO) modeling of the evolution of light wave function15 (in analogy with FRFT implementation), respectively, are defined in the Methods section while discussing quantum FO. Some simple examples of LCT matrices for propagation of length Lj,j+1 between jth and (j+1)th planes are given as follows34:

Freespacepropagation:MFS12πħLj,j+1mλc01 8
Fouriertransform:MFT01-10 9
FractionalFouriertransformoforderα:MFRFTcos(α)sin(α)-sin(α)cos(α) 10
Thinlensoffocallengthf:ML10-1λf1 11
Scaling:MSaj,j+100aj,j+1-1 12

where MS scales with Ψj+1(xj+1)(1/aj,j+1)Ψj(xj+1/aj,j+1), the kernel for ML is e-ıπx12/(λf) and mλ2πħ/(λc) is defined in the Methods section after discussing (47).

Figure 3.

Figure 3

Photonic QPC architecture composed of classical light source, MPD set-up composed of N-1 diffraction planes with Kj slits on jth plane, general LCT phase-space optics represented with the matrix elements LCTj,j+1 between the planes indexed with j and j+1, and a single sensor plane on which exponentially increasing number of propagation paths interfere. Each LCTj,j+1 is implemented with sections of FSP for the lengths of La,j,j+1 and Lb,j,j+1, and a thin lens of focal length fj,j+1 between them.

The varying forms of wave functions on the measurement plane extending (2) are modeled which are promising to be utilized in QC applications. It is presented next such that obtained forms are similar to (2) while having higher flexibility of system design. The theoretical modeling of BB functions for quantum HO based or FRFT based light propagation modeling with Gaussian sources is presented next with the wave function in (16). Gaussian source case is also extended to arbitrary LCTs. Similarly, the wave functions for arbitrary LCTs with HG sources are presented in (25) and (27) next.

An arbitrary LCT with the matrix parameters {aj,j+1,bj,j+1,cj,j+1,dj,j+1} is implemented in phase-space optics by consecutive applications of FSP of length La,j,j+1, then thin lens of focal length fj,j+1, and another FSP of length Lb,j,j+135. LCT matrix MLCT is calculated as follows:

MLCT12πħτb,jmλ0110-1λfj,j+1112πħτa,jmλ01 13

where τa,jLa,j,j+1/c and τb,jLb,j,j+1/c, and the middle matrix is for the effect of thin lens34. FRFT with scaling is a special case of LCT as discussed in the Methods section. Therefore, FSP, FRFT and arbitrary LCT based QPC set-ups are implemented with the universal configuration in Fig. 3.

QPC with Fresnel diffraction and FRFT by using Gaussian sources

Firstly, two special cases of LCTs are considered, i.e., FSP of light and propagation modeled with FRFTs denoting graded-index media propagation as the solution of the quantum HO in Ref.15. Furthermore, we assume that the source distribution has a Gaussian form of Ψ0(x0)=exp(-x02/(2σ02))/σ0π while HG waveforms as eigenfunctions of FRFTs34 are considered for the general case of LCTs in the next section. It is assumed that the optical system between the planes results in the kernels KFS(x1,x0) and KHO(x1,x0) defined in (45) and (47) based on Fresnel diffraction integral for free space and quantum HO solution15, respectively. The definition and the derivation of HO based kernel with the following kernel matrix for the propagation duration of t01 are detailed in the Methods section while we are discussing the quantum mechanical modeling of FO, i.e., denoting with quantum FO:

MHO=cos(ωt)2πħt01sin(ωt)mλ-mλsin(ωt)2πħt01cos(ωt) 14

The important observation is that iterative integration with KHO(x1,x0) results in the final intensity distribution of MPD with the same form of KFS(x1,x0) while with different algorithms for calculating the iteration parameters as shown in Table 1 in the Methods section. The kernel KFS(x1,x0) has the same form with Km,FS(x1,x0) used for QPC modeling in Ref.6 by replacing the electron mass m with the photon equivalent mass mλ. Therefore, the same formulations are utilized for the cases of FS and HO solutions while modeling the sampled wave function on the sensor plane with iterations and the resulting structure of problem solving capabilities.

Table 1.

Iteration parameters for FPI modeling of MPD with the kernels KHO and KLCT(a,b,c,d) for Gaussian sources.

Formula for KHO based MPD (ωtj,j+1/πZ) Formula for KLCT(a,b,c,d) based MPD (bj,j+10)
Ψ0(x0)=exp(-x02/(2σ02)) / σ0π & Ψ1(x1)=χ0exp(A0x12+ıB0x12)
A0 -m^02σ02/(2cos2(α0)m^02σ04+2λ02) -2π2σ02/(4π2a012σ04+b012)
B0 cos(α0)m^0λ02-sin2(α0)m^02σ04/(2λ0(cos2(α0)m^02σ04+λ02)) πd01/b01-4π3a01σ04/(b01(4π2a012σ04+b012))
χ0 π-1/4m^0σ0/(cos(α0)m^0σ02+ıλ0) exp-ıπ/42πσ0/(b01-2ıπa01σ02)
Ψ2,n(x2)=χ0χ1,nexpA~1,nx22+ıB~1,nx22+C1,nx2+ıD1,nx2
A~1,n β~1,n2m^1222A0β~1,n2-1/(2ζ~1,n) 2π2β~1,n2(2A0β~1,n2-1)/ζ~1,n
B~1,n (2B0β~1,n4m^122cos(2α1)+cos(α1)λ1m^12ϱ1)/(2ζ~1,n)-β~1,n4m^123cos(α1)sin2(α1)/(2λ1ζ~1,n) πd12ζ~1,n-4πβ~1,n4(πa12+B0b12)/(b12ζ~1,n)
χ1,n, C1,n, D1,n ξ~1,nexp(p~1,1,nx1,n2), ζ~1,c,nx1,n, ζ~1,d,nx1,n
Ψj+1,n(xj+1)=χ0(k=1jχk,n)e(A~j,n+ıB~j,n)xj+12+(Cj,n+ıDj,n)xj+1 for j[2,N-1]
p~2,j,n,p~3,j,n,p~4,j,n,p~5,j,n β~j,n2p~3,j,n/2,-λj/(ıς~j,n),β~j,n2ζ~j,c,n,-β~j,n2ζ~j,d,n β~j,n2p~3,j,n/2,ς~j,n/ζ~j,n,β~j,n2ζ~j,c,n,-β~j,n2ζ~j,d,n
A~j,n β~j,n2m^j22A~j-1,nβ~j,n2-1/(2ζ~j,n) 2π2β~j,n2(2A~j-1,nβ~j,n2-1)/ζ~j,n
B~j,n m^j(2B~j-1,nβ~j,n4cos(2αj)m^j+cos(αj)λjϱ~j,n)/(2ζ~j,n)-(β~j,n4m^j3cos(αj)sin2(αj))/(2λjζ~j,n) πdj,j+1ζ~j,n-4πβ~j,n4(πaj,j+1+B~j-1,nbj,j+1)(bj,j+1ζ~j,n)
Cj,n, Dj,n ζ~j,c,nxj,n+p~4,j,nCj-1,n+p~5,j,nDj-1,n, ζ~j,d,nxj,n-p~5,j,nCj-1,n+p~4,j,nDj-1,n
χj,n ξ~j,nexp(p~1,j,nxj,n2)×exp(p~2,j,n(Cj-1,n+ıDj-1,n)2)×exp(p~3,j,n(Cj-1,n+ıDj-1,n)xj,n)
The following variables defined for j[1,N-1]
λj or λ~j,n ħtj,j+1 bj,j+1(A~j-1,n+ıB~j-1,n)+ıπaj,j+1
p~1,j,n -(2λj(A~j-1,n+ıB~j-1,n)+ıcos(αj)m^j)/(2ıς~j,n) λ~j,n(bj,j+1-2β~j,n2λ~j,n)/ζ~j,n
ς~j,n, ξ~j,n β~j,n2(cos(αj)m^j+2λj(B~j-1,n-ıA~j-1,n))+ıλj,β~j,n2m^j/ς~j,n bj,j+1(bj,j+1-2β~j,n2λ~j,n),2πβ~j,n2/(ı(bj,j+1-2β~j,n2λ~j,n))
ϱ~j,n 4β~j,n4(A~j-1,n2+B~j-1,n2)-4A~j-1,nβ~j,n2+1
ζ~j,n 4B~j-1,nβ~j,n4cos(αj)λjm^j+β~j,n4cos2(αj)m^j2+λj2ϱ~j,n bj,j+12ϱ~j,n+4πaj,j+1β~j,n4(πaj,j+1+2B~j-1,nbj,j+1)
ζ~j,c,n β~j,n2m^j(2B~j-1,nλj+cos(αj)m^j)/ζ~j,n 4πβ~j,n2(πaj,j+1+B~j-1,nbj,j+1)/ζ~j,n
ζ~j,d,n λjm^j(2A~j-1,nβ~j,n2-1)/ζ~j,n 2πbj,j+1(2A~j-1,nβ~j,n2-1)/ζ~j,n

The wave function for nth path on the sensor plane for the general case of non-uniform slit widths is given by the following by using the iterative formulation:

ΨN,nG(xN)=χ0(j=1N-1χj,n)e(A~N-1,n+ıB~N-1,n)xN2e(CN-1,n+ıDN-1,n)xN 15

It is further simplified by extraction of xN-1,n dependent parts and summing the contributions from each path as follows:

ΨNG(xN)n=0Np-1ΨN,nG(xN)=n=0Np-1Υ~N,nGexN-1,nTH~N-1,nHO/GxN-1,ne(A~N-1,n+ıB~N-1,n)xN2e(h~N-1,nTxN-1,n)xN 16

where Υ~N,nGχ0(j=1N-1ξ~j,n), and the complex vector h~N-1,n and the matrix H~N-1,nHO/G are defined in the Methods section for the HO case with simplified formulation compared with the case for electron based FSP set-up in Ref.6. The corresponding iteration parameters are given in Table 1 in the Methods section.

We have not included the effects of special forms of KHO(xj+1,xj) with ωtj,j+1=kπ for kZ corresponding to integer multiples of FRFT order 2 since the result is Ψj+1(xj+1)Ψj(±xj+1) (inserting ±xj+1 into Ψj(xj) )34. This case can be simply realized by assuming that spatial filtering operations of the slits on jth and (j+1)th planes are combined on a single plane by also noting that whether the wave function is reversed or not. For example, multiple inter-plane propagation intervals can result in multiple reversals with the overall effect of the identity and combined spatial filtering of Gaussian slits.

QPC with arbitrary linear canonical transforming optical systems

Gaussian Sources The resulting final intensity of MPD propagation for the case of KLCT(a,b,c,d) (bj,j+10) with Gaussian sources has the same form with KHO while with different algorithms for calculating iteration parameters in Table 1 in the Methods section and replacing H~N-1,nHO/G with H~N-1,nLCT/G. Therefore, all the derivations utilized for KHO including the explicit forms of the wave function are applicable. We have not included KLCT(aj,j+1,bj,j+1,cj,j+1,dj,j+1) with bj,j+1=0 for simplicity. Two simple cases are scaling and chirp multiplication with aj,j+1=dj,j+1=1 resulting in Ψj+1(xj+1)exp(ıπcxj+12)Ψj(xj+1)34. These cases further improve the flexibility of the LCT system to realize the desired transformation on the wave function.

A simple example is presented with explicit expressions as follows for K1=3, K2=2, N=3, bj,j+10 for j[0,2], fixed slit width parameters β1 and β2 for simplicity and x2,nTX1,sn,1X2,sn,2:

Ψ3G(x3)=n=05Υ3Gex2,nTH2LCT/Gx2,ne(A2+ıB2)x32e(h2Tx2,n)x3 17

where the following parameters are derived by using Table 1 in the Methods section:

H2LCT/G=pol1(β2,σ0)pol2(β1,β2,σ0)0pol3(σ0)ıpol2(β1,β2,σ0)pol4(β1,σ0)pol2(β1,β2,σ0) 18
h2T=pol5(β1,β2,σ0)pol6(β1,β2,σ0)pol7(β1,β2,σ0)pol6(β1,β2,σ0)+ıpol8(β1,β2,σ0)pol6(β1,β2,σ0)pol9(β1,β2,σ0)pol6(β1,β2,σ0) 19
Υ3G=-2(-1)3/42π5/4pol10(β1,β2,σ0)pol11(β1,β2,σ0) 20
A2+ıB2=pol12(β1,β2,σ0)pol13(β1,β2,σ0)+ıpol14(β1,β2,σ0)b23pol13(β1,β2,σ0) 21

where it is observed that the parameters are some rational complex polynomials of β1, β2 and σ0 with the coefficients in terms of polynomial expressions of aj,j+1, bj,j+1 and dj,j+1 for j[0,2] with varying orders of (β1, β2, σ0): reaching (0, 2, 2) for pol1; (2, 2, 2) for pol2; (0, 0, 2) for pol3; (2, 0, 2) for pol4; (6, 4, 8) for pol5, pol7, pol8 and pol9; (8, 4, 8) for pol6, (4, 2, 5) for pol10; (4, 2, 6) for pol11; (4, 4, 4) for pol12, pol13 and pol14.

The highly complicated expressions for the polynomials are explicitly shown in Table 2 in the Methods section such that they are obtained by using the iteration method in Table 1 in the same section. It is possible by using the explicit expressions directly to perform various gedanken experiments and computational complexity analysis with any number of slits and LCTs.

Table 2.

Polynomial expressions in (18-21) for the case of N=3 and Gaussian source with σ0 (bj,j+10 for j[0,2]).

pol1 π(-2ıb01q7πβ22-2π(2π(a01q7-b12q12)β22+b12b23ıq19)σ02+b01b12b23q11)
pol2 2π(4β12π2(a01q7-b12q12)β22-a01b01b122b23+2b12ıπq17)σ02+b01(4β12ıπ2q7β22+b01b122b23(-ı)-2b12q23π)
pol3, pol4 -2b01b12b23π(2a01πσ02+b01ı), π(b01(b01b12q12-2ıβ12q7π)-2π(2π(a01q7-b12q12)β12+a01b01b12ıq12)σ02)
pol5 -4β22b012b123b23π2q20(b122b014+4β12π2q13b012+4π2σ02(2β12q14b012+(4π2q28β12+a012b012b122)σ02))
pol6 (4b012π2q112β14+b014b122+4π2σ02(2β12b012b122+(4π2q192β14+a012b012b122)σ02))×((16β14π4q72β24+b012b124b232+4b122π2q8)b012+4π2σ02(2β12b012q9b122+q22σ02))
pol7, pol10 16β12β24b01b12π4(4a01π2q19σ04+b012q11)q29, ıβ12β22b01b12σ0(b01-2ıa01πσ02)(b01(b01b12-2ıβ12q11π)-2πq18σ02)
pol8 -8β12β22b01b122b23π3(4a01π2q19σ04+b012q11)(b122b014+4β12π2q13b012+4π2σ02(2β12q14b012+(4π2q28β12+a012b012b122)σ02))
pol9, pol12 -8β24b012b122π3q20q29, 2β22b122π2(-4β12q13π2b012-8β12π2q14σ02b012-4(4π4q28β12+a012b012b122π2)σ04-b014b122)
pol11 (2a01πσ02+b01ı)(2πq15σ02+b01(2πq11β12+b01b12ı))×(b01q16-2π(4β12π2(a01q7-b12q12)β22-a01b01b122b23+2b12ıπq17)σ02)
pol13 (16β14π4q72β24+b012b124b232+4b122π2q8)b012+4π2σ02(2β12b012q9b122+q22σ02)
pol14 4π3σ02(σ02(a012b012b124b232d23+16π4β14β24q4(a01q7-b12q12)+4π2b122q1)+2β12b012b122(4π2β22q6+b122b232d23))+πb012(16π4β14β24q5q7+b012b124b232d23+4π2b122q2)
The functionsqjforj[1,30]utilized while defining the polynomials are defined as follows:q1b122b232d23β14-2a01b12b232q11d23β14+a012q2,q2a232b012b122d23β24-a23b012b12q27β24+b23q3,q3b23d23q112β14+2β22b012b23d23β12+β24b012d12q26,q4b12(b12-q12d23)-a01b12q11+a01d23q7,q5-b01b23d23+a12b01q25+b12d01q25,q6(β12b232+β22q122)d23-β22b12q12,q7-b01b23+a12b01q12+b12d01q12,q8a232b012b122β24+2a23b012b12b23d12β24+b232q24,q94π2(β12b232+β22q122)β22+b122b232,q10(b12q12-a01q7)2,q11a12b01+b12d01,q12a23b12+b23d12,q13b122d012β12+2a12b01b12d01β12+(a122β12+β22)b012,q142β12π2β22+b122,q15a01b01b12-2ıβ12q19π,q16-4ıβ12q7π2β22+b01b122b23ı+2b12πq23,q17a01q23-β12b12b23,q182πq19β12+a01b01b12ı,q19a01a12b01-b12+a01b12d01,q20b012+4π2σ02(β12+a012σ02),q21b122b232β14-2a01b12b232q11β14+a012q8,q2216β14π4q10β24+a012b012b124b232+4b122π2q21,q23b23q11β12+a23β22b01b12+β22b01b23d12,q24a122b012β14+b122d012β14+2a12b01b12d01β14+2β22b012β12+β24b012d122,q25b23d12d23+b12(a23d23-1),q26b23d12d23-b12,q27b12-2b23d12d23,q28q13a012-2β12b12q11a01+β12b122,q294b012π2q11q7β14+b014b122q12+4π2σ02(2β12b012q12b122+q30σ02)and finallyq304π2q19(a01q7-b12q12)β14+a012b012b122q12.

A simple numerical example is presented as shown in Fig. 4. The scaling property of thin lens is utilized in the Numerical Results section to improve the intensity of the diffraction on the final detection plane. For example, a simple Gaussian source beamwidth of σ0=20 (μm) and λ=650 (nm) shown in Fig. 4b is scaled by shifting the position of the lens of focal length 60 (mm) inside the interval of fixed length of L01=La,01+Lb,01=t01×c with t01=1 (ns) as shown in Fig. 4a. The shift is modeled with the ratio rL=La,01/L01. It is observed in Fig. 4c that the intensity of the wave function can be focused with respect to the positions of the slits on the first plane.

Figure 4.

Figure 4

(a) The set-up with a single thin-lens of focal length 60 (mm), (b) Gaussian source with σ0=20 (μm) and λ=650 (nm), and (c) the distribution of the wave function on the first plane by shifting the lens inside the spatial interval of fixed total length L01=t01×c with t01=1 (ns) by varying the ratio of rL=La,01/(La,01+Lb,01).

Hermite-Gaussian Sources If the source is chosen as the standard HG waveform of Ψ0(x0)=(21/4/W02ll!)exp(-πx02/W02)Hl(2πx0/W0) for KLCT(aj,j+1,bj,j+1,cj,j+1,dj,j+1) (bj,j+10) where Hl(x)(-1)lex2dle-x2/dxl is the lth order Hermite polynomial34,65, then ΨN,n(xN) for nth path is obtained as follows by using the integral equality of HG functions in the Methods section:

ΨN,nHG(xN)=χ01(j=1N-1χj,j+1,n)eu~N-1,N,nxN2evN-1,N,nxNHl(g~N-1,N,nxN+hN-1,N,n) 22

where the parameters χ01, χj,j+1,n, u~j,j+1,n, vj,j+1,n, g~j,j+1,n and hj,j+1,n obtained in an iterative manner for j[1,N-1] are calculated with simple algebra for nth path and shown in Table 3 in the Methods section. Simple algebraic manipulations of (22) to extract xN-1,n dependent parts result in the following simplification:

ΨN,nHG(xN)=χ01(j=1N-1χ~a,j,j+1,n)e-ıπ(N-2)4exN-1,nTH~N-1,nLCT/HGxN-1,n×e(γ~N-1,nTxN-1,n)xNeu~N-1,N,nxN2Hl(g~N-1,N,nxN+η~N-1,nTxN-1,n) 23

where χ~a,j,j+1,n for j[1,N-1] is defined in Table 3, the vectors γ~N-1,n and η~N-1,n, and the matrix H~N-1,nLCT/HG are defined in the Methods section. It is observed in (23) that each different path results in a different shift on Hermite polynomial determined with η~N-1,nTxN-1,n even for the uniform βj for each slit on jth plane. As a result, the final wave function on the sensor plane denoted with ΨNHG(xN) for the general case of non-uniform slit widths defined with β~j,n for j[1,N-1] and n[0,Np-1] is given by the following:

ΨNHG(xN)=n=0Np-1ΨN,nHG(xN) 24
=n=0Np-1Υ~N,nHGexN-1,nTH~N-1,nLCT/HGxN-1,neu~N-1,N,nxN2e(γ~N-1,nTxN-1,n)xNHl(g~N-1,N,nxN+η~N-1,nTxN-1,n) 25

where Υ~N,nHGχ01(j=1N-1χ~a,j,j+1,n) e-ıπ(N-2)/4 and with the similarity to the form in (16) for the HO solution except multiplicative Hermite polynomial for each nth path. The complexity of calculating the Gaussian form in (16) is classically hard as thoroughly discussed in Ref.6 which requires to compute a special form of partial sum of RTF while the complex vector h~N-1,n and the matrix H~N-1,nHO/G varying for each path making it much harder compared with the computation of conventional partial sum of RTF. Therefore, the complexity characterization of computing ΨNHG(xN) is an open issue while it is expected to be significantly hard since each summation term depends on path index n with varying vector and matrix parameters while also including a product term of Hermite polynomial for each path making it harder.

Table 3.

Iteration parameters for FPI modeling of MPD with the kernel KLCT(a,b,c,d) for Hermite-Gaussian sources (bj,j+10).

Symbol Formula Symbol Formula Symbol Formula
Ψ0(x0)=(21/4/W02ll!)exp(-πx02/W02)Hl(2πx0/W0) and Ψ1(x1)=χ01expu01x12Hl(g01x1)
g01 2πW02a012W04+b012 u01 -πW02a012W04+b012+ıπd01b01-πW02a01W02b01a012W04+b012 χ01 21/4W02ll!a01W02-ıb01a012W04+b012a01W02-ıb01a012W04+b012l
Symbol Formula Symbol Formula Symbol Formula Symbol Formula Symbol Formula
Ψ2,n(x2)=χ01χ12,nexpu~12,nx22+v12,nx2Hl(g~12,nx2+h12,n)
τ~1,n -b12+2β~1,n2τa,1 u~12,n 2π2β~1,n2+ıπd12τ~1,nb12τ~1,n v~a,12,n ı2πτ~1,n h~a,12,n -b12g01τ~1,nΓ~1,n θ~12,n b12u01+ıπa12τ~1,n
χ~a,12,n 2πıβ~1,n2τ~1,nΓ~1,nτ~1,nl/2 g~12,n 2ıπβ~1,n2g01τ~1,nΓ~1,n v12,n v~a,12,nx1,n h12,n h~a,12,nx1,n χ12,n χ~a,12,ne-θ~12,nx1,n2
Symbol Formula Symbol Formula Symbol Formula Symbol Formula
Ψj+1,n(xj+1)=χ01(i=1jχi,i+1,n)exp(u~j,j+1,nxj+12+vj,j+1,nxj+1)Hl(g~j,j+1,nxj+1+hj,j+1,n) for j[2,N-1]
τ~j,n -bj,j+1+2β~j,n2τ~a,j,n u~j,j+1,n 2π2β~j,n2+ıπdj,j+1τ~j,nbj,j+1τ~j,n v~a,j,j+1,n ı2πτ~j,n Γ~j,n 2β~j,n2bj,j+1g~j-1,j,n2+τ~j,n
θ~a,j,j+1,n -β~j,n2bj,j+12τ~j,n θ~b,j,j+1,n -bj,j+1τ~j,n θ~c,j,j+1,n -bj,j+1u~j-1,j,n+ıπaj,j+1τ~j,n h~c,j,j+1,n -β~j,n2bj,j+1g~j-1,j,nτ~j,nΓ~j,n
h~a,j,j+1,n τ~j,nΓ~j,n h~b,j,j+1,n -bj,j+1g~j-1,j,nτ~j,nΓ~j,n χ~a,j,j+1,n 2π-β~j,n2τ~j,nΓ~j,nτ~j,nl/2 g~j,j+1,n 2ıπβ~j,n2g~j-1,j,nτ~j,nΓ~j,n
hj,j+1,n hj-1,j,nh~a,j,j+1,n+h~b,j,j+1,nxj,n+vj-1,j,nh~c,j,j+1,n vj,j+1,n v~a,j,j+1,n×(xj,n+β~j,n2vj-1,j,n) χj,j+1,n χ~a,j,j+1,nexp(vj-1,j,nθ~b,j,j+1,nxj,n+θ~c,j,j+1,nxj,n2+vj-1,j,n2θ~a,j,j+1,n-ıπ4)

If the uniform slit width case is chosen and the path independent variables are denoted with Υ~N,nHG=ΥNHG, χ~a,j,j+1,n=χa,j,j+1, H~N-1,nLCT/HG=HN-1LCT/HG, γ~N-1,n=γN-1, u~N-1,N,n=uN-1,N, g~N-1,N,n=gN-1,N, η~N-1,n=ηN-1, then (25) is transformed into the following:

ΥNHGeuN-1,NxN2n=0Np-1exN-1,nTHN-1LCT/HGxN-1,ne(γN-1TxN-1,n)xNHl(gN-1,NxN+ηN-1TxN-1,n) 26

It is further simplified as follows by using the useful identity Hl(x+y)=(H+2y)l in Ref.66 where HkHk(x):

ΨNHG,U(xN)=ΥNHGeuN-1,NxN2n=0Np-1e(γN-1TxN-1,n)xNexN-1,nTHN-1LCT/HGxN-1,n(H(xN)+2ηN-1TxN-1,n)l 27

where (H(xN))kHk(gN-1,NxN). The computational complexity of calculating ΨNHG,U(xN) is similarly expected to be significantly hard since the mathematical form is more complicated compared with the partial sum of RTF.

The set-up parameters including the slits, lenses and inter-plane distances are required to be tuned in order to obtain the desired vectors h~N-1,n, γ~N-1,n, η~N-1,n and matrices H~N-1,nHO/G, H~N-1,nLCT/G and H~N-1,nLCT/HG in (16), (25) and (27) for the targeted number theoretical problems. Next, Wigner distribution is defined where its negative volume is regarded as an indicator of non-classicality.

Wigner distribution, negativity and path magnitudes

The momentum domain wave function Ψp,j(pj) is defined as Fourier transform of spatial representation of wave function Ψj(xj) on jth plane as follows:

Ψp,j(pj)=12πħdxjΨj(xj)exp(-ıxjpj/ħ) 28

The distribution of energy through space-momentum phase-space is described by Wigner distribution function defined as follows6,42:

Wj(xj,pj)=1πħdyΨj(xj-y)Ψj(xj+y)eı2pjyħ 29

The negative volume of Wigner function defined in Ref.42 and utilized in Ref.6 to describe the increasing non-classicality or time-domain entanglement resources in Ref.12 is described as Vj (|Wj(xj,pj)|dxjdpj-1)/2. On the other hand, the probability of the particle to be detected on jth plane, i.e., to be diffracted through (j-1)th plane, is computed as follows:

PE(j)dxj|Ψj(xj)|2 30

In this article, the increasing interference complexity and non-classical nature of MPD based time-domain entanglement resources are assumed to be characterized by utilizing Vj and by observing the magnitudes of the interfering paths defined as PE,n(j)dxj|Ψj,n(xj)|2 for each nth path. Therefore, more paths with large magnitudes and Vj emphasize increasing interference and non-classicality. Characterizing the correlation between the distribution of path magnitudes and Vj is an open issue since the behavior is highly set-up specific as observed in the Numerical Results section. On the other hand, path magnitudes throughout the whole plane may not reflect their localized characteristics such as effecting some sample locations more compared with the others. Therefore, it is an open issue to characterize the interference complexity in terms of the intensity distribution of the paths while the path magnitudes are taken as a reference for simplicity in this article. Next, the potential future applications of QPC architecture based on FO are presented.

Future applications

Applications for quantum supremacy and certified random number generation

The scalable structure of QPC with coherent light sources and low complexity FO promise the large scale implementation of QS experiments. Recently, some experiments are performed with 53 qubits with superconductor based architectures of Google as a milestone for the human history of computational capabilities1,2. In this article, we propose that a similar experiment could be formulated in the QPC set-up as the problem of finding the distribution of light intensity on the photodetector array plane by randomly generated slit positions and widths analogical to random circuit sampling45,67. Figure 5a shows the system architecture that is similar to the randomly generated quantum gates. The aim is to perform a complexity analysis of a randomly generated QPC architecture. The total number of Feynman paths is expressed as follows for L diffraction planes:

Npath=(i=1L-1i)mL-1kL 31

Suppose that energy decreases by 1/s (s>1) to a total of 1/sL and the number of significant paths decreases by 1/r (r>1) leading to a decrease in the total number of effective paths by 1/rL approximating the final intensity distribution. Therefore, if we define the number of paths that can be realized for unit source energy with N~path, then the following is obtained:

N~path=Npath1sL1rL 32
=(i=1L-1i)mL-1kL1sL1rL 33

If we measure the Hilbert space size created by the total number of paths by defining the virtual qubit number and assuming s2s, r2r, m2m22 (assuming the minimum of m=8 with m=1), k2k, then the following definition is obtained:

qpathlog2(N~path) 34
=log2((L-1)!)-2-m+L(2+m+k-s-r) 35

The basic expression determining the size of the Hilbert space is denoted with the gain G=m+k-s-r. It provides the cumulative effect of increasing number of paths due to the linearly increasing number of the slits with the coefficient m and the initial number of the slits k combined with the decreasing number of paths due to the inter-plane attenuation coefficients s and r for the effective number of the paths. As shown in Fig. 5b for L=N-1, even at very low gain rates, e.g., G=-5 with m=1 , that is, where the spreading energy drops very quickly and the number of significant paths is too low, the number of virtual qubits reaches hundreds. Furthermore, m+k, which can be designed flexibly in a multi-slit architecture, is adapted against the low gain. In addition, even with N=10 planes, Hilbert space size of approximately reaching hundreds of virtual qubits is obtained for the case of high gain G. For example, assume the worst case situation such that diffracted photon forms a large amplitude path by diffracting through a locally limited number of slits on the next plane denoted by the parameter r~. In other words, the slit locations distant apart on consecutive planes will not form a large amplitude path and the number of effective paths increases as the multiplication by r~j after diffracting through j consecutive planes (by assuming there is enough number of closely spaced slits on the next plane). This can be adjusted by increasing the inter-plane distance such that each diffracted beam will expand to a larger area on the consecutive plane. Moreover, assume that the slits are placed close enough to keep the probability of the diffraction through the next plane roughly constant, i.e., 1/s, as observed in MPD simulation studies in Ref.6. Then, if the condition s<r~ is satisfied, the number of effective paths will increase with the multiplication by (r~/s)j through j consecutive planes. For example, effective number of paths in Ref.6 is observed to be increasing with (r~/s)3>70 even by removing many effective paths (Fig. 7(b) in Ref.6). In other words, assuming r~/s22 allows to reach 2100 effective Feynman paths with N51 planes. Therefore, without requiring extensive simulations, it is clear that the number of paths increases exponentially with specially adjusted set-up parameters of inter-plane distance, slit widths and distributions.

Figure 5.

Figure 5

(a) The special QPC design with N-1 planes diffracts the quantum wave function expanding with planes consisting of a linearly increasing number of slits. The positions of the planes (dj), the number of slits (k) in the first plane and the linear increment ratio m, i.e., the number of slits growing with j×m×k, allow flexible design according to the width of the laser beam. (b) The virtual qubit Hilbert space size corresponding to the number of Feynman paths versus the number of planes for varying gain variable (G). QS experiments of Google have recently been performed with 266 Feynman paths1. Even at significant loss rates of the QPC system, thanks to dozens of planes, the Hilbert space size reaches hundreds of virtual qubit levels and achieves very strong QS capability. It is promising as an alternative system design for next generation QS experiments.

Each path will form a unique contribution to the overall intensity. There is no apparent way of calculating the exact final intensity other than identifying and summing the contribution of each path. Then, increasing the complexity of MPD set-up makes it harder to calculate the contribution of each path until reaching to the QS scale. It is possible to compare roughly with Google QS experiment where the computational complexity requires the calculation of 431×24=266 different Feynman paths for 53 qubits and 20 cycles (Table XI in Ref.1) as shown in Fig. 5b. Compared to the qpath=66, the proposed QPC system architecture suggests to perform future QS experiments with a simple system structure.

The open issues include the rigorous characterization of the computational complexity of sampling from MPD exploring the relations among the paths in terms of magnitude and distribution. Furthermore, the inter-plane gain G is required to be both theoretically modeled and experimentally measured for random and large diffraction architectures. Another open issue is to analyze the modeling of the sampling problem of QPC with universal quantum circuits and to determine the computational complexity class, e.g., the relations with BQP10 and complexity theoretical fundamentals of QS experiments47. Experimental implementation requires slit design and manufacturing, sensitive photon detection due to the attenuation after large number of planes and spatially coherent light sources covering all the paths reaching to the detector plane. The number of slits, i.e., determined by the parameters k, m and N, is limited by the capability to realize significant number of small width slits, e.g., in micrometer scale, on an appropriate planar surface such as by patterning metallic slits on glass substrate68. The beam width and inter-planar distances should be adapted for spatial coherence of the light diffracting through planes12. However, the linear modeling of the architecture in Fig. 5a and the expansion of light beam through propagation allow to realize a feasible architecture in future experimental implementations.

On the other hand, achieving QS experiments allows to adapt certified random number generation protocols for the QPC architecture4346. Although there are recent high speed, e.g., on the orders of several Gbit/s, random number generation protocols working in a local manner and exploiting the sampling of interference based intensity fluctuations of laser pulses such as Refs.69 and70, the idea of randomness extraction from QS experiments proposed by Aaronson43 in a way allowing to download from a remote and trusted public source is new. The user interacts with a remote QC and makes it to generate random bits without any trust to the QC itself. Similar to Aaronson’s protocol, it is possible to firstly collect random numbers from a trusted computer. Then, using these numbers, the widths and planar distributions of the slits are determined to have a random diffraction set-up by assuming that the mechanical structure of the device can be modified remotely. Then, intensity distribution in the photodetector array is measured. Therefore, both the random structure of MPD set-up and interference of the exponential number of paths result in a very difficult measurement output intensity to efficiently calculate with classical computers. However, it is an open issue whether it is possible to utilize the proposed remote QC device based on QPC similar to the Aaronson’s protocol which realizes sampling from the n-qubit output of the quantum circuit and performs Heavy Output Generation (HOG) tests. On the other hand, QPC does not allow to sample the probability of a single path but the interference of exponentially many number of paths. Therefore, it is a challenge and open issue to adapt the interference sampling operation in QPC for a similar complexity theoretical proof of randomness generation.

Neuromorphic applications with quantum neuron implementations

In a classical artificial neuron implementation, the output is represented as O=f(i=1wixi+b) where f(.) is the nonlinear activation function, wi is the ith synaptic weight, xi is the ith input and b is the bias as shown in Fig. 6a. QPC based neuron has inherent nonlinearity with the form of f(xTHx+xTh+b) between the input slit position vector x and output (O) as shown in Fig. 6b based on the MPD formulation for Gaussian sources in (16). The quadratic weighting xTHx, linear weighting xTh and bias b are fed into the nonlinear function f(.)exp(.) for the LCT set-up where HH~N-1,nLCT/G, hh~N-1,nxN, the bias blog(Υ~N,nG)+(A~N-1,n+ıB~N-1,n)xN2, xxN-1,n and xxN is the measurement position.

Figure 6.

Figure 6

(a) Classical artificial neuron implementation with the weight and input vectors of w and x, respectively, activation function f(.), bias b and the output O. (b) QPC based design of QNNs with quadratic weighting relationship of xTHx+xTh+b and nonlinear activation f(.)exp(.) having quantum superposition and interference combining the inputs.

The example output through the slits Yj for j[1,2] in Fig. 6b depends on interfering quantum superposition of input combinations as follows while assuming path independent forms of the variables for simplicity, i.e., HHN-1LCT/G, hhN-1xN and blog(ΥNG)+(AN-1+ıBN-1)xN2:

Oy[Y1,Y2]G(y,βN,xN)x1[X1,1,X1,2]x2[X2,1,X2,2]xN-1[XN-1,1,XN-1,2]f(xTHx+xTh+b) 36

where G(y,βN,xN) is the slit mask function depending on the output slit y=Yi for i[1,2] of the Nth plane and βN is the fixed slit width with path-independent assumption for simplicity. The parameters are possible to depend on each path with variable slit masks. Exponentially large number of synaptic chains (paths) through slit inputs, their quantum interference and simplicity to sample the intensity output |O|2 provide significant opportunities to exploit for quantum advantages.

The challenges include designing the quantum neuron based on the slit positions as inputs while changing the weight in a controllable manner. Besides that, extensive simulation studies are required to practically observe the quantum advantages for various problems. The positions of the slits are required to be modified dynamically with special designs. In addition, large scale QNN implementations both in simulations and experiments are required to observe the performances in various problems, e.g., pattern recognition or machine learning for very large problem sizes.

Solution of nonlinear Schrödinger equation

Finite-band solutions of NLSE in (1) are expressed with RTF as follows60,61:

q(x,t)=q(x0,t0)eık0x-ıω0tΘ(-ıY,ıπ2(kx+ωt+δ-))Θ(-ıY,ıπ2(kx+ωt+δ+)) 37

where Riemann spectrum is (Y,k,ω,δ-,δ+), Riemann period matrix Y71 is calculated using k and ω together with nonlinear spectrum data (Appendix to Section 24 in Ref.51) and the partial sum of RTF denoted as ΘM converging to Θ for M is defined as follows:

ΘM(Γ,y)a1=-MMaN-1=-MMe-πaTΓae2πyTa 38

where Γ is a complex matrix, y is a complex vector and aT[a1a2aN-1]. As shown in Ref.6, if j[1,N-1] and ajSM[-M,M], we select Xj,iSMΔxj and also if the slit widths are kept constant for each plane, then As, Bs, Υs, Hs, cs and ds values become path independent, i.e., AN-1, BN-1, ΥN, HN-1, cN-1 and dN-1 while the superscript (.)LCT/G removed for simplicity, and (2) is transformed as follows for xkTs:

I[k]e2AN-1k2Ts2|ΥN|2=|ΘM(Γ^+Γ^T2,xD(cN-1+ıdN-1)2π)|2 39

where Γ^-DHN-1D/π and the diagonal matrix D is formed of the elements {Δx1,Δx2,,ΔxN-1}. In other words, we can achieve the absolute value of the partial sum of particular RTF by using the measurement result on the sensor plane. Although the calculation of RTF function is classically quite difficult6,51, it has important applications in areas including geometry, arithmetic and number theory50, nonlinear spectral theory for ocean and water sciences51, cryptography and the solution modeling of NLSEs60,61.

Measurements in the QPC system allow to obtain information about |q(x,t)|. The most important challenge for utilizing QPC in the solutions of NLSE is to determine the set equation parameters (Y,k,ω,δ±) which can be implemented with specific QPC design. Theoretical modeling and extensive simulations are required to examine all the practical sample parameters and systems in the literature where NLSE solutions are achieved with RTF based solution.

Next, numerical simulations are achieved to analyze the effects of FO based components such as lenses and HG sources on the intensity distribution obtained with QPC. Simulation studies for large scale implementations of QPC for future applications are open issues.

Numerical results

MPD set-up with two diffraction planes and single sensor plane is numerically analyzed for both Gaussian and HG sources with beam width and waist sizes of σ0=20μm and W0=200μm, respectively. The set-up is shown in Fig. 7 with N=3 planes. The source waveforms are shown in Fig. 8a,b, respectively. HG order is set to l=10 with highly oscillatory and negative initial V0 of 1.076. The wavelength of the light is chosen in the red spectrum of λ=650 nm while the low cost laser sources are commercially available in a wide spread manner.

Figure 7.

Figure 7

Photonic QPC set-up with Gaussian and HG classical monochromatic light source with λ=650 nm, two planes for diffraction with the number of slits K1=11 and K2=27, respectively, and specific set-up of (a) LCT and (b) FSP design with the only difference of the existence of thin-lenses of focal length of 63 mm in the LCT system.

Figure 8.

Figure 8

(a) Gaussian and (b) Hermite–Gaussian (order l=10) source waveforms with σ0=20μm and W0=200μm, respectively. (c) Slit positions with K1=11 and K2=27 slits (d) and the widths β~j,i for j[1,2] and i[1,Kj].

Two different set-ups composed of LCT and FSP systems as shown in Fig. 7a,b, respectively, are compared where the LCT system includes thin lenses between the diffraction planes while not included in the FSP system. The kernel based on HO in (47) giving FRFT as a special case of general LCT formulation is not numerically analyzed since LCT based system is a more general version while various combinations including FRFT systems are applicable with the formulation in Tables 1 and 3 in the Methods section. Therefore, two different set-ups with the kernels KFS in (48) and KLCTa,b,c,d in (6) for the inter-plane propagation are compared for the same design of set-up in terms of the properties of the slits and planes. Inter-plane distance vector is given by LT[31.530.750.9] (cm). The distances of the first plane to the first lens and the second plane to the second lens are denoted with the vector LaT[La,01La,12] where both the distances are set to 21 cm while the lenses of the focal length fT[f01f12]=[6363] mm focus the light intensity to more compact areas on the consecutive planes compared with FSP. It is assumed that the propagation between the second and third planes includes only FSP without any thin lens to simplify the set-up. K1=11 and K2=27 slits are used on the first and second planes, respectively. The slit positions and widths on the first plane, as shown in Fig. 8c,d, respectively, are adapted to the maximum intensity locations of HG source propagation on the first plane in LCT system while the ones on the second plane are chosen uniformly with the separation of 40μm and the width of β~2,jβ2=8μm. KLCTa01,b01,c01,d01 and KLCTa12,b12,c12,d12 are calculated by using (13).

FSP has less control over the propagation of light compared with LCT based FO. FSP spreads the light without any tuning to the slit positions by reducing the probability of the photon to reach to the consecutive planes after diffraction. Therefore, in numerical analysis, LCT is shown to improve the probability of photon detection on the sensor plane (PE) and also the negative volume of Wigner function compared with FSP. The vectors of PE(j) and Vj composed of the values on the first, second and third (sensor) planes for Gaussian sources are denoted with PEG,FSP and VG,FSP, respectively, for FSP while with PEG,LCT and VG,LCT for LCT. The cases with HG sources are denoted with the superscript of HG. It is an open issue to adapt LCT parameters with respect to any given set-up including inter-plane distances, slit locations and widths in a way to maximize the interference and the probability of the photon reaching to the sensor plane.

Hermite–Gaussian sources

The waveforms on the three planes in spatial domain are shown in Fig. 9a–c,e–g for FSP and LCT cases, respectively. It is observed that LCT focuses the light better on the slit locations while FSP reduces PE significantly. PEHG,LCT=[10.5150.202] is much more improved compared with PEHG,FSP=[10.0420.0062]. The magnitudes of the interfering paths are shown in Fig. 9d,h, for j=2 and j=3, respectively, while Wigner distributions on the second and third planes scaled with ħ are shown in Fig. 9i,j for FSP and, (k) and (l) for LCT. It is observed that LCT provides significantly larger path magnitudes while VHG,LCT=[1.0761.472.17] is also improved compared with VHG,FSP=[1.0761.281.25]. Observe that HG source has already negative Wigner volume of 1.076 which is much further improved by LCT set-up compared with FSP.

Figure 9.

Figure 9

HG source with the order of l=10 and W0=200μm is utilized where the resulting spatial domain waveforms on the planes with the indices (a) j=1, (b) j=2 and (c) j=3 for FSP, and (e) j=1, (f) j=2 and (g) j=3 for LCT. PE(n,j) for (d) j=2 and (h) j=3. Scaled Wigner distribution ħ×Wj(xj,pj) for FSP on the planes with (i) j=2 and (j) j=3, and for LCT with (k) j=2 and (l) j=3.

Gaussian sources

The waveforms in spatial domain for Gaussian sources are shown in Fig. 10a–c,e–g for FSP and LCT cases, respectively. PEG,LCT=[10.350.124] and PEG,FSP=[10.0770.0161] values are obtained where the magnitudes of the interfering paths are shown in Fig. 10d,h, for j=2 and j=3, respectively. Similar to the HG sources, LCT improves diffraction probabilities significantly compared with FSP. Wigner distributions scaled with ħ are shown in Fig. 10i–l having different characteristics compared with HG case in Fig. 9i–l. It is similarly observed that LCT provides significantly larger path magnitudes. VG,LCT=[00.8421.426] and VG,FSP=[01.210.93] are obtained with increasing interference complexity through diffraction on consecutive planes in LCT case while starting with purely classical Gaussian source of zero negative Wigner volume. V2 of 0.842 for LCT is smaller than 1.21 for FSP on the second plane. This is due to the both the specific set-up parameters and more diverse distribution of the path magnitudes in LCT after diffraction from the first plane as shown in Fig. 10d. It becomes more difficult on the third plane to correlate the distribution of the path magnitudes shown in Fig. 10h with VN=V3 shown in Fig. 10j,l. In other words, complexity behaves differently compared with the transmission probability while requiring simultaneous maximization depending on specific set-up as an open issue as discussed in the Results section while presenting Wigner distribution analysis.

Figure 10.

Figure 10

Gaussian source with σ0=20μm is utilized where the resulting spatial domain waveforms on the planes with the indices (a) j=1, (b) j=2 and (c) j=3 for FSP, and (e) j=1, (f) j=2 and (g) j=3 for LCT. PE(n,j) for (d) j=2 and (h) j=3. Scaled Wigner distribution ħ×Wj(xj,pj) for FSP on the planes with (i) j=2 and (j) j=3, and for LCT with (k) j=2 and (l) j=3.

Open issues and discussion

There are some open issues to best exploit photonic QPC method based on MPD and FO. Mathematical formulation correlating specific set-up parameters to path magnitude distribution and negative volume of Wigner function is an open issue. Iterative formulation of the vectors h~N-1,n, γ~N-1,n, η~N-1,n and the matrices H~N-1,nHO/G, H~N-1,nLCT/G and H~N-1,nLCT/HG in (16), (25) and (27) are complicated as shown in the Methods section with complicated parameters and iterations in Tables 1 and 3. Therefore, adapting the physical set-up parameters to the desired form of partial sum of RTF for the target number theoretical problem, and characterizing the path distributions and the negative volume of Wigner function explicitly are important open issues.

In the proposed formulation, the qubits are obtained through the tensor product structure of projections at different time instants on the contrary with the spatial encoding and entanglement of multiple photons. However, the histories of photon trajectories are not formulated for realizing conventional quantum gate implementations. Implementations of the quantum circuit gates are required to obtain universal QC architectures. Therefore, proposed QC formulation is limited to utilization of the interference of exponentially increasing number of Feynman paths based on the superposition and coherence properties of light source. Implementations of quantum circuits and fundamental search algorithms such as Grover search are future works to clarify the potential future scope of QPC based computing architectures in terms of universal QC capabilities. On the other hand, FO based QPC implementation has two main advantages resembling Boson sampling advantages in a different context10: (a) not utilizing multiple photons as qubits getting rid of the coupling disadvantages while exploiting single photon trajectories and (b) utilizing the free entanglement, for the first time, of the classical light obtained through freely available temporal correlations among the projections at different time instants. Boson sampling compared with QPC utilizes still multiple indistinguishable photons (but not as qubits) while requires single photon generation and detection to exploit the free entanglement among indistinguishable photons through multi-mode interferometer with the regarding boson statistics.

Realizing perfectly Gaussian slits compared with the conventional rectangular apertures is an important open issue for matching the experimental results with the proposed theoretical model. However, any slit structure can be represented as a composition of Gaussian slits by using the method defined in Ref.72 and applied successfully in optical diffraction theory and experiments73,74. The one dimensional slit mask function G^(x) is represented as follows:

G^(x)i=1Kaiexp(-x2/2βi2) 40

where ai and βi are found with optimization based on the experimental measurement results while increasing K provides more accurate results. If the perfect Gaussian slits are replaced with the superposition in (40), then the summations in (16), (25) and (27) should be made for each βi of the single slit. The functional form with partial sum of RTF should be calculated and summed for each combination of βi through all the slits. Therefore, non-Gaussian slits can possibly realize the solutions of much harder computational complexity problems as an open issue.

There are some factors effecting the degree of compatibility between the theory and practice. These include imperfection in optical set-up, e.g., finite size lens effects, planar thickness, characterization of slit functions, sources and detector efficiency. The theoretical model should be extended including all the set-up parameters having diverging effects on the final intensity distribution. Similarly, the effects of exotic paths, i.e., trajectories between the slits on the same plane, should be included in the mathematical model as thoroughly discussed in Refs.6,41,75. All these considerations potentially lead to unavoidable errors requiring quantum error correction studies adapted to QPC architectures76. Another open issue is related to the utilization of the measurements on all the sensor planes for computational purposes not only the final sensor plane since they include diffraction through previous planes. Theoretical models are required to exploit the sensor measurement results.

Methods

Quantum Fourier optics

In scalar diffraction theory, the first Rayleigh-Sommerfeld formula of the Huygens-Fresnel principle for the propagation of light on planar surfaces is described as follows by using the Green’s theorem77:

UI(P1)=-14πΣUδG-δnds 41

where UI(P1) is the wave amplitude at the point P1, U is the distribution on the planar screen where diffraction occurs, Σ denotes the integration over the slit including its multiplicative effects on the wave amplitude, G-exp(ıkr01)/r01-exp(ıkr~01)/r~01 is the Green’s function vanishing on the diffraction surface for the first type of solution of Rayleigh-Sommerfeld formula, r01|r0-r1| and k2π/λ for the monochromatic light source of wavelength λ as shown in Fig. 1177. Assuming that r01λ, the following approximation holds in rectangular coordinates:

UI(P1)ΣU(x0,y0)KFS(r1,r0)dx0dy0 42

where the kernel KFS(r1,r0) for FSP is defined as follows:

KFS(r1,r0)1ıλeıkr01r01cos(n,r01) 43
=zıλeıkr01r012 44
eıkzıλzeık2z((x1-x0)2+(y0-y0)2) 45

where r01=z2+(x1-x0)2+(y0-y0)2. The kernel for Fresnel diffraction integral is obtained by further approximation of r01 in the near-field for large z resulting in (45). This expression is the convolution integral conventionally used in phase-space optics for FSP34.

Figure 11.

Figure 11

Formulation set-up for first type of solution of Rayleigh–Sommerfeld diffraction through a slit Σ77.

Recently, scalar diffraction theory and Fresnel diffraction integral are discussed in Ref.15 to be validly representing the evolution of light wave function modeled with the Hamiltonian of the quantized electromagnetic field H=(p^2+ω2q^2)/2 as the Feynman’s path integral (FPI) solution of the quantum mechanical HO78. Fresnel diffraction nature of the propagation is verified with experimental photon counting studies for single photons. The wave function amplitude of light field in one dimension on a plane Ψ(x0) is modeled to propagate into the amplitude Ψ(x1) on another plane (Eq. 16 in Ref.15 transformed into a simpler form) with the following formulation:

Ψ(x1)-Ψ(x0)KHO(x1,x0)dx0 46

where the kernel based on HO is the following:

KHO(x1,x0)mλ2πıħt01sin(ωt)exp(ımλ(x12cos(ωt)-2x1x0+x02cos(ωt))2ħt01sin(ωt)) 47

where c is the velocity of light, ω2πc/λ, ωtnπ for nZ, t01 is the propagation duration between the planes and mλħk/c is the defined equivalent mass of photon propagation. In addition, the approximated FSP kernel in (45) is simply converted to the following in 1D system:

KFS(x1,x0)ejkzmλ2πıħt01eımλ2ħt01(x1-x0)2 48

The kernel for massive particles with the mass m such as an electron is expressed as follows6, 78:

Km,FS(x1,x0)m2πıħt01eım2ħt01(x1-x0)2 49

In other words, the formulation based on phase-space optics for photon and electron propagation wave amplitudes have the similar form in (48) and (49) except an overall phase factor. The form in (48) is utilized in Ref.33 for defining QSM while targeting only classical communications.

On the other hand, both the kernels KHO(x1,x0) and KFS(x1,x0) are special cases of LCTs defined for quadratic-phase optics34. As a class of linear integral transforms, they include as special cases the Fresnel transform and FRFT, simple scaling, chirp multiplication and some other operations. Spatial distribution of light in phase-space optics for the class denoted by quadratic-phase systems is mathematically equivalent to LCTs (Chapters 3 and 8 in Ref.34). These optical systems include arbitrary combinations of the sections of free space in the Fresnel approximation, thin lenses and sections of quadratic graded-index media. In Ref.15, FRFT nature of the kernel KHO(x1,x0) is shown both theoretically and experimentally while emphasizing the applicability of all the properties of Fourier analysis to quantum optics. In this article, propagation of the wave function is extended to the general case of LCTs providing flexibility to utilize arbitrary optical set-ups by enlarging the functional structures and number theoretical problems exploited in QPC. Furthermore, a better control is obtained for the energy flow of the light through the slits.

The kernel matrices for KHO(x1,x0) and KFS(x1,x0) are given as follows:

MHO=cos(ωt)2πħt01sin(ωt)mλ-mλsin(ωt)2πħt01cos(ωt) 50
MFS=12πħt01mλ01 51

MHO has the same form with the propagation of light in quadratic graded-index media of having the refractive index distribution of n2(x)=n02(1-(x/χ)2) where n0 and χ are the medium parameters. The parameter matrix of the propagation through the quadratic graded-index medium of length dgri is given by the following (Section 8.3.3 in Ref.34):

Mgri=cos(α)λχsin(α)-sin(α)/λχcos(α) 52

where α=dgri/χ. There is a FRFT relation between scaled versions of the input f^(x) and output g^(x) with FRFT order α as g^(x)=e-ıdgri/(2χ)λχ-1/4fa(x/λχ) where f(x)λχ1/4f^(xλχ) and fa(x) denotes the ath order FRFT of f(x). FRFT operation of order α is represented with the parameter matrix of a=d=cos(α) and b=sin(α). As a result, MHO represents a FRFT relation between the input and output scaled with the parameter λχ where the parameters are α=ωt and λχ2πħt01/mλ while as a special case of LCTs.

Matrix formulation for HO/LCT system with Gaussian sources

The following formulation is valid for both HO and LCT based design with Gaussian sources where the corresponding iteration parameters are defined in Table 1. The elements in the vector h~N-1,n=c~N-1,n+ıd~N-1,n are defined as follows:

c~N-1,nTd~N-1,nT=v~0,N-1,nv~1,N-1,nv~N-2,N-1,n 53

where v~k,j,n for k[0,j-1] is given as follows:

v~k,j,n(i=1j-1-kp~4,j+1-i,np~5,j+1-i,n-p~5,j+1-i,np~4,j+1-i,n)ζ~k+1,c,nζ~k+1,d,n 54

Here, the matrix multiplication i=1kUi denotes U1U2Uk for any matrix Ui for i[1,k] and p~4,j,n, p~5,j,n, ζ~j,c,n and ζ~j,d,n for j[1,N-1] are defined in Table 1. Assume that diag{y1,,yK} and diag{y1,,yK} define the operators creating block diagonal matrices by putting the vectors yj and the matrices yj for j[1,K], respectively, (all the vectors or the matrices having the same dimensions) to the main diagonal and making zero the remaining elements. The matrix H~N-1,nHO/G is more simplified as follows compared with the more complicated form achieved for electron based FSP in Ref.6:

H~N-1,nHO/G=D~a,N-1,nHO/G+V~N-1,nTD~b,N-1,nHO/GV~N-1,n0N-20N-2T0+0N-2T0D~c,N-1,nHO/GV~N-1,n0N-2 55

where the diagonal matrices are defined as follows:

D~a,N-1,nHO/G=diag{p~1,1,n,p~1,2,n,,p~1,N-1,n} 56
D~b,N-1,nHO/G=diag{K~2,b,n,K~3,b,n,,K~N-1,b,n} 57
D~c,N-1,nHO/G=diag{k~2,c,nT,k~3,c,nT,,k~N-1,c,nT} 58

2×2 block K~j,b,n and 1×2 vector k~j,c,nT for j[2,N-1] are defined as follows:

K~j,b,n=β~j,n2p~3,j,n21ıı-1 59
k~j,c,nT=p~3,j,n1ı 60

V~N-1,n is a lower triangular block matrix defined as follows:

v~0,1,n020202v~0,2,nv~1,2,n0202v~0,3,nv~1,3,nv~2,3,n0202v~0,N-2,nv~1,N-2,nv~2,N-2,nv~N-3,N-2 61

Expanding H~N-1,nHO/G in terms of real and imaginary parts is achieved by finding the real and imaginary parts of p~1,j,n for j[1,N-1] and p~3,j,n for j[2,N-1], and K~j,b,n and k~j,c,n for j[2,N-1] since V~N-1,n is a real matrix. This is easily achieved by using the explicit forms of p~1,j,n and p~3,j,n in Table 1. Some variables and constants used in Table 1 (not defined in the table) are the following: ı-1, xj,n denotes Xj,sn,j, λ0=ħt0,1, αj=ωtj,j+1 for j[0,N-1], m^j=mλ/sin(ωtj,j+1) and λ~j,n as the conjugate of λ~j,n for real values of (aj,j+1,bj,j+1,cj,j+1,dj,j+1).

Polynomials for the example in (18-21) are presented in Table 2 for the simple case of N=3 and Gaussian source. It is possible by using the explicit modeling to make various gedanken experiments and to perform complexity theoretical calculations.

Matrix formulation for LCT system with Hermite–Gaussian sources

Iteration parameters utilized in (2226) are presented in Table 3. Some variables and constants used in Table 3 (not defined previously or for Table 1) are the following: τ~a,j,nbj,j+1u~j-1,j,n+ıπaj,j+1 for j[2,N-1], τa,1b12u01+ıπa12 and Γ~1,n=2β~1,n2b1,2g0,12+τ~1,n. The formulation in (22) is obtained by using the integral equality for Hermite polynomials (Section 16.5 in Ref.65) in an iterative manner along the planes:

dxexp(-(x-y)22)Hl(ax2)=2π(1-a2)l/2Hl(ay2(1-a2)) 62

The parameters η~N-1,n and γ~j,j+1,n in γ~N-1,nT[γ~12,nγ~23,nγ~N-1,N,n] utilized in (23) are defined as follows by using the iterations in Table 3:

η~N-1,nTΞ~N-2,nT0Λ~N-2,n0N-20N-2T0+ε~N-1,nT 63

where the following are defined:

Λ~N-2,n[G1G2GN-2]T;Gk[(γ~k,n)T0N-2-kT]T;γ~k,n[kγ~1,2,nkγ~2,3,nkγ~k,k+1,n]T 64
ε~N-1,n[ε~12,nε~23,nε~N-1,N,n]T;Ξ~N-2,n[Ξ~12,nΞ~23,nΞ~N-2,N-1,n]T;Ξ~j,j+1,nh~c,j+1,j+2,nk=j+2N-1h~a,k,k+1,n 65

where Ξ~N-2,nT is defined for N>2 and γ~j,j+1,n=N-1γ~j,j+1,n while lγ~j,j+1,n and ε~j,j+1,n are defined as follows:

lγ~j,j+1,nv~a,j,j+1,nk=j+1lβ~k,n2v~a,k,k+1,n,j2v~a,12,nk=2lβ~k,n2v~a,k,k+1,n,j=1;ε~j,j+1,nh~b,j,j+1,nk=j+1N-1h~a,k,k+1,n,j2h~a,12,nk=2N-1h~a,k,k+1,n,j=1 66

where γ~12,nv~a,12,n and ε~12,nh~a,12,n for N=2, and 1γ~1,2,nv~a,12,n. Finally, H~N-1,nLCT/HG becomes equal to the following by using the iterations in Table 3:

H~N-1,nLCT/HG-θ~12,n10N-2T0N-20N-2+j=2N-1H~j,nLCT/HG,χ0j,N-1-j0N-1-j,j0N-1-j 67

where H~k,nLCT/HG,χ is the following:

H~k,nLCT/HG,χθ~a,k,k+1,nγ~k-1,n(γ~k-1,n)T0k-10k-1T0+θ~b,k,k+1,n0k-1γ~k-1,n0k-1T0+θ~c,k,k+1,n0k-10k-10k-1T1 68

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.Arute F, et al. Quantum supremacy using a programmable superconducting processor. Nature. 2019;574:505–510. doi: 10.1038/s41586-019-1666-5. [DOI] [PubMed] [Google Scholar]
  • 2.Cho, A. Google claims quantum computing milestone. https://science.sciencemag.org/content/365/6460/1364 (2019). [DOI] [PubMed]
  • 3.Preskill J. Quantum computing in the NISQ era and beyond. Quantum. 2018;2:79. [Google Scholar]
  • 4.Gomes, L. Quantum computing: both here and not here. IEEE Spectrum42–47 (2018).
  • 5.Childs AM, Maslov D, Nam Y, Ross NJ, Su Y. Toward the first quantum simulation with quantum speedup. Proc. Natl. Acad. Sci. 2018;115:9456–9461. doi: 10.1073/pnas.1801723115. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Gulbahar B. Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles. Quantum Inf. Process. 2019;18:167. [Google Scholar]
  • 7.Kok P, et al. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 2007;79:135. [Google Scholar]
  • 8.Li Y, Humphreys PC, Mendoza GJ, Benjamin SC. Resource costs for fault-tolerant linear optical quantum computing. Phys. Rev. X. 2015;5:041007. [Google Scholar]
  • 9.Carolan J, et al. Universal linear optics. Science. 2015;349:711–716. doi: 10.1126/science.aab3642. [DOI] [PubMed] [Google Scholar]
  • 10.Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing 333–342 (ACM, 2011).
  • 11.Wang, H. et al. Boson sampling with 20 input photons in 60-mode interferometers at 1014 state spaces. Preprint atarXiv:1910.09930 (2019). [DOI] [PubMed]
  • 12.Gulbahar B. Theory of quantum path entanglement and interference with multi-plane diffraction of classical light sources. Entropy. 2020;22:246. doi: 10.3390/e22020246. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 13.Streltsov A, Adesso G, Plenio MB. Colloquium: Quantum coherence as a resource. Rev. Mod. Phys. 2017;89:041003. [Google Scholar]
  • 14.Theurer T, Killoran N, Egloff D, Plenio MB. Resource theory of superposition. Phys. Rev. Lett. 2017;119:230401. doi: 10.1103/PhysRevLett.119.230401. [DOI] [PubMed] [Google Scholar]
  • 15.Santos EA, Castro F, Torres R. Huygens–Fresnel principle: analyzing consistency at the photon level. Phys. Rev. A. 2018;97:043853. [Google Scholar]
  • 16.Wang X-L, et al. Experimental ten-photon entanglement. Phys. Rev. Lett. 2016;117:210502. doi: 10.1103/PhysRevLett.117.210502. [DOI] [PubMed] [Google Scholar]
  • 17.Wang J, et al. Multidimensional quantum entanglement with large-scale integrated optics. Science. 2018;360:285–291. doi: 10.1126/science.aar7053. [DOI] [PubMed] [Google Scholar]
  • 18.Wang H, et al. Toward scalable boson sampling with photon loss. Phys. Rev. Lett. 2018;120:230502. doi: 10.1103/PhysRevLett.120.230502. [DOI] [PubMed] [Google Scholar]
  • 19.Gui-Lu L. General quantum interference principle and duality computer. Commun. Theor. Phys. 2006;45:825–844. [Google Scholar]
  • 20.Gui-Lu L, Yang L. Duality computing in quantum computers. Commun. Theor. Phys. 2008;50:1303. [Google Scholar]
  • 21.Gui-Lu L, Yang L, Chuan W. Allowable generalized quantum gates. Commun. Theor. Phys. 2009;51:65. [Google Scholar]
  • 22.Gudder S. Mathematical theory of duality quantum computers. Quantum Inf. Process. 2007;6:37. [Google Scholar]
  • 23.Wittek P, Gogolin C. Quantum enhanced inference in Markov logic networks. Sci. Rep. 2017;7:45672. doi: 10.1038/srep45672. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24.Qiang X, et al. Large-scale silicon quantum photonics implementing arbitrary two-qubit processing. Nat. Photon. 2018;12:534–539. [Google Scholar]
  • 25.Dragoman D. n-step optical simulation of the n-qubit state: applications in optical computing. Optik. 2002;113:425–428. [Google Scholar]
  • 26.Shao C, Li Y, Li H. Quantum algorithm design: techniques and applications. J. Syst. Sci. Complex. 2019;32:375–452. [Google Scholar]
  • 27.Qiang, X., Zhou, X., Aungskunsiri, K., Cable, H. & O’Brien, J. L. Quantum processing by remote quantum control. Quantum Sci. Technol.2, 045002 (2017).
  • 28.Wei, S. J., Zhou, Z. R., Ruan, D. & Long, G. L. Realization of the algorithm for system of linear equations in duality quantum computing. IEEE 85th Vehicular Technology Conference (VTC Spring) 1–4 (2017).
  • 29.Caulfield HJ, Shamir J. Wave particle duality considerations in optical computing. Appl. Opt. 1989;28:2184–2186. doi: 10.1364/AO.28.002184. [DOI] [PubMed] [Google Scholar]
  • 30.Ozaktas HM, Shamir J. Toward an optimal foundation architecture for optoelectronic computing. Part I. Regularly interconnected device planes. Appl. Opt. 1997;36:5682–5696. doi: 10.1364/ao.36.005682. [DOI] [PubMed] [Google Scholar]
  • 31.Ozaktas HM. Toward an optimal foundation architecture for optoelectronic computing. Part II. Physical construction and application platforms. Appl. Opt. 1997;36:5697–5705. doi: 10.1364/ao.36.005697. [DOI] [PubMed] [Google Scholar]
  • 32.Shamir, J. Energy efficient computing exploiting the properties of light. In Tribute to H. John Caulfield. International Society for Optics and Photonics8833, 88330J (2013).
  • 33.Gulbahar B, Memisoglu G. Quantum spatial modulation of optical channels: quantum boosting in spectral efficiency. IEEE Commun. Lett. 2019;23:2026–2030. [Google Scholar]
  • 34.Ozaktas HM, Zalevsky Z, Kutay MA. The Fractional Fourier Transform with Applications in Optics and Signal Processing. Chichester: Wiley; 2001. [Google Scholar]
  • 35.Healy JJ, Kutay MA, Ozaktas HM, Sheridan JT. Linear Canonical Transforms: Theory and Applications. Berlin: Springer; 2015. [Google Scholar]
  • 36.Pampaloni, F. & Enderlein, J. Gaussian, Hermite–Gaussian, and Laguerre–Gaussian beams: a primer. Preprint atarXiv:0410021 (2004).
  • 37.Sawada K, Walborn S. Experimental quantum information processing with the Talbot effect. J. Opt. 2018;20:075201. [Google Scholar]
  • 38.Barros MR, Ketterer A, Farías OJ, Walborn SP. Free-space entangled quantum carpets. Phys. Rev. A. 2017;95:042311. [Google Scholar]
  • 39.Tasca DS, et al. Testing for entanglement with periodic coarse graining. Phys. Rev. A. 2018;97:042312. [Google Scholar]
  • 40.Rengaraj G, Prathwiraj U, Sahoo SN, Somashekhar R, Sinha U. Measuring the deviation from the superposition principle in interference experiments. New J. Phys. 2018;20:063049. [Google Scholar]
  • 41.Sawant R, Samuel J, Sinha A, Sinha S, Sinha U. Nonclassical paths in quantum interference experiments. Phys. Rev. Lett. 2014;113:120406. doi: 10.1103/PhysRevLett.113.120406. [DOI] [PubMed] [Google Scholar]
  • 42.Kenfack A, Życzkowski K. Negativity of the Wigner function as an indicator of non-classicality. J. Opt. B Quantum Semiclass. Opt. 2004;6:396. [Google Scholar]
  • 43.Aaronson, S. Aspects of certified randomness from quantum supremacy. https://www.scottaaronson.com/talks/certrand2.ppt (2019).
  • 44.Whyte, D. How to turn a quantum computer into the ultimate randomness generator. https://www.quantamagazine.org/how-to-turn-a-quantum-computer-into-the-ultimate-randomness-generator-20190619/ (2019).
  • 45.Bouland A, Fefferman B, Nirkhe C, Vazirani U. On the complexity and verification of quantum random circuit sampling. Nat. Phys. 2019;15:159. [Google Scholar]
  • 46.Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U. & Vidick, T. A cryptographic test of quantumness and certifiable randomness from a single quantum device. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) 320–331 (IEEE, 2018).
  • 47.Aaronson, S. & Chen, L. Complexity–theoretic foundations of quantum supremacy experiments. Preprint atarXiv:1612.05903 (2016).
  • 48.Riemann, B. Theorie der Abel’schen functionen vol. 54 (Georg Reimer Berlin, 1857).
  • 49.Deconinck B, Heil M, Bobenko A, Van Hoeij M, Schmies M. Computing Riemann theta functions. Math. Comput. 2004;73:1417–1442. [Google Scholar]
  • 50.Mumford, D. & Musili, C. Tata Lectures on Theta. I (Modern Birkhäuser classics) (Birkhäuser Boston Incorporated, 2007).
  • 51.Osborne, A. R. Nonlinear Ocean Wave and the Inverse Scattering Transform. In Scattering 637–666 (Elsevier, 2002).
  • 52.Nielsen, M. A. & Chuang, I. Quantum computation and quantum information (2002).
  • 53.Lagarias JC. The computational complexity of simultaneous diophantine approximation problems. SIAM J. Comput. 1985;14:196–209. [Google Scholar]
  • 54.LeCun Y, Bengio Y, Hinton G. Deep learning. Nature. 2015;521:436–444. doi: 10.1038/nature14539. [DOI] [PubMed] [Google Scholar]
  • 55.Cao, Y., Guerreschi, G. G. & Aspuru-Guzik, A. Quantum neuron: an elementary building block for machine learning on quantum computers. Preprint atarXiv.org:1711.11240 (2017).
  • 56.Tacchino F, Macchiavello C, Gerace D, Bajoni D. An artificial neuron implemented on an actual quantum processor. npj Quantum Inf. 2019;5:26. [Google Scholar]
  • 57.Brunner D, Fischer I. Reconfigurable semiconductor laser networks based on diffractive coupling. Opt. Lett. 2015;40:3854–3857. doi: 10.1364/OL.40.003854. [DOI] [PubMed] [Google Scholar]
  • 58.Bueno J, et al. Reinforcement learning in a large-scale photonic recurrent neural network. Optica. 2018;5:756–760. [Google Scholar]
  • 59.Lin X, et al. All-optical machine learning using diffractive deep neural networks. Science. 2018;361:1004–1008. doi: 10.1126/science.aat8084. [DOI] [PubMed] [Google Scholar]
  • 60.Wahls S, Poor HV. Fast numerical nonlinear Fourier transforms. IEEE Trans. Inf. Theory. 2015;61:6957–6974. [Google Scholar]
  • 61.Tracy E, Chen H. Nonlinear self-modulation: an exactly solvable model. Phys. Rev. A. 1988;37:815. doi: 10.1103/physreva.37.815. [DOI] [PubMed] [Google Scholar]
  • 62.Erhard, M., Krenn, M. & Zeilinger, A. Advances in high dimensional quantum entanglement. Preprint atarXiv.org/abs/1911.10006 (2019).
  • 63.Lima G, et al. Propagation of spatially entangled qudits through free space. Phys. Rev. A. 2006;73:032340. [Google Scholar]
  • 64.Taguchi G, et al. Measurement and control of spatial qubits generated by passing photons through double slits. Phys. Rev. A. 2008;78:012307. [Google Scholar]
  • 65.Bateman H. Tables of Integral Transforms. New York: McGraw-Hill Book Company; 1954. [Google Scholar]
  • 66.Weisstein, E. W. Hermite polynomial (2002).
  • 67.Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U. Quantum supremacy and the complexity of random circuit sampling. Preprint atarXiv:1803.04402 (2018).
  • 68.Magana-Loaiza OS, et al. Exotic looped trajectories of photons in three-slit interference. Nat. Commun. 2016;7:13987. doi: 10.1038/ncomms13987. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 69.Zhou Q, Valivarthi R, John C, Tittel W. Practical quantum random-number generation based on sampling vacuum fluctuations. Quantum Eng. 2019;1:e8. [Google Scholar]
  • 70.Shakhovoy R, Sych D, Sharoglazova V, Udaltsov A, Fedorov A, Kurochkin Y. Quantum noise extraction from the interference of laser pulses in an optical quantum random number generator. Opt. Express. 2020;28:6209–6224. doi: 10.1364/OE.380156. [DOI] [PubMed] [Google Scholar]
  • 71.Kamalian M, Prilepsky JE, Le ST, Turitsyn SK. Periodic nonlinear Fourier transform for fiber-optic communications, part I: theory and numerical methods. Opt. Express. 2016;24:18353–18369. doi: 10.1364/OE.24.018353. [DOI] [PubMed] [Google Scholar]
  • 72.Wen J, Breazeale M. A diffraction beam field expressed as the superposition of Gaussian beams. JOSA. 1988;83:1752–1756. [Google Scholar]
  • 73.Ding D, Liu X. Approximate description for Bessel, Bessel–Gauss, and Gaussian beams with finite aperture. JOSA A. 1999;16:1286–1293. [Google Scholar]
  • 74.Lu X, et al. Experimental study of the fractional Fourier transform for a hollow Gaussian beam. Opt. Laser Technol. 2014;56:92–98. [Google Scholar]
  • 75.da Paz I, et al. Gouy phase in nonclassical paths in a triple-slit interference experiment. Phys. Rev. A. 2016;93:033621. [Google Scholar]
  • 76.Kitaev AY. Quantum computations: algorithms and error correction. Uspekhi Matematicheskikh Nauk. 1997;52:53–112. [Google Scholar]
  • 77.Goodman, J. W. Introduction to Fourier Optics (Roberts and Company Publishers, 2005).
  • 78.Feynman RP, Hibbs AR, Styer DF. Quantum Mechanics and Path Integrals. emended. Mineola: Dover; 2010. [Google Scholar]

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

RESOURCES