A5099023085- Neural Networks and Reservoir Computing
- Optical Network Technologies
- Quantum Computing Algorithms and Architecture
- Random lasers and scattering media
- Neural dynamics and brain function
- Advanced Memory and Neural Computing
- Quantum Information and Cryptography
Sapienza University of Rome
2024-2025
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mi>N</a:mi><a:mi>P</a:mi></a:math>-hard combinatorial optimization problems. Spatial photonic (SPIMs) exploit optical computing in free space accelerate the computation, showcasing parallelism, scalability, low power consumption. However, current SPIMs can implement only a restricted This partial programmability is...
<title>Abstract</title> We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive problems that employ low-rank and circulant coupling matrices. Our results indicate performance SPIMs is critically affected by rank precision By developing assessing advanced decomposition techniques, we expand range can solve, overcoming limitations traditional Mattis-type approach accommodates a diverse array matrices, including those with inherently low ranks,...
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic (SPIMs) exploit optical computing in free space accelerate the computation, showcasing parallelism, scalability, low power consumption. However, current SPIMs can implement only a restricted This partial programmability is critical limitation hampers their benchmark. Achieving full device while preserving its scalability open...
We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive problems that employ low-rank and circulant coupling matrices. Our results indicate performance SPIMs is critically affected by rank precision By developing assessing advanced decomposition techniques, we expand range can solve, overcoming limitations traditional Mattis-type approach accommodates a diverse array matrices, including those with inherently low ranks, applicable complex...