# Quantum Algorithms

Published articles for Quantum Algorithms.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## QOBLIB: tracking progress in quantum optimization

DevFeed: [QOBLIB: tracking progress in quantum optimization](<https://devfeed.tech/articles/qoblib-tracking-progress-in-quantum-optimization-17347.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/qoblib>)

Published: 2026-08-12T13:00:00Z

Content type: article

Language: en

Sources: [IBM Research](<https://devfeed.tech/sources/ibm-research.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [benchmarking](<https://devfeed.tech/topics/benchmarking.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>), [Framework](<https://devfeed.tech/topics/framework.md>), [Website](<https://devfeed.tech/topics/website.md>)

Tags: [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [community](<https://devfeed.tech/tags/community.md>), [framework](<https://devfeed.tech/tags/framework.md>), [news](<https://devfeed.tech/tags/news.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [quantum-community](<https://devfeed.tech/tags/quantum-community.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [research](<https://devfeed.tech/tags/research.md>), [science](<https://devfeed.tech/tags/science.md>)

### AI overview

IBM describes updates to the Quantum Optimization Benchmarking Library (QOBLIB), including a Nature Computational Science publication, a new website, and more than 2,000 submitted results. The initiative provides an open, community-driven framework for comparing quantum optimization benchmarks and assessing progress toward practical quantum advantage.

### Source excerpt

Quantum advantage is here. The next question is where to apply it. New updates from the Quantum Optimization Working Group offer a glimpse at the path ahead.

## The search for quantum advantage in differential equations

DevFeed: [The search for quantum advantage in differential equations](<https://devfeed.tech/articles/the-search-for-quantum-advantage-in-differential-equations-17336.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/hari-krovi-differential-equations>)

Author: Robert Davis

Published: 2026-08-03T13:00:00Z

Content type: article

Language: en

Sources: [IBM Research](<https://devfeed.tech/sources/ibm-research.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Complex Systems](<https://devfeed.tech/topics/complex-systems.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [complex-systems](<https://devfeed.tech/tags/complex-systems.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [mathematical-sciences](<https://devfeed.tech/tags/mathematical-sciences.md>), [physics](<https://devfeed.tech/tags/physics.md>), [q-a](<https://devfeed.tech/tags/q-a.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [research](<https://devfeed.tech/tags/research.md>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

IBM researcher Hari Krovi discusses quantum algorithms for solving certain differential equations and their potential to scale beyond classical methods in selected applications.

### Source excerpt

New quantum algorithms could unlock faster ways to model the complex systems behind circuits, fluids, finance, and more.

## Quantum advantage through trusted quantum computation

DevFeed: [Quantum advantage through trusted quantum computation](<https://devfeed.tech/articles/quantum-advantage-through-trusted-quantum-computation-17348.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/quantum-advantage>)

Published: 2026-07-30T10:00:00Z

Content type: article

Language: en

Sources: [IBM Research](<https://devfeed.tech/sources/ibm-research.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>)

Tags: [news](<https://devfeed.tech/tags/news.md>), [process](<https://devfeed.tech/tags/process.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-error-correction-mitigation](<https://devfeed.tech/tags/quantum-error-correction-mitigation.md>), [quantum-research](<https://devfeed.tech/tags/quantum-research.md>), [reporting](<https://devfeed.tech/tags/reporting.md>), [science](<https://devfeed.tech/tags/science.md>), [techniques](<https://devfeed.tech/tags/techniques.md>), [the-result](<https://devfeed.tech/tags/the-result.md>), [validation](<https://devfeed.tech/tags/validation.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

IBM reports three papers demonstrating quantum advantage with built-in validation, including validated error-mitigation techniques and methods for certifying classically hard quantum computations. The article explains how these approaches aim to establish trustworthy results when exact classical verification is unavailable.

### Source excerpt

Demonstration shows trusted quantum computation in regimes where classical methods fail.

## Quantum Computers Are Not a Threat to 128-bit Symmetric Keys

DevFeed: [Quantum Computers Are Not a Threat to 128-bit Symmetric Keys](<https://devfeed.tech/articles/quantum-computers-are-not-a-threat-to-128-bit-symmetric-keys-20691.md>)

Original publisher: [Read original article](<https://words.filippo.io/128-bits/>)

Author: Filippo Valsorda

Published: 2026-04-20T15:21:12Z

Content type: article

Language: en

Sources: [Filippo Valsorda](<https://devfeed.tech/sources/filippo-valsorda.md>)

Topics: [Post-Quantum](<https://devfeed.tech/topics/post-quantum.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Security](<https://devfeed.tech/topics/security.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [security](<https://devfeed.tech/tags/security.md>)

### AI overview

The article argues that quantum computers do not require larger symmetric key sizes during the post-quantum transition. It explains why Grover's algorithm does not reduce the practical security of AES-128 and SHA-256 enough to justify replacing 128-bit symmetric keys, while asymmetric cryptography remains affected by Shor's algorithm.

### Source excerpt

There is no need to update symmetric key sizes as part of the post-quantum transition, due to the details of how Grover's algorithm scales. Most authorities agree.