High-dimensional quantum Fourier transform of twisted light

• URL: http://arxiv.org/abs/2101.11919v2
• Date: Wed, 14 Jul 2021 08:41:59 GMT
• Title: High-dimensional quantum Fourier transform of twisted light
• Authors: Jaroslav Kysela
• Abstract summary: An implementation scheme of the $d$-dimensional Fourier transform acting on single photons is known that uses the path encoding. We present an alternative design that uses the orbital angular momentum as a carrier of information and needs only $O(sqrtdlog d)$ elements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Fourier transform proves indispensable in the processing of classical information as well as in the quantum domain, where it finds many applications ranging from state reconstruction to prime factoring. An implementation scheme of the $d$-dimensional Fourier transform acting on single photons is known that uses the path encoding and requires $O(d \log d)$ optical elements. In this paper we present an alternative design that uses the orbital angular momentum as a carrier of information and needs only $O(\sqrt{d}\log d)$ elements, rendering the path-encoded design inefficient. The advantageous scaling and the fact that our approach uses only conventional optical elements allows for the implementation of a 256-dimensional Fourier transform with the existing technology. Improvements to our design, as well as explicit setups for low dimensions, are also presented.

Related papers

• Reconfigurable unitary transformations of optical beam arrays [1.6820991036487616]
  We demonstrate the promise of an arbitrary unitary transformation that can be reconfigured dynamically. We experimentally test the full gamut of unitary transformations for a system of two parallel beams and make a map of their fidelity. This high-fidelity suggests MPLCs are a useful tool implementing the unitary transformations that comprise quantum and classical information processing.
  arXiv  Detail & Related papers  (2024-07-09T15:56:35Z)
• Parameter-Efficient Orthogonal Finetuning via Butterfly Factorization [102.92240148504774]
  We study a principled finetuning paradigm -- Orthogonal Finetuning (OFT) -- for downstream task adaptation. Despite demonstrating good generalizability, OFT still uses a fairly large number of trainable parameters. We apply this parameterization to OFT, creating a novel parameter-efficient finetuning method, called Orthogonal Butterfly (BOFT)
  arXiv  Detail & Related papers  (2023-11-10T18:59:54Z)
• Heralded Optical Entanglement Generation via the Graph Picture of Linear Quantum Networks [0.4551615447454769]
  Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. This research establishes comprehensive translation rules from subtraction operators to linear optical operators. Our method begets enhanced or previously unreported schemes for the $N$-partite GHZ state with $2N$ photons, $N$-partite W state with $2N+1$ photons and superposition of $N=3$ GHZ and W states with 9 photons.
  arXiv  Detail & Related papers  (2023-10-16T11:26:16Z)
• Fourier-Net+: Leveraging Band-Limited Representation for Efficient 3D Medical Image Registration [62.53130123397081]
  U-Net style networks are commonly utilized in unsupervised image registration to predict dense displacement fields. We first propose Fourier-Net, which replaces the costly U-Net style expansive path with a parameter-free model-driven decoder. We then introduce Fourier-Net+, which additionally takes the band-limited spatial representation of the images as input and further reduces the number of convolutional layers in the U-Net style network's contracting path.
  arXiv  Detail & Related papers  (2023-07-06T13:57:12Z)
• QFF: Quantized Fourier Features for Neural Field Representations [28.82293263445964]
  We show that using Quantized Fourier Features (QFF) can result in smaller model size, faster training, and better quality outputs for several applications. QFF are easy to code, fast to compute, and serve as a simple drop-in addition to many neural field representations.
  arXiv  Detail & Related papers  (2022-12-02T00:11:22Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• Diffractive optical system design by cascaded propagation [1.6385815610837167]
  Fourier optics is typically used for designing thin elements, placed in the system's aperture, generating a shift-invariant Point Spread Function (PSF) We propose and implement an efficient and differentiable propagation model based on the Collins integral, which enables the optimization of diffraction optical systems with unprecedented design freedom using backpropagation. We demonstrate the applicability of our method, numerically and experimentally, by engineering shift-variant PSFs via thin plate elements placed in arbitrary planes inside complex imaging systems.
  arXiv  Detail & Related papers  (2022-02-23T14:21:09Z)
• Learnable Fourier Features for Multi-DimensionalSpatial Positional Encoding [96.9752763607738]
  We propose a novel positional encoding method based on learnable Fourier features. Our experiments show that our learnable feature representation for multi-dimensional positional encoding outperforms existing methods.
  arXiv  Detail & Related papers  (2021-06-05T04:40:18Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)
• Fourier Transform of the Orbital Angular Momentum of a Single Photon [0.0]
  Optical networks implementing single-qudit quantum computation gates may exhibit superior properties to those for qubits. We present an important class of such networks, that implements in a deterministic and efficient way the quantum Fourier transform (QFT) in an arbitrarily large dimension.
  arXiv  Detail & Related papers  (2020-04-27T13:35:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.