Dr. Alejandro Mata Ali: Real limitations and new alternatives for quantum computing and technologies

Item: Dr. Alejandro Mata Ali: Real limitations and new alternatives for quantum computing and technologies
Rating: 4
Author: PostSingularity Institute

by Dr. Alejandro Mata Ali

Formal & Physical Sciences Computing & Cybersecurity UYComputer science UYXNatural computing

🎙 Dr. Alejandro Mata Ali 👥 122 📅 November 8, 2025 ⏱ 58 min 👁 64 📄 expert opinion 🧭 2026-08-16

Available in: English (current) Français

Keywords

quantum computinglimitationsQAOAVQEcryptography

Summary

In this talk, Dr. Alejandro Mata Ali critically examines the real limitations of quantum computing, aiming to lower unrealistic expectations. He begins by explaining the fundamental motivation for quantum computing: simulating quantum systems, which is exponentially hard classically. He then systematically analyzes several claimed applications. For cryptography, he notes that Shor’s algorithm could break RSA-2048 with about a million qubits, but the threat is mitigated by post-quantum cryptography, potentially eliminating this use case. For combinatorial optimization, he argues that the basic QAOA algorithm often fails to converge or produces poor solutions, especially beyond 16 variables, and that reported successes are often due to oversampling. He emphasizes that quantum computing is unlikely to solve NP-hard problems generally. For quantum simulation, he discusses VQE, which suffers from convergence issues and the challenge of choosing appropriate ansatzes. He also debunks the idea that Grover’s algorithm can speed up database searches, as data loading costs negate the quadratic advantage. Finally, he touches on quantum machine learning, where data loading is a major bottleneck. He proposes alternatives such as quantum-inspired computing and secure delegated quantum computing, suggesting that these may be more practical in the near term.

192 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides valuable critical insights into the current state of quantum computing, challenging hype and highlighting technical pitfalls. The argumentation is solid, based on algorithmic analysis and known results. For example, the discussion of QAOA’s oversampling issue is a nuanced point often overlooked. The speaker also correctly notes that quantum computing is not a universal speedup and that data loading is a major bottleneck. However, some arguments are presented without detailed evidence or citations, relying on the speaker’s expertise. The proposal of alternatives like quantum-inspired computing is interesting but not deeply elaborated.

Scientific Rigor, Source Quality, Title Accuracy

The speaker demonstrates scientific rigor by referencing specific algorithms (Shor, QAOA, VQE, Grover) and discussing their limitations. He mentions a paper on quantum solver comparisons but does not provide a specific citation. The title accurately reflects the content, which is a critical assessment of quantum computing’s limitations and alternatives. The talk is an expert opinion rather than a peer-reviewed study, but it aligns with current scientific consensus. No comments were provided for analysis.

181 words

Title / Content Match

The title accurately reflects the content: the speaker discusses real limitations of quantum computing and proposes new alternatives.

Quality & Reliability

8/10

The talk is given by a researcher in quantum computing, with a master's in particle physics and a PhD candidate in engineering. He provides a critical analysis of quantum computing applications, citing specific algorithms and known limitations. The content is well-structured and aligns with current scientific consensus, though it is an opinion/expert talk rather than a peer-reviewed study.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Paper on quantum solver comparisons — Mentioned during the discussion of QAOA, but no specific reference provided.

Concurring Sources

Quantum computing: a review — General overview of quantum computing, consistent with the talk's description.

Contribution & Novelties

The talk provides a critical perspective on quantum computing applications, emphasizing that many claimed advantages are not yet realized. It highlights specific technical issues such as oversampling in QAOA and data loading bottlenecks in quantum machine learning. The proposal of quantum-inspired computing and secure delegated quantum computing as alternatives is a forward-looking contribution.

Pour aller plus loin :

Quantum computing — Overview of quantum computing concepts.
Shor’s algorithm — Algorithm for integer factorization.
QAOA — Quantum approximate optimization algorithm.
VQE — Variational quantum eigensolver.
Grover’s algorithm — Quantum search algorithm.
Post-quantum cryptography — Cryptography resistant to quantum attacks.

98 words

Radar Profile

The radar profile shows high scores in information quantity, quality, technical level, and reliability, indicating a well-balanced and informative talk. The speaker's expertise and critical analysis contribute to a strong overall assessment.

Reliability 8/10