Which problems can and can't a quantum computer solve? - Ricardo Rivera Cardoso

Giving a definite answer to this question could either be the cause for celebration or concern, as quantum computing now connects many of the natural sciences and has received significant attention and funding across the globe. To study this question formally, we must turn to a sub-field of computer science called “complexity theory”. Here, we will introduce some of the basics of this field and illustrate the best answer we can provide currently. Along the way, we will discuss the relationship between classical and quantum computers, and whether one is truly more powerful than the other. Finally, we will discuss some shortcomings of the picture we’ve painted so far, which relate to approximation algorithms, average-case complexity, and quantum computers without fault-tolerance.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-11-08
DOI
https://doi.org/10.5281/zenodo.17666126
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Which problems can and can't a quantum computer solve? - Ricardo Rivera Cardoso

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Which problems can and can't a quantum computer solve? - Ricardo Rivera Cardoso

article en

Abstract

Giving a definite answer to this question could either be the cause for celebration or concern, as quantum computing now connects many of the natural sciences and has received significant attention and funding across the globe. To study this question formally, we must turn to a sub-field of computer science called “complexity theory”. Here, we will introduce some of the basics of this field and illustrate the best answer we can provide currently. Along the way, we will discuss the relationship between classical and quantum computers, and whether one is truly more powerful than the other. Finally, we will discuss some shortcomings of the picture we’ve painted so far, which relate to approximation algorithms, average-case complexity, and quantum computers without fault-tolerance.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 22%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.