Category: Complexity

Observation of 2D dam break flow and a gaseous phase of solitons in a photon fluid in PRL

We report the observation of a two-dimensional dam break flow of a photon fluid in a nonlinear optical crystal. By precisely shaping the amplitude and phase of the input wave, we investigate the transition from one-dimensional (1D) to two-dimensional (2D) nonlinear dynamics. We observe wave breaking in both transverse spatial dimensions with characteristic timescales determined by the aspect ratio of the input box-shaped field. The interaction of dispersive shock waves propagating in orthogonal directions gives rise to a 2D ensemble of solitons. Depending on the box size, we report the evidence of a dynamic phase characterized by a constant number of solitons, resembling a 1D solitons gas in integrable systems. We measure the statistical features of this gaseous-like phase. Our findings pave the way to the investigation of collective solitonic phenomena in two dimensions, demonstrating that the loss of integrability does not disrupt the dominant phenomenology.

https://arxiv.org/abs/2409.18738

https://mathstodon.xyz/@nonlinearxwaves/113258813170717367

https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.133.183801

Efficient Computation Using Spatial-Photonic Ising Machines: Utilizing Low-Rank and Circulant Matrix Constraints

https://arxiv.org/abs/2406.01400

We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive Ising problems that employ low-rank and circulant coupling matrices. Our results indicate that the performance of SPIMs is critically affected by the rank and precision of the coupling matrices. By developing and assessing advanced decomposition techniques, we expand the range of problems SPIMs can solve, overcoming the limitations of traditional Mattis-type matrices. Our approach accommodates a diverse array of coupling matrices, including those with inherently low ranks, applicable to complex NP-complete problems. We explore the practical benefits of low-rank approximation in optimization tasks, particularly in financial optimization, to demonstrate the real-world applications of SPIMs. Finally, we evaluate the computational limitations imposed by SPIM hardware precision and suggest strategies to optimize the performance of these systems within these constraints.

Optimal quantum key distribution networks: capacitance versus security

The rate and security of quantum communications between users placed at arbitrary points of a quantum communication network depend on the structure of the network, on its extension and on the nature of the communication channels. In this work we propose a strategy for the optimization of trusted-relays based networks that intertwines classical network approaches and quantum information theory. Specifically, by suitably defining a quantum communication efficiency functional, we identify the optimal quantum communication connections through the network by balancing security and the quantum communication rate. The optimized network is then constructed as the network of the maximal quantum communication efficiency connections and its performance is evaluated by studying the scaling of average properties as functions of the number of nodes and of the network spatial extension.

https://www.nature.com/articles/s41534-024-00828-7