Quantum annealer shows promise for solving polynomial systems of equations

Researchers from Lawrence Livermore National Laboratory (LLNL) have developed a new algorithm for solving polynomial systems of equations using a type of quantum computer called a quantum annealer.

This study provides evidence that quantum annealing could one day deliver quantum speedup. The team used the commercially available D-Wave 2000Q quantum annealer and found that problems scale well and different with quantum annealing when they increased the complexity of problems.

The research was published July 16 in Nature Scientific Reports. (Lawrence Livermore National Laboratory)

Read more.

Previous Article

InnoPACTT – Call for Projects

Next Article

Quantum interference from sources 150 million km apart

You might be interested in …

Leave a Reply

Your email address will not be published. Required fields are marked *

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

The reCAPTCHA verification period has expired. Please reload the page.