Efficient Light Propagation Algorithm using Quantum Computers

• URL: http://arxiv.org/abs/2303.07032v2
• Date: Fri, 8 Mar 2024 14:29:38 GMT
• Title: Efficient Light Propagation Algorithm using Quantum Computers
• Authors: Chanaprom Cholsuk, Siavash Davani, Lorcan O. Conlon, Tobias Vogl, Falk Eilenberger
• Abstract summary: One of the cornerstones in modern optics is the beam propagation algorithm. We show that the propagation can be performed as a quantum computation with $mathcalO(logN)$ single-controlled phase gates. We highlight the importance of the selection of suitable observables to retain the quantum advantage.
• Score: 0.3124884279860061
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum algorithms can potentially overcome the boundary of computationally hard problems. One of the cornerstones in modern optics is the beam propagation algorithm, facilitating the calculation of how waves with a particular dispersion relation propagate in time and space. This algorithm solves the wave propagation equation by Fourier transformation, multiplication with a transfer function, and subsequent back transformation. This transfer function is determined from the respective dispersion relation, which can often be expanded as a polynomial. In the case of paraxial wave propagation in free space or picosecond pulse propagation, this expansion can be truncated after the quadratic term. The classical solution to the wave propagation requires $\mathcal{O}(N log N)$ computation steps, where $N$ is the number of points into which the wave function is discretized. Here, we show that the propagation can be performed as a quantum algorithm with $\mathcal{O}((log{}N)^2)$ single-controlled phase gates, indicating exponentially reduced computational complexity. We herein demonstrate this quantum beam propagation method (QBPM) and perform such propagation in both one- and two-dimensional systems for the double-slit experiment and Gaussian beam propagation. We highlight the importance of the selection of suitable observables to retain the quantum advantage in the face of the statistical nature of the quantum measurement process, which leads to sampling errors that do not exist in classical solutions.

Related papers

• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Scattering phase shifts from a quantum computer [0.0]
  We calculate two-body scattering phase shifts on a quantum computer using a leading order short-range effective field theory Hamiltonian. The algorithm combines the variational quantum eigensolver and the quantum subspace expansion. We study how noise impacts these calculations and discuss noise mitigation required to extend our work to larger quantum processing units.
  arXiv  Detail & Related papers  (2023-11-15T19:00:05Z)
• An Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors [0.6889425872704066]
  We show the infeasibility of one approach to constructing quantum algorithms for solving lattice problems. We show that, for any choice of the Gaussian-like wave function, the error in this step will be above the threshold required to solve BDD and approximate-SVP.
  arXiv  Detail & Related papers  (2023-10-05T17:56:45Z)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Free expansion of a Gaussian wavepacket using operator manipulations [77.34726150561087]
  The free expansion of a Gaussian wavepacket is a problem commonly discussed in undergraduate quantum classes. We provide an alternative way to calculate the free expansion by recognizing that the Gaussian wavepacket can be thought of as the ground state of a harmonic oscillator. As quantum instruction evolves to include more quantum information science applications, reworking this well known problem using a squeezing formalism will help students develop intuition for how squeezed states are used in quantum sensing.
  arXiv  Detail & Related papers  (2023-04-28T19:20:52Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Real-time quantum calculations of phase shifts using wave packet time delays [0.0]
  We present a method to extract the phase shift of a scattering process using the real-time evolution in the early and intermediate stages of the collision. This procedure is convenient when using noisy quantum computers for which the out-state behavior is unreachable.
  arXiv  Detail & Related papers  (2021-03-11T18:22:26Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Quantum Simulation of Molecules without Fermionic Encoding of the Wave Function [62.997667081978825]
  fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. An application to computing the ground-state energy and 2-RDM of H$_4$ is presented.
  arXiv  Detail & Related papers  (2021-01-27T18:57:11Z)
• Scattering in the Ising Model Using Quantum Lanczos Algorithm [0.32228025627337864]
  We simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites on a quantum computer. Results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time.
  arXiv  Detail & Related papers  (2020-08-20T04:05:52Z)

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.