Entropy Computing, A Paradigm for Optimization in Open Photonic Systems

• URL: http://arxiv.org/abs/2407.04512v4
• Date: Wed, 01 Oct 2025 05:33:38 GMT
• Title: Entropy Computing, A Paradigm for Optimization in Open Photonic Systems
• Abstract summary: We show the feasibility of the entropy computing by building a hybrid computer.<n>We show a proposed entropy computing paradigm can act as a scalable and versatile platform for tackling a large range NP-hard optimization problems.
• Score: 2.4744804342461504
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Finding better solutions to combinatorial optimization problems could have a large positive impact on many real-world application areas, such as logistics. For this reason, significant efforts have been made to design novel optimisation paradigms. Here we show an early instance of such paradigm in an optical setting, the entropy computing paradigm. Specifically, we experimentally demonstrate the feasibility of entropy computing by building a hybrid photonic-electronic computer that uses optical measurement and feedback to solve non-convex optimization problems. The system functions by using temporal photonic modes to create qudits in order to encode probability amplitudes in the time-frequency degree of freedom of a photon. This scheme, when coupled with with electronic interconnects, allows us to encode an arbitrary Hamiltonian into the system and solve non-convex continuous variables and combinatorial optimization problems. We show that the proposed entropy computing paradigm can act as a scalable and versatile platform for tackling a large range of NP-hard optimization problems.

Related papers

• Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems [0.0]
  We show that the imaginary time evolution guarantees convergence to the global minimum without critical slowing down.<n>We also show that the compilation process can be performed efficiently up to an arbitrary error threshold if the underlying physical system is of bounded order.
  arXiv  Detail & Related papers  (2025-06-03T15:52:06Z)
• Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices [7.954263125127824]
  We show how to solve Quadratic Unconstrained Binary Optimization problems using hybrid qubit$qux2014$ devices. The potential of hybrid quantum computers to tackle complex optimization problems in both academia and industry is highlighted.
  arXiv  Detail & Related papers  (2025-01-20T20:40:58Z)
• Successive optimization of optics and post-processing with differentiable coherent PSF operator and field information [9.527960631238173]
  We introduce a precise optical simulation model, and every operation in pipeline is differentiable.<n>To efficiently address various degradation, we design a joint optimization procedure that leverages field information.
  arXiv  Detail & Related papers  (2024-12-19T07:49:40Z)
• Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles [1.53934570513443]
  In this paper we build on the promising potential of parameter transferability across problem instances with similar local structures.<n>Our study reveals that, for maximum independent set problems on graph families with shared geometries, optimal parameters naturally concentrate.<n> Experimental results on the Orion Alpha platform validate the effectiveness of our approach, scaling to problems with up to $100$ qubits.
  arXiv  Detail & Related papers  (2024-11-25T18:41:02Z)
• Encoding arbitrary Ising Hamiltonians on Spatial Photonic Ising Machines [0.0]
  We introduce and experimentally validate a SPIM instance that enables direct control over the full interaction matrix. We demonstrate the conformity of the experimentally measured Ising energy with the theoretically expected values and then proceed to solve both the unweighted and weighted graph problems. Our approach greatly expands the applicability of SPIMs for real-world applications without sacrificing any of the inherent advantages of the system.
  arXiv  Detail & Related papers  (2024-07-12T10:54:07Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• NeurOLight: A Physics-Agnostic Neural Operator Enabling Parametric Photonic Device Simulation [17.295318670037886]
  A physics-agnostic neural framework, dubbed NeurOLight, is proposed to learn a family of frequency-domain Maxwell PDEs for ultra-fast parametric photonic device simulation. We show that NeurOLight generalizes to a large space of unseen simulation settings, demonstrates 2-orders-of-magnitude faster simulation speed than numerical solvers, and outperforms prior neural network models by 54% lower prediction error with 44% fewer parameters.
  arXiv  Detail & Related papers  (2022-09-19T21:25:26Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• SPDCinv: Inverse Quantum-Optical Design of High-Dimensional Qudits [8.257400045757374]
  Spontaneous parametric down-conversion in quantum optics is an invaluable resource for the realization of high-dimensional qudits with spatial modes of light. One of the main open challenges is how to directly generate a desirable qudit state in the SPDC process. Here, we introduce a physically-constrained and differentiable model, validated against experimental results for shaped pump beams and structured crystals.
  arXiv  Detail & Related papers  (2021-12-11T09:05:23Z)
• Quantum computing for classical problems: Variational Quantum Eigensolver for activated processes [0.0]
  This paper reports the development and implementation of a Variational Quantum Eigensolver procedure to solve the Fokker-Planck-Smoluchowski eigenvalue problem. We show that such an algorithm, typically adopted to address quantum chemistry problems, can be applied effectively to classical systems paving the way to new applications of quantum computers.
  arXiv  Detail & Related papers  (2021-07-27T18:16:16Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Polynomial unconstrained binary optimisation inspired by optical simulation [52.11703556419582]
  We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization. We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
  arXiv  Detail & Related papers  (2021-06-24T16:39:31Z)
• Speeding up Computational Morphogenesis with Online Neural Synthetic Gradients [51.42959998304931]
  A wide range of modern science and engineering applications are formulated as optimization problems with a system of partial differential equations (PDEs) as constraints. These PDE-constrained optimization problems are typically solved in a standard discretize-then-optimize approach. We propose a general framework to speed up PDE-constrained optimization using online neural synthetic gradients (ONSG) with a novel two-scale optimization scheme.
  arXiv  Detail & Related papers  (2021-04-25T22:43:51Z)
• Computing Free Energies with Fluctuation Relations on Quantum Computers [0.0]
  We present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. We successfully demonstrate a proof-of-concept of our algorithm using the transverse field Ising model on a real quantum processor.
  arXiv  Detail & Related papers  (2021-03-17T18:14:19Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Numerically exact open quantum systems simulations for arbitrary environments using automated compression of environments [0.0]
  We present a numerically exact method for simulating open quantum systems with arbitrary environments. Our approach automatically reduces the large number of environmental degrees of freedom to those which are most relevant. We demonstrate the power of this method by applying it to problems with bosonic, fermionic, and spin environments.
  arXiv  Detail & Related papers  (2021-01-05T17:07:05Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)
• Bayesian optimisation of large-scale photonic reservoir computers [0.774229787612056]
  Reservoir computing is a growing paradigm for simplified training of recurrent neural networks. Recent works in the field focus on large-scale photonic systems with tens of thousands of physical nodes and arbitrary interconnections.
  arXiv  Detail & Related papers  (2020-04-06T10:11:03Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.