Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2405.08884 · Journal of the Optical Society of America B

Finite-element assembly approach of optical quantum walk networks

Christopher R. Schwarze, David S. Simon, Anthony D. Manni, Abdoulaye Ndao, Alexander V. Sergienko

Published May 2, 2024• 6 citations
arXivHTMLPDF

Abstract

We present a finite-element approach for computing the aggregate scattering matrix of a network of linear coherent scatterers. These might be optical scatterers or more general scattering coins studied in quantum walk theory. While techniques exist for two-dimensional lattices of feed-forward scatterers, the present approach is applicable to any network configuration of any collection of scatterers. Unlike traditional finite-element methods in optics, this method does not directly solve Maxwell’s equations; instead it is used to assemble and solve a linear, coupled scattering problem that emerges after Maxwell’s equations are abstracted within the scattering matrix method. With this approach, a global unitary is assembled corresponding to one time step of the quantum walk on the network. After applying the relevant boundary conditions to this global matrix, the problem becomes non-unitary and possesses a steady-state solution that is the output scattering state. We provide an algorithm to obtain this steady-state solution exactly using a matrix inversion, yielding the scattering state without requiring a direct calculation of the eigenspectrum. The approach is then numerically validated on a coupled-cavity interferometer example that possesses a known, closed-form solution. Finally, the method is shown to be a generalization of the Redheffer star product, which describes scatterers on one-dimensional lattices (2-regular graphs) and is often applied to the design of thin-film optics, making the current approach an invaluable tool for the design and validation of high-dimensional phase-reprogrammable optical devices and study of quantum walks on arbitrary graphs.

DOI
10.1364/josab.522588

Related papers

Time-Dependent Wave-Packet Approach to Reactions for Quantum Computation

Evan Rule, Ionel Stetcu

We describe a method for obtaining the scattering matrix for nuclear or chemical reactions on a finite lattice. Aside from the preparation of the initial and final states as wave packets, the only other operation required is unitary time evolution, making this approach ideal for simulations on quantum hardware. The central quantity is a time-dependent overlap between incoming and outgoing wave packets whose Fourier transform corresponds to the scattering matrix at fixed energy, from which one can calculate elastic and inelastic cross sections for reactions involving two interacting clusters. Working in Cartesian coordinates enables an efficient encoding of the problem on quantum hardware via the first quantization mapping, with favorable qubit scaling for describing asymptotic scattering states. Within this framework, we describe a quantum algorithm for probing the scattering amplitude through different angles, including the forward direction, which provides access to the total cross section via the optical theorem. We demonstrate our methods through a series of numerical examples, for both elastic and inelastic processes, comparing against exact calculations. The techniques we describe can more readily be extended to a large number of constituent particles than other existing approaches, once fault-tolerant quantum hardware becomes available.

nucl-thCross-listedarXiv:2603.26881•Physical Review Letters•Mar 31, 2026•5 citations

Investigation of directional and directionally-unbiased devices in linear optics for quantum walk applications

Shuto Osawa, David S. Simon, Alexander V. Sergienko

The optical beam splitter is one of the main building blocks in photonics-based quantum information processing. Traditionally, beam splitters are used in feed-forward configurations that reflect their natural directional-bias, meaning a photon cannot leave the scattering element through the entrance port. However, this directional-bias constraint can be circumvented by designing new linear-optical configurations that include mirrors in addition to the beam splitter. This directionality removal restores a full symmetry in the scattering element and allows the input photon to leave the system also from the input port. Such a system can be seen as a scattering center, enabling execution of quantum walks on rather complex optical graph networks with great savings in hardware resources when compared with existing approaches utilizing directionally-biased devices. The directionallyunbiased configuration can be realized using different optical systems. Analysis of some originally directional optical devices and the basic principles of their conversion into directionally-unbiased systems form the base of this paper. Several quantum walk procedures executed on graph networks constructed using directionallyunbiased nodes are discussed.

Quantum Communications and Quantum Imaging•Sep 6, 2019•1 citation

Directionally-Unbiased Unitary Optical Devices in Discrete-Time Quantum Walks

Shuto Osawa, David S. Simon, Alexander V. Sergienko

The optical beam splitter is a widely-used device in photonics-based quantum information processing. Specifically, linear optical networks demand large numbers of beam splitters for unitary matrix realization. This requirement comes from the beam splitter property that a photon cannot go back out of the input ports, which we call “directionally-biased”. Because of this property, higher dimensional information processing tasks suffer from rapid device resource growth when beam splitters are used in a feed-forward manner. Directionally-unbiased linear-optical devices have been introduced recently to eliminate the directional bias, greatly reducing the numbers of required beam splitters when implementing complicated tasks. Analysis of some originally directional optical devices and basic principles of their conversion into directionally-unbiased systems form the base of this paper. Photonic quantum walk implementations are investigated as a main application of the use of directionally-unbiased systems. Several quantum walk procedures executed on graph networks constructed using directionally-unbiased nodes are discussed. A significant savings in hardware and other required resources when compared with traditional directionally-biased beam-splitter-based optical networks is demonstrated.

arXiv:1909.01297•Entropy•Aug 31, 2019•10 citations

Implementation of a discrete-time quantum walk with a circulant matrix on a graph by optical polarizing elements

Yusuke Mizutani, Tomoyuki Horikiri, Leo Matsuoka +2 more

In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix, namely, the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk, namely, the optical quantum walk, whose underlying graph is a 2-regular directed graph and obtained by blowing up the original graph in some way. We propose a design of an optical circuit which implements the stationary state of the optical quantum walk. We show that if the induced optical quantum walk does not have $+1$ eigenvalue, then the stationary state of the optical quantum walk gives that of the original circulant quantum walk. From this result, we give a useful condition for the setting of the circulant quantum walks which can be implemented by this optical circuit.

arXiv:2202.09080•Physical Review A•Aug 5, 2022•5 citations

Quantum walks based on an interferometric analogy

Mark S. Hillery, János A. Bergou, Edgar Feldman

There are presently two models for quantum walks on graphs. The ``coined'' walk uses discrete-time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for quantum walks is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. This type of walk also allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Several examples are discussed.

arXiv:quant-ph/0302161•Physical Review A•Sep 26, 2003•96 citations

Steady-state solution methods for open quantum optical systems

Paul D. Nation

We discuss the numerical solution methods available when solving for the steady-state density matrix of a time-independent open quantum optical system, where the system operators are expressed in a suitable basis representation as sparse matrices. In particular, we focus on the difficulties posed by the non-Hermitian structure of the Lindblad super operator, and the numerical techniques designed to mitigate these pitfalls. In addition, we introduce a doubly iterative inverse-power method that can give reduced memory and runtime requirements in situations where other iterative methods are limited due to poor bandwidth and profile reduction. The relevant methods are demonstrated on several prototypical quantum optical systems where it is found that iterative methods based on iLU factorization using reverse Cuthill-Mckee ordering tend to outperform other solution techniques in terms of both memory consumption and runtime as the size of the underlying Hilbert space increases. For eigenvalue solving, Krylov iterations using the stabilized bi-conjugate gradient method outperform generalized minimal residual methods. In contrast, minimal residual methods work best for solvers based on direct LU decomposition. This work serves as a guide for solving the steady-state density matrix of an arbitrary quantum optical system, and points to several avenues of future research that will extend the applicability of these classical algorithms in absence of a quantum computer.

arXiv:1504.06768•Apr 25, 2015•15 citations
We present a finite-element approach for computing the aggregate scattering matrix of a network of linear coherent scatterers. These might be optical scatterers or more general scattering coins studied in quantum walk theory. While techniques exist for two-dimensional lattices of feed-forward scatterers, the present approach is applicable to any network configuration of any collection of scatterers. Unlike traditional finite-element methods in optics, this method does not directly solve Maxwell’s equations; instead it is used to assemble and solve a linear, coupled scattering problem that emerges after Maxwell’s equations are abstracted within the scattering matrix method. With this approach, a global unitary is assembled corresponding to one time step of the quantum walk on the network. After applying the relevant boundary conditions to this global matrix, the problem becomes non-unitary and possesses a steady-state solution that is the output scattering state. We provide an algorithm to obtain this steady-state solution exactly using a matrix inversion, yielding the scattering state without requiring a direct calculation of the eigenspectrum. The approach is then numerically validated on a coupled-cavity interferometer example that possesses a known, closed-form solution. Finally, the method is shown to be a generalization of the Redheffer star product, which describes scatterers on one-dimensional lattices (2-regular graphs) and is often applied to the design of thin-film optics, making the current approach an invaluable tool for the design and validation of high-dimensional phase-reprogrammable optical devices and study of quantum walks on arbitrary graphs.
We describe a method for obtaining the scattering matrix for nuclear or chemical reactions on a finite lattice. Aside from the preparation of the initial and final states as wave packets, the only other operation required is unitary time evolution, making this approach ideal for simulations on quantum hardware. The central quantity is a time-dependent overlap between incoming and outgoing wave packets whose Fourier transform corresponds to the scattering matrix at fixed energy, from which one can calculate elastic and inelastic cross sections for reactions involving two interacting clusters. Working in Cartesian coordinates enables an efficient encoding of the problem on quantum hardware via the first quantization mapping, with favorable qubit scaling for describing asymptotic scattering states. Within this framework, we describe a quantum algorithm for probing the scattering amplitude through different angles, including the forward direction, which provides access to the total cross section via the optical theorem. We demonstrate our methods through a series of numerical examples, for both elastic and inelastic processes, comparing against exact calculations. The techniques we describe can more readily be extended to a large number of constituent particles than other existing approaches, once fault-tolerant quantum hardware becomes available.
The optical beam splitter is one of the main building blocks in photonics-based quantum information processing. Traditionally, beam splitters are used in feed-forward configurations that reflect their natural directional-bias, meaning a photon cannot leave the scattering element through the entrance port. However, this directional-bias constraint can be circumvented by designing new linear-optical configurations that include mirrors in addition to the beam splitter. This directionality removal restores a full symmetry in the scattering element and allows the input photon to leave the system also from the input port. Such a system can be seen as a scattering center, enabling execution of quantum walks on rather complex optical graph networks with great savings in hardware resources when compared with existing approaches utilizing directionally-biased devices. The directionallyunbiased configuration can be realized using different optical systems. Analysis of some originally directional optical devices and the basic principles of their conversion into directionally-unbiased systems form the base of this paper. Several quantum walk procedures executed on graph networks constructed using directionallyunbiased nodes are discussed.
The optical beam splitter is a widely-used device in photonics-based quantum information processing. Specifically, linear optical networks demand large numbers of beam splitters for unitary matrix realization. This requirement comes from the beam splitter property that a photon cannot go back out of the input ports, which we call “directionally-biased”. Because of this property, higher dimensional information processing tasks suffer from rapid device resource growth when beam splitters are used in a feed-forward manner. Directionally-unbiased linear-optical devices have been introduced recently to eliminate the directional bias, greatly reducing the numbers of required beam splitters when implementing complicated tasks. Analysis of some originally directional optical devices and basic principles of their conversion into directionally-unbiased systems form the base of this paper. Photonic quantum walk implementations are investigated as a main application of the use of directionally-unbiased systems. Several quantum walk procedures executed on graph networks constructed using directionally-unbiased nodes are discussed. A significant savings in hardware and other required resources when compared with traditional directionally-biased beam-splitter-based optical networks is demonstrated.
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix, namely, the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk, namely, the optical quantum walk, whose underlying graph is a 2-regular directed graph and obtained by blowing up the original graph in some way. We propose a design of an optical circuit which implements the stationary state of the optical quantum walk. We show that if the induced optical quantum walk does not have +1+1+1 eigenvalue, then the stationary state of the optical quantum walk gives that of the original circulant quantum walk. From this result, we give a useful condition for the setting of the circulant quantum walks which can be implemented by this optical circuit.
There are presently two models for quantum walks on graphs. The ``coined'' walk uses discrete-time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walk operates with continuous time. Here a third model for quantum walks is proposed, which is based on an analogy to optical interferometers. It is a discrete-time model, and the unitary operator that advances the walk one step depends only on the local structure of the graph on which the walk is taking place. This type of walk also allows us to introduce elements, such as phase shifters, that have no counterpart in classical random walks. Several examples are discussed.
We discuss the numerical solution methods available when solving for the steady-state density matrix of a time-independent open quantum optical system, where the system operators are expressed in a suitable basis representation as sparse matrices. In particular, we focus on the difficulties posed by the non-Hermitian structure of the Lindblad super operator, and the numerical techniques designed to mitigate these pitfalls. In addition, we introduce a doubly iterative inverse-power method that can give reduced memory and runtime requirements in situations where other iterative methods are limited due to poor bandwidth and profile reduction. The relevant methods are demonstrated on several prototypical quantum optical systems where it is found that iterative methods based on iLU factorization using reverse Cuthill-Mckee ordering tend to outperform other solution techniques in terms of both memory consumption and runtime as the size of the underlying Hilbert space increases. For eigenvalue solving, Krylov iterations using the stabilized bi-conjugate gradient method outperform generalized minimal residual methods. In contrast, minimal residual methods work best for solvers based on direct LU decomposition. This work serves as a guide for solving the steady-state density matrix of an arbitrary quantum optical system, and points to several avenues of future research that will extend the applicability of these classical algorithms in absence of a quantum computer.