We care about your data, and we'd like to use cookies to give you a smooth browsing experience. Please agree and read more about our privacy policy.
Quanta Homepage
  • Physics
  • Mathematics
  • Biology
  • Computer Science
  • Topics
  • Archive

What's up in

computational complexity

Latest Articles

geometry

Mathematicians Complete Quest to Build ‘Spherical Cubes’

By Jordana Cepelewicz
February 10, 2023
Comment
Read Later

Is it possible to fill space “cubically” with shapes that act like spheres? A proof at the intersection of geometry and theoretical computer science says yes.

Shang-Hua Teng in a blazer on a street
Q&A

The Computer Scientist Who Finds Life Lessons in Games

By Ben Brubaker
January 25, 2023
Comment
Read Later

In Shang-Hua Teng’s work, theoretical and practical questions have long been intertwined. Now he’s turning his focus to the impractical.

Purple illustration of round qubits pointing to rows of blocks that progressively become more chaotic.
quantum computing

New Algorithm Closes Quantum Supremacy Window

By Ben Brubaker
January 9, 2023
Comment
Read Later

Random circuit sampling, a popular technique for showing the power of quantum computers, doesn’t scale up if errors go unchecked.

2022 in Review

The Year in Computer Science

By Bill Andrews
December 21, 2022
Comment
Read Later

Computer scientists this year learned how to transmit perfect secrets, why transformers seem so good at everything, and how to improve on decades-old algorithms (with a little help from AI).

quantum computing

After a Quantum Clobbering, One Approach Survives Unscathed

By Allison Parshall
December 7, 2022
Comment
Read Later

A quantum approach to data analysis that relies on the study of shapes will likely remain an example of a quantum advantage — albeit for increasingly unlikely scenarios.

cryptography

How Do You Prove a Secret?

By Sheon Han
October 11, 2022
Comment
Read Later

Zero-knowledge proofs allow researchers to prove their knowledge without divulging the knowledge itself.

Red particles with varying spins and some entanglement
computational complexity

Computer Science Proof Unveils Unexpected Form of Entanglement

By Mordechai Rorvig
July 18, 2022
Comment
Read Later

Three computer scientists have posted a proof of the NLTS conjecture, showing that systems of entangled particles can remain difficult to analyze even away from extremes.

computational complexity

How Computer Scientists Learned to Reinvent the Proof

By Mordechai Rorvig
May 23, 2022
Comment
Read Later

Why verify every line of a proof, when just a few checks will do?

Illustration of an ornate balance demonstrating that the expression x2 + 2x + 1 weighs more than the equivalent expression (x + 1)(x + 1)
computational complexity

Computer Scientists Prove That Certain Problems Are Truly Hard

By Mordechai Rorvig
May 11, 2022
Comment
Read Later

Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Researchers have now shown how to do that for a major class of problems.


Previous
  • 1
  • 2
  • 3
  • 4
  • ...
  • 5
Next
Follow Quanta
Facebook
Facebook

Twitter
Twitter

Youtube
YouTube

Instagram
Instagram

RSS
RSS

Newsletter

Past Month

Most Read Articles

This Data is Current Loading...
This Data is Current Loading...
This Data is Current Loading...
The Quanta Newsletter

Get highlights of the most important news delivered to your email inbox

Recent newsletters
Quanta Homepage
Facebook
Twitter
Youtube
Instagram

  • About Quanta
  • Archive
  • Contact Us
  • Terms & Conditions
  • Privacy Policy
  • Simons Foundation
All Rights Reserved © 2023