Entropy Computing, A Paradigm for Optimization in Open Photonic Systems
arXiv:2407.04512 · doi:10.1038/s42005-025-02324-6
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.
Accepted in Communications Physics, latest arXiv version includes supplemental material as part of main document. Changes to author names and title in final submission to ensure exact match with journal version
References in corpus (23)
- Ising formulations of many NP problems
- Spatial search by quantum walk
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
- Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity
- Probabilistic computing with p-bits
- Quantum Annealing for Combinatorial Clustering
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Annealing by simulating the coherent Ising machine
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Computational advantage from quantum superposition of multiple temporal orders of photonic gates
- Coherent Ising machines -- Quantum optics and neural network perspectives
- MAX 2-SAT with up to 108 qubits
- A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph
- Deterministic Generation of Large Fock States
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Gaussian Optical Ising Machines
- Single-Photon Vibrometry
- A Super-resolution Optical Classifier with High Photon Efficiency
- Algorithm-Oriented Qubit Mapping for Variational Quantum Algorithms
- Grover Speedup from Many Forms of the Zeno Effect
- Zeno-effect Computation: Opportunities and Challenges