Quick Navigation
Topics
Quantum Algorithms
Coupling Light with Matter for Identifying Dominant Subnetworks
arXiv
Authors: Airat Kamaletdinov, Natalia G. Berloff
Year
2024
Paper ID
67242
Status
Preprint
Abstract Read
~2 min
Abstract Words
174
Citations
N/A
Abstract
We introduce DOMINO, a light-matter computing platform that exploits the full complex amplitude of coupled condensate networks to solve maximum-weight clique problems and reveal hidden indirect correlations in large graphs. By embedding network structure directly into a gain-controlled polaritonic (or photonic) oscillator array, DOMINO performs analog optimization, directly solving the maximum-weight clique problem via the gain-controlled minimisation, through a physically enforced global-intensity constraint, allowing the system to converge rapidly to dominant subnetworks while simultaneously extracting phase, encoded co- and counter-regulation patterns. This gain-based mechanism unlocks capabilities inaccessible to conventional Ising-type simulators: all degrees of freedom (amplitude and phase) participate in the computation, dramatically expanding the class of problems that can be efficiently encoded. Our approach is inherently ultrafast, energy-efficient, and naturally robust to noise, requiring no digital post-processing. Applied to real gene-gene coexpression data, DOMINO reliably identifies biologically meaningful transcription-regulator modules and exposes latent regulatory relationships. Because the method applies generically to any weighted network, it establishes a scalable physical route to solving high-value graph-analytic tasks across biology, finance, social systems, and engineered networks.
Why This Paper Matters
- It adds a 2024 reference point for readers tracking recent quantum research.
- We introduce DOMINO, a light-matter computing platform that exploits the full complex amplitude of coupled condensate networks to solve maximum-weight clique problems and...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.