NP-completeness

Lightelligence Demo Harnesses Light to Tackle Some of the Hardest Computational Problems

Retrieved on: 
Wednesday, December 15, 2021

"These problems belong to an important class of intractable mathematical problems known as NP-complete,which have stumped mathematicians for the last 50 years," said Yichen Shen, Ph.D., founder and CEO of Lightelligence.

Key Points: 
  • "These problems belong to an important class of intractable mathematical problems known as NP-complete,which have stumped mathematicians for the last 50 years," said Yichen Shen, Ph.D., founder and CEO of Lightelligence.
  • The progress we've made on NP-complete combinatorial optimization problems illustrates the potential of our technology to transform computing."
  • To utilize the advantages of optical computing, Lightelligence has designed and built optical chips to work seamlessly with traditional electronic chips and systems.
  • The company is leading the way in developing real-world photonic solutions that will deliver orders of magnitude more speed in computing.