We present a general design framework for arbitrary optical unitary gates based on Riemannian gradient descent on a product manifold, in which the unitary constraint is preserved throughout the optimization. The proposed method is applied to the design of all-optical binary phase-shift keying (BPSK) decoders, yielding one- to six-bit decoders that realise one-hot decoding. The optimised three-bit decoder is further decomposed into a Clements Mach--Zehnder interferometer (MZI) mesh, and circuit-level simulation confirms close agreement with the theoretical prediction. These results demonstrate that the proposed framework provides a scalable and physically implementable approach to the design of arbitrary linear-optical circuits.
We present a general design framework for arbitrary optical unitary gates based on Riemannian gradient descent on a product manifold, in which the unitary constraint is preserved throughout the optimization. The proposed method is applied to the design of all-optical binary phase-shift keying (BPSK) decoders, yielding one- to six-bit decoders that realise one-hot decoding. The optimised three-bit decoder is further decomposed into a Clements Mach--Zehnder interferometer (MZI) mesh, and circuit-level simulation confirms close agreement with the theoretical prediction. These results demonstrate that the proposed framework provides a scalable and physically implementable approach to the design of arbitrary linear-optical circuits.
Many applications of linear optics in quantum science involve searching for some optimal configuration of a multiport interferometer. For example, to find heralded state preparations, one can optimize the interferometer to maximize the fidelity and success probability of the state preparation. In this paper, we derive a closed analytical formula for the Riemannian gradient of any differentiable function defined over the interferometer unitaries. We use this gradient in Riemannian optimization algorithms, such as gradient descent or BFGS, to find the optimal setup of the interferometer. As an interesting use case, we search for linear optical state preparations, improving some of the success probabilities reported in the literature for NOON or photon catalysis preparations. Finally, we show that our optimizer is orders of magnitude faster than other methods in the literature, opening the door for solving linear optical problems involving more modes and photons.
This paper explores the application of the parameter-shift rule (PSR) for computing gradients in unitary optical neural networks (UONNs). While backpropagation has been fundamental to training conventional neural networks, its implementation in optical neural networks faces significant challenges due to the physical constraints of optical systems. We demonstrate how PSR, which calculates gradients by evaluating functions at shifted parameter values, can be effectively adapted for training UONNs constructed from Mach-Zehnder interferometer meshes. We develop a theoretical framework for two distinct scenarios, real-valued outputs and complex-valued outputs of optical networks, which derives exact analytical gradients directly from hardware measurements for phase parameters in optical neural networks. For the first real-valued scenario, the gradient calculation directly conforms to PSR. For the second complex-valued scenario, we improved PSR to obtain the gradient. Then we simulate the training of optical neural networks based on optical PSR and both scenarios complete the classification tasks well. The optical PSR offers a powerful and analytically precise approach for calculating gradients in unitary optical neural networks. This approach offers a promising alternative to traditional in silico training methods and circumvents the limitations of both finite difference approximations and all-optical backpropagation implementations. We present the theoretical framework and practical methodology for applying PSR to optimize phase parameters in optical neural networks, potentially advancing the development of efficient hardware-based training strategies for optical computing systems.
We propose a framework to design and optimize generic photonic quantum circuits composed of Gaussian objects (pure and mixed Gaussian states, Gaussian unitaries, Gaussian channels, Gaussian measurements) as well as non-Gaussian effects such as photon-number-resolving measurements. In this framework, we parametrize a phase space representation of Gaussian objects using elements of the symplectic group (or the unitary or orthogonal group in special cases), and then we transform it into the Fock representation using a single linear recurrence relation that computes the Fock amplitudes of any Gaussian object recursively. We also compute the gradient of the Fock amplitudes with respect to phase space parameters by differentiating through the recurrence relation. We can then use Riemannian optimization on the symplectic group to optimize M M -mode Gaussian objects, avoiding the need to commit to particular realizations in terms of fundamental gates. This allows us to “mod out” all the different gate-level implementations of the same circuit, which now can be chosen after the optimization has completed. This can be especially useful when looking to answer general questions, such as bounding the value of a property over a class of states or transformations, or when one would like to worry about hardware constraints separately from the circuit optimization step. Finally, we make our framework extendable to non-Gaussian objects that can be written as linear combinations of Gaussian ones, by explicitly computing the change in global phase when states undergo Gaussian transformations. We implemented all of these methods in the freely available open-source library MrMustard, which we use in three examples to optimize the 216-mode interferometer in Borealis, and 2- and 3-modes circuits (with Fock measurements) to produce cat states and cubic phase states.
Few-mode optical quantum circuits can be simulated and optimized using gradient-descent methods, as optical gates can be parametrized by continuous parameters. However, the parameter space as seen by a nonholomorphic cost function is not Euclidean, which means that the Euclidean gradient does not generally point in the direction of steepest ascent. In order to retrieve the true steepest-ascent direction, one must take into account the local metric in what is known as the natural-gradient (NG) method. In this work we implement the NG for the optimization of optical quantum circuits. Specifically, we adapt the NG approach to a complex-valued parameter space, allowing us to apply the NG method directly within the Bargmann formalism, which we rely on for transforming between phase space and Fock space. We then compare the NG approach to vanilla gradient descent and to Adam over two standard state-preparation benchmarks: a single-photon source and a Gottesman-Kitaev-Preskill state source. We observe that the NG approach converges significantly faster (due in part to the possibility of using larger learning rates) and with a smoother decay of the cost function throughout the optimization. This result further improves our ability to design quantum circuits via classical optimization methods.
Abstract A design framework to implement non-unitary input–output operations to a practical unitary photonic integrated circuit is described. This is achieved by utilising the cosine-sine decomposition to recover the unitarity of the original operation. The recovered unitary operation is decomposed into fundamental unitary building blocks, forming a photonic integrated circuit network based on directional couplers and waveguide phase shifters. The individual building blocks are designed and optimised by three-dimensional full-wave simulations and scaled up using a circuit approach. The paper investigates the scalability and robustness of the design approach. Our study demonstrates that the proposed approach of performing unitary matrix completion can be applied to any arbitrary matrices. This design approach allows for implementation of non-unitary operations to perform various linear functions in neuromorphic photonics for computing, sensing, signal processing and communications.
We adapt an algorithm for CNOT circuits synthesis based on the Bruhat decomposition to the design of linear optical circuits with Mach-Zehnder interferometers (MZI). The synthesis algorithm reduces to designing sorting networks with nearest neighbor swapping operations as elementary gates. We recover previous designs from the literature but with additional theoretical properties regarding the compiler that implements unitaries on the interferometer. Notably the compiler can always decide whether a unitary can be implemented on a given interferometer and, if so, returns the shallowest possible implementation. We also show natural extensions of our framework for boson sampling experiments and for the coupling of multiple integrated interferometers to design larger linear optical systems. In both cases, the designs are optimal in terms of number of optical components. Finally, we propose a greedy design which exploits the arbritrary-but-fixed coupling of separate integrated interferometers to perform shallow boson sampling. We discuss the optimal interferometer dimensions to maximize the transmission. Beyond boson sampling, our developed framework allows a resource-favourable implemention of any non-adaptive linear optical quantum algorithm, by providing the shallowest possible interferometer for implementing this algorithm.