The work reduces the wave equation in an inhomogeneous material to the form of the Schrödinger equation, allowing for simulation on a quantum computer. This approach was presented by successfully modeling the propagation of a one-dimensional Gaussian beam through a lens, and demonstrating the resulting spherical aberration. The team constructed beam propagator operators using an efficient block-encoding method, enabling simulation of diverse optical setups.
Wave Optics Simulation via Quantum Algorithm
The algorithm accurately modeled spherical aberration, a distortion occurring when light passes through a lens, demonstrating its capacity to predict complex optical behavior. This simulation relied on reducing the wave equation governing light propagation in uneven materials to a form mirroring the Schrödinger equation, a cornerstone of quantum mechanics. This reduction enabled the use of a quantum computer to simulate wave optical dynamics, a previously challenging task.
The work establishes a significant improvement in computational capacity for high-precision applications, potentially impacting fields requiring accurate beam propagation modeling. This block-encoding technique is central to achieving optimal computational complexity in simulating time-independent Hamiltonian systems, a key step in translating wave optics into a quantum computing framework. The algorithm simulates the propagation of a light field through weakly inhomogeneous media, a common scenario in many optical systems.
This approach differs from simply extracting the complete propagated field, as the output is computed as wavefunction amplitudes within a quantum register, preserving the quantum speedup. Attempting to extract the field intensity from this quantum register by direct measurement would inevitably lead to losing the quantum speedup. A one-dimensional Gaussian beam propagating through a plano-convex lens was specifically simulated, showing the algorithm’s ability to model a fundamental optical experiment.
The team used the paraxial approximation, a simplification often used in wave optics, to connect the Helmholtz equation to a time-dependent Hamiltonian simulation problem. The diverse applications of wave propagation algorithms range from designing optical waveguides, lasers and integrated circuits, to biomedical optics and imaging. In modern optical engineering, there is an increasing need for more accurate simulations of beam propagation in complex structures where the precise control of light is essential.
The algorithm’s potential extends to areas demanding precise light manipulation, offering a new tool for optical design and analysis.
Reduction of Helmholtz Equation to Hamiltonian Simulation
The mathematical description of how light travels through uneven materials has been successfully recast into a form compatible with quantum computing. By transforming the Helmholtz equation, governing wave propagation, into an equivalent Schrödinger equation with a time-dependent Hamiltonian, scientists have established a bridge between classical wave optics and the realm of quantum simulation. This reduction allows for the application of quantum algorithms to model light’s behavior in ways previously inaccessible.
This approach hinges on the paraxial approximation, a standard simplification in wave optics, and the assumption of a weakly inhomogeneous medium. The team constructed a simulator that uses this equivalence, enabling the modeling of wave optical dynamics on a quantum computer. A key element of their design is an efficient block-encoding structure, a method for representing quantum operations that allows for flexible simulation of diverse optical elements impacting a light beam.
Block-Encoding of Phase Propagators for Quantum Simulation
An ancillary quantum register requiring only log2N qubits facilitated the construction of block-encoded phase shifters, critical components in simulating light propagation, and represents a significant reduction in the resources needed for complex optical modeling. The algorithm’s gate complexity scales quadratically with simulation time, O(T2/ε), where ε defines the acceptable error, indicating a predictable increase in computational demand as simulations extend further in time or require greater precision.
This methodological bridge allows researchers to use the established tools and techniques of quantum computing to tackle challenges in wave optics. The team demonstrated this by simulating a Gaussian beam, a fundamental type of light beam, as it passes through a plano-convex lens, a common optical component, and accurately predicted the resulting spherical aberration, a distortion in the beam’s shape.
The modularity of the method stems from programming the Hamiltonian, representing the energy of the system, on a quantum computer using an amplitude oracle that prepares the wavefunction corresponding to a specific phase profile. This approach transforms the problem of creating unitary phase operators into a state preparation problem, allowing for the simulation of optical elements with diverse refractive index distributions, provided their corresponding phase profiles can be efficiently prepared on a quantum register. Any improvements in the efficiency of this state preparation directly translate into more efficient block-encoded phase operators, highlighting the potential for further optimization.
Quantum Algorithm Complexity: O(T^2/ε) Scaling
The efficiency of simulating light propagation hinges on computational scaling, and this new quantum algorithm achieves a complexity of O(T^2/ε), where T represents the simulation time and ε defines the acceptable error. This scaling represents an advance over classical methods for certain optical simulations, particularly those demanding high precision. The algorithm’s gate complexity is quadratic in the simulation time, a characteristic enabled by the use of block-encoded phase shifters acting on a quantum register.
These shifters, combined with quantum Fourier transforms, simulate wave behavior under the paraxial approximation, a common simplification in optical engineering. The core of this efficiency lies in reducing the construction of diagonal phase operators to the task of finding initializers for corresponding phase distributions. This approach uses the power of efficient state preparation circuits, meaning any improvements in that area directly translate to a faster, more accurate simulation.
The ancillary quantum register required to implement the block-encoding needs only qubits, where N is the grid size of the discretized light field, minimizing the quantum resources needed for the simulation. This is a critical factor for scaling simulations to larger, more complex optical systems. The U(θ) operator, essential for establishing entanglement between registers and achieving the desired phase transformation, requires only O(n_q) elementary gates for its implementation, where is the number of qubits.
This operator’s efficiency is paramount, as it dictates the overall performance of the block-encoding structure. The simulation algorithm exhibits exponential efficiency in memory consumption, requiring only O(log N) qubits for a discretized light field with a grid size of N in the transverse plane. This scaling is a substantial improvement over classical methods, which often require memory that grows polynomially with N.
A similar polylogarithmic scaling with N is also possible for circuit depth when simulating refractive index distributions that are efficiently preparable in quantum registers, a condition met by many relevant scientific applications. The algorithm is not designed to extract the complete propagated field for a given distance, as direct measurement of wavefunction amplitudes would negate the quantum speedup. Instead, it excels at simulating the underlying physics of wave propagation with increased efficiency.
Gaussian Beam Propagation Through Plano-Convex Lens
The simulation of light bending through a lens, a fundamental problem in optics, has been successfully modeled using a quantum algorithm, demonstrating its potential for complex wave propagation studies. Beam propagator operators, essential for modeling light’s journey, were constructed using a block-encoding method designed for efficiency and adaptability to different optical configurations. The researchers emphasize that attempting to directly measure the field intensity from the quantum register would negate the quantum speedup, highlighting the algorithm’s focus on simulating the process rather than simply retrieving the final result.
Paraxial Approximation and Weak Inhomogeneity Condition
The reduction of wave equation dynamics to a time-dependent Hamiltonian is central to simulating light propagation. These conditions allow the complex problem of wave propagation to be recast as a simulation of quantum mechanical evolution. A key requirement for the block-encoding’s efficiency is a small phase norm, naturally satisfied when using a split-step approximation.
This approximation demands small time steps, leading to minimal local phase changes at each step. The method also benefits from an efficient state preparation unitary for the state φ(x), ensuring the initial conditions of the simulation are accurately represented.
The simulation accurately predicted spherical aberration, a distortion that occurs when light rays passing through a lens do not converge at a single point. This outcome confirms the algorithm’s ability to model complex light behavior and validate its accuracy. The transverse Laplacian operator, used in the differential equation governing the wave’s evolution, relies on this assumption for its simplified form.
The algorithm’s efficiency is also tied to this condition, as it ensures the local phases used in the block-encoding remain small. This work establishes a pathway for simulating wave optical dynamics on quantum computers, potentially offering advantages over classical methods for certain problems.
👉 More information
🗞 Quantum simulation of wave optics in weakly inhomogeneous media using block encoding
✍️ Siavash Davani, Martin Gärttner and Falk Eilenberger
🧠 DOI: http://link.aps.org/doi/10.1103/snzq-fp39




See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.
