Toggle light / dark theme

As technology advances, the limitations of conventional electronic computers are becoming increasingly apparent, especially when tackling complex computational challenges. NP-complete problems, which grow exponentially with size, represent some of the toughest puzzles in computer science. These issues have significant implications across various fields, including biomedicine, transportation, and manufacturing. In the quest for more effective…

A new proof shows that an upgraded version of the 70-year-old Dijkstra’s algorithm reigns supreme: It finds the most efficient pathways through any graph.

It doesn’t just tell you the fastest route to one destination.


In an interview toward the end of his life, Dijkstra credited his algorithm’s enduring appeal in part to its unusual origin story. “Without pencil and paper you are almost forced to avoid all avoidable complexities,” he said.

Dijkstra’s algorithm doesn’t just tell you the fastest route to one destination. Instead, it gives you an ordered list of travel times from your current location to every other point that you might want to visit — a solution to what researchers call the single-source shortest-paths problem. The algorithm works in an abstracted road map called a graph: a network of interconnected points (called vertices) in which the links between vertices are labeled with numbers (called weights). These weights might represent the time required to traverse each road in a network, and they can change depending on traffic patterns. The larger a weight, the longer it takes to traverse that path.

To get a sense of Dijkstra’s algorithm, imagine yourself wandering through a graph, writing down the travel time from your starting point to each new vertex on a piece of scratch paper. Whenever you have a choice about which direction to explore next, head toward the closest vertex you haven’t visited yet. If you discover a faster route to any vertex, jot down the new time and cross out the old one. When you’re sure that you’ve found the fastest path, move the travel time from your notes to a separate, more presentable list.

Researchers at Berkeley Lab have advanced the understanding of magnetic skyrmions by developing techniques to image their 3D structures.

These nanoscale objects show promise for revolutionizing microelectronics through enhanced data storage capabilities and reduced energy consumption.

A difficult-to-describe nanoscale structure called the magnetic skyrmion holds potential for creating advanced microelectronic devices, including those with vast data storage capacities and significantly lower power requirements.

This finding, achieved independently by a team at Pennsylvania State University published in the same journal, holds immense potential for the development of nanophotonic devices.

Manipulating the flow of light in materials at small scales is crucial for creating efficient nanophotonic chips, the building blocks for future optical devices. In the realm of electronics, scientists can control the movement of electrons using magnetic fields.

The Lorentz force, exerted by the magnetic field, dictates the electron’s trajectory. However, this approach is inapplicable to photons – the fundamental particles of light – as they lack an electrical charge.

Researchers have developed a new “sandwich” structure material that exhibits the quantum anomalous Hall effect, enabling electrons to travel with almost no resistance at higher temperatures.

This breakthrough could significantly enhance computing power while dramatically reducing energy consumption. The structure is based on a layered approach with bismuth telluride and manganese bismuth telluride, promising faster and more efficient future electronic devices.

Quantum Material Innovations