Networks of tunable, integrated optical interferometers support quantum information processing and machine learning with much better energy efficiency than standard electronics. A network's gridlike structure and imperfections localize optical signals propagating through the device, which ultimately slows training by gradient-based optimization. Here this problem is solved by proper initialization, combined with redundant and remotely interacting interferometers. The authors' approach improves the convergence time of gradient-based optimization to random target operators by at least two orders of magnitude, at the scale of practical machine-learning applications (10${}^{4}$ to 10${}^{6}$ nodes).
Networks of tunable, integrated optical interferometers support quantum information processing and machine learning with much better energy efficiency than standard electronics. A network's gridlike structure and imperfections localize optical signals propagating through the device, which ultimately slows training by gradient-based optimization. Here this problem is solved by proper initialization, combined with redundant and remotely interacting interferometers. The authors' approach improves the convergence time of gradient-based optimization to random target operators by at least two orders of magnitude, at the scale of practical machine-learning applications (104 to 106 nodes).
Parametrized quantum optical circuits are a class of quantum circuits in which the carriers of quantum information are photons and the gates are optical transformations. Classically optimizing these circuits is challenging due to the infinite dimensionality of the photon number vector space that is associated to each optical mode. Truncating the space dimension is unavoidable, and it can lead to incorrect results if the gates populate photon number states beyond the cutoff. To tackle this issue, we present an algorithm that is orders of magnitude faster than the current state of the art, to recursively compute the exact matrix elements of Gaussian operators and their gradient with respect to a parametrization. These operators, when augmented with a non-Gaussian transformation such as the Kerr gate, achieve universal quantum computation. Our approach brings two advantages: first, by computing the matrix elements of Gaussian operators directly, we don't need to construct them by combining several other operators; second, we can use any variant of the gradient descent algorithm by plugging our gradients into an automatic differentiation framework such as TensorFlow or PyTorch. Our results will find applications in quantum optical hardware research, quantum machine learning, optical data processing, device discovery and device design.
The rapid growth of machine learning (ML) has been accompanied by a significant challenge: the scaling of optimization algorithms to handle the immense parameter spaces of modern models, such as deep neural networks. Traditional optimization methods, including gradient descent and its variants, often encounter difficulties in efficiently exploring these spaces, leading to slow training times and potential stagnation. This paper investigates the application of quantum-inspired optimization techniques to address this scaling problem. We explore algorithms inspired by quantum annealing and other quantum phenomena, adapting their core principles to classical computation. Specifically, we propose a novel optimization framework utilizing a stochastic search strategy based on quantum superposition and measurement, designed to navigate high-dimensional parameter spaces more effectively. The efficacy of this approach is evaluated through theoretical analysis and conceptual simulations, demonstrating its potential to accelerate the training of large-scale machine learning models. We demonstrate how these methods can improve convergence speed and potentially escape local minima more effectively than conventional techniques. The core contribution lies in providing a theoretical foundation and a practical framework for applying quantum-inspired concepts to optimization within the context of machine learning.
The training of large-scale machine learning models presents significant computational challenges, primarily due to the inherent complexity of optimization algorithms like stochastic gradient descent (SGD) and its variants. These algorithms often struggle with convergence speed, getting trapped in local minima, and the ability to effectively explore the vast solution space. This paper investigates the potential of quantum-inspired optimization techniques to address these limitations. Specifically, we explore the application of quantum annealing and variational quantum eigensolver (VQE) approaches to accelerate the training and optimization process of large-scale machine learning models. Our core claim is that by mapping the optimization problem to a quantum system, we can leverage quantum computation to overcome the computational bottlenecks associated with classical optimization methods. We propose a framework where the objective function of the machine learning model is translated into a Hamiltonian for a quantum annealer or the cost function for a VQE, enabling a quantum-inspired solution. The results, while theoretical in this initial exploration, demonstrate a potential pathway for significantly reducing training times and improving the overall performance of large-scale machine learning models. Further research is needed to develop efficient hybrid quantum-classical algorithms and explore the practical limitations of this approach.
Integrated photonic technologies have recently shown significant advances, enabling the possibility to implement reconfigurable interferometers with increasing size. One of the main tasks to fully exploit the capabilities of reconfigurable integrated interferometers is the possibility to precisely program their operation to perform a desired target unitary. While recipes are known for circuit layouts based on a cascade of beam-splitter and phase-shifter operations, a methodology applicable for reconfigurable continuously-coupled waveguide arrays is currently missing. Here, we devise a machine learning based approach for this task, using a black box methodology that does not rely on precise a-priori modeling of the circuit internal architectures. We verify the effectiveness and the robustness of this approach via numerical simulations on different continuously-coupled waveguides layouts, either with planar or 3D structures. The proposed method makes use of a limited number of single- and two-photon measurements, making it suitable for optical quantum information processing. The obtained results open the perspective of employing this methodology as an effective tool to program the operation of integrated interferometers designed via different architectures.
Tensor networks have demonstrated significant value for machine learning in a myriad of different applications. However, optimizing tensor networks using standard gradient descent has proven to be difficult in practice. Tensor networks suffer from initialization problems resulting in exploding or vanishing gradients and require extensive hyperparameter tuning. Efforts to overcome these problems usually depend on specific network architectures, or ad hoc prescriptions. In this paper we address the problems of initialization and hyperparameter tuning, making it possible to train tensor networks using established machine learning techniques. We introduce a `copy node' method that successfully initializes arbitrary tensor networks, in addition to a gradient based regularization technique for bond dimensions. We present numerical results that show that the combination of techniques presented here produces quantum inspired tensor network models with far fewer parameters, while improving generalization performance.
Large-scale machine learning (ML) models, particularly deep neural networks, often present significant challenges for traditional optimization algorithms. These algorithms, rooted in classical mechanics, frequently encounter issues such as getting trapped in local optima, high computational cost, and difficulty in handling complex, non-convex landscapes. This paper investigates the application of quantum-inspired optimization techniques to address these challenges. We explore how concepts derived from quantum phenomena – such as quantum annealing and quantum walks – can be adapted to efficiently navigate and optimize large-scale ML models. The core idea is to leverage the probabilistic and superposition properties inherent in quantum mechanics to escape local optima and accelerate the convergence process. We present a framework for designing and implementing quantum-inspired optimization strategies, focusing on the theoretical foundations and potential benefits. The proposed approach aims to provide a novel and effective solution for optimizing complex ML models, ultimately improving model performance and reducing training time. This work contributes to the growing field of quantum machine learning and offers a promising avenue for tackling the optimization problems inherent in large-scale ML.