TL;DR
Get the latest gadgets delivered free with Prime
- Fast, free delivery on millions of items
- Prime Video, Amazon Music and more included
- Member-only deals all year
A preprint by researchers affiliated with universities, companies and the Open Quantum Institute at CERN catalogs 24 computational problems where quantum computers could have substantial speedups under specified conditions. The authors stress that these are not guarantees of practical advantage: input preparation, error correction and extracting useful results can outweigh gains in the main calculation.
Researchers have published a preprint mapping 24 computational problems where quantum computers may achieve substantial speedups over classical methods, while identifying conditions that could determine whether those gains are useful in practice. The guide, produced by researchers affiliated with the Open Quantum Institute at CERN, Google Quantum AI, Microsoft and other institutions, spans fields including chemistry, optimization and data analysis.
The paper is a synthesis of existing research, not a report of a new experiment demonstrating quantum advantage on all 24 problems. For each entry, the researchers describe its mathematical structure, data requirements and other conditions relevant to preserving a possible quantum edge. The collection also covers number theory, statistical inference, quantum simulation, linear algebra, and the analysis of shapes and connections in data. Potential applications include chemistry, materials research, signal processing and code breaking, but the support and maturity of the evidence differ across topics.
The authors focus on speedups greater than quadratic, reasoning that a stronger improvement may be needed to offset the operating costs of early, error-corrected quantum computers. These speedup categories describe how computational work scales as problems grow; they are not guarantees of a fixed real-world time advantage. The paper compares quantum approaches with the best classical methods currently known, while noting those methods could improve. Its evidence ranges from rigorous mathematical results to results limited to particular classical methods or supported by numerical and heuristic studies.
One example is solving systems of linear equations. Quantum algorithms may offer exponential improvements in some settings, the study says, but only if the input can be loaded efficiently and the equations avoid numerical difficulties. Output also matters: extracting a few overall measurements may be practical, while recovering every value in a large answer could consume the expected savings. Similar constraints apply to arbitrary datasets: if preparing input takes work proportional to the dataset’s size, it may cancel an apparent advantage in the central computation.
Conditions Determine Practical Speedups
The study’s value is its focus on the whole computation, rather than the speed of a quantum algorithm in isolation. A calculation can have a favorable theoretical scaling and still be slower or more resource-intensive once data preparation, error correction and result extraction are included. For scientists and businesses evaluating quantum computing, those costs affect whether a proposed application is worth pursuing.
The catalog also offers a way to assess possible uses against the structure a quantum method requires. The authors recommend starting with computational tasks for which a quantum advantage has supporting evidence, then identifying real-world problems that match those requirements. That approach is more grounded than selecting a pressing scientific or commercial challenge first and assuming a quantum solution will follow. The study does not show that the listed applications are ready for deployment; it frames them as candidates whose feasibility depends on further work.
Products Worth Considering
DJI Mic 3 Wireless Microphone Kit (2 Transmitters, 1 Receiver, Charging Case)
Amazon Kindle Scribe (64GB) with Premium Pen, Metallic Jade
LG UltraGear 34GX90SA-W 34-inch WQHD Curved OLED Gaming Monitor
As an affiliate, we earn on qualifying purchases.
From Algorithms to Real Applications
A quantum speedup compares how the work required by an algorithm grows with problem size. It does not automatically mean that a quantum device will finish a particular job sooner: each quantum operation may carry different time and resource costs, and the classical comparison may change as algorithms improve. The study’s greater-than-quadratic threshold reflects the researchers’ view of what may be needed to compensate for the overhead of early fault-tolerant machines.
The chemistry examples illustrate the potential and the limits. Calculating a molecule’s ground-state energy can help researchers understand how its atoms arrange and how it may react, with possible relevance to battery materials or carbon-capture substances. But a useful practical advantage depends on the system fitting available computing resources, the input being prepared efficiently, and the desired result being obtainable without excessive measurement. The source material does not establish that these requirements have been met for a specific commercial chemistry task.
“A theoretical speed advantage does not guarantee faster results in practice.”
— The study’s authors
Evidence and Feasibility Still Vary
The preprint does not establish that quantum computers already outperform classical machines across the 24 problems. The strength of support varies by entry, and the paper’s maximum-speedup labels describe the strongest result identified under specified conditions, not a promise for every instance. It is also not yet clear which candidates will yield practical advantages on real devices once input, error-correction and output costs are counted.
The source material provides no single timeline for when the listed applications might become practical, nor a uniform estimate of the resources required across all 24 problems. The classical benchmark may also change as new algorithms are developed. The paper is a preprint, so its findings should be treated as a research synthesis rather than as a peer-reviewed demonstration of performance.
Testing Candidates Against Full Costs
The next step described by the study is to match real computational tasks to problems whose possible quantum advantages have evidence and whose requirements can be met. That means testing whether inputs can be prepared efficiently, whether error correction and hardware resources are manageable, and whether the output can answer the scientific or operational question without costly data recovery.
Researchers will also need to compare complete quantum workflows with the best available classical methods as both fields develop. The paper does not announce a specific follow-up experiment or deployment date. For now, its catalog serves as a guide for choosing and evaluating candidate problems, with practical advantage still dependent on the conditions for each task.
Key Questions
What does the study report?
It catalogs 24 computational problems with potential for substantial quantum speedups and describes mathematical and practical conditions relevant to each. The paper synthesizes existing research; it does not report a new demonstration of advantage across all 24.
Does the study prove quantum computers are faster for these problems?
No. It identifies potential speedups under specified conditions. The evidence varies by problem, and the authors say that theoretical scaling does not guarantee faster practical results.
Why can data preparation affect a quantum speedup?
If loading or preparing the input takes work proportional to the dataset’s size, that cost can offset the speed gained during the quantum calculation. The same concern applies to error correction and extracting results.
What kinds of applications are covered?
The catalog includes areas such as chemistry, materials research, optimization, signal processing and code breaking. The study does not say that every application is ready for use; suitability depends on the problem’s structure and required resources.
Source: thequantuminsider.com
