Quantum computers promise enormous computational power, but the nature of quantum states makes computation and data ...

Rice computer scientists have developed algorithms that account for quantum noise that is not just random, but malicious ...

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.

A real-world example of an optimization problem could help ground some wacky terms like superposition and entanglement.

For decades, computer scientists working on negative-weight graphs tried to match the speed of Dijkstra’s algorithm with similar “combinatorial” algorithms. These involve discrete operations — like ...

Three computer scientists have disproved a long-standing conjecture about a fundamental problem involving imperfect information.

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...