Computational complexity theory
Inherent difficulty of computational problems
Follow Computational complexity theory on Notably News to receive short updates to your email — rarely!
We include updates on Quantum computing, Big O notation, The Art of Computer Programming, Combinatorial optimization, Amortized analysis, Analysis of algorithms, Cook–Levin theorem, Quantum supremacy, Vapnik–Chervonenkis dimension, Reservoir sampling, Randomized algorithm, Deterministic algorithm, Graph isomorphism problem, Bernstein–Vazirani algorithm, Best, worst and average case, Pseudo-polynomial time ... and more.
| April 2024 |
Noisy intermediate-scale quantum era
Microsoft researchers announced a significant breakthrough in quantum computing, demonstrating a substantial reduction in error rates that would only require 4 logical qubits, potentially accelerating the timeline for large-scale quantum computing from decades to years.
|
| October 2023 |
Noisy intermediate-scale quantum era
Atom Computing achieves a milestone by developing a quantum processor with 1,180 qubits, becoming the first to pass the 1,000 qubit mark in quantum computing technology.
|
| 2019 |
Log-rank conjecture
An approximate version of the log-rank conjecture for randomised communication complexity was disproved.
|
| 2018 |
Noisy intermediate-scale quantum era
John Preskill coins the term 'Noisy Intermediate-Scale Quantum (NISQ)' to describe the current state of quantum computing technology with processors containing up to 1,000 qubits that are not yet fault-tolerant or capable of achieving quantum advantage.
|
This contents of the box above is based on material from the Wikipedia articles Noisy intermediate-scale quantum era, Combinatorial optimization, Log-rank conjecture & Algorithmic efficiency, which are released under the Creative Commons Attribution-ShareAlike 4.0 International License.