Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics World

Questioning quantum speed

Philip Ball

Published Jan 1, 2014• 4 citations
Publisher

Abstract

The promised speed of a quantum computer is usually explained in terms of its ability to make many calculations in parallel. But, as Philip Ball reports, many quantum theorists reject this idea and point to other explanations entirely.
DOI
10.1088/2058-7058/27/01/40

Related papers

Exploring the Current State of Quantum Computing

David Alan Grier

Quantum computing promises to help us someday reach impressive computing speed. Explains briefly what quantum computing is and discusses future applications for its use.

Computer•Jun 1, 2019•1 citation

A case for quantum parallelism

Jim Austin

In reply to Philip Ball's article "Questioning quantum speed" (Features, January pp38–41).

Physics World•Mar 1, 2014•0 citations

Gurevich's Quizani Dialogs as an Example of Explainable Mathematics, and How This Is Related to Quantum Space-Time Ideas that Can Speed Up Computations

Kosheleva, Olga, Kreinovich, Vladik

Everyone talks about the need for Explainable AI -- when, to supplement a long difficult-to-understand sequence of computational steps leading to AI's decision, we are looking for a shorter and understandable more-informal explanation for this decision. In this paper, we argue that this need is a particular case of what we call Explainable Mathematics -- when we want to supplement a long sequence of arguments and/or computations with a shorter and understandable more-informal explanation. Important instances of Explainable Mathematics are Yuri Gurevich's Quizani dialogs that help explain complex results from theoretical computer science and physicists' more-informal explanations of complex physical phenomena. We explain that in the physics' case, since -- according to most physicists -- all physical theories are approximate, the use of approximate more-informal methods often makes more sense that the use of rigorous methods that implicitly assume that the current theories are absolute correct. We then apply this argument to one of the common uses of physics in theory of computation -- that limitation by the speed of light limits the computation speed. Specifically, we show that quantum space-time ideas potentially allow computations at the micro-level speed of light which can be higher than its usual macro-level value. This potential increase in possible communication speed can speed up computations.

•Mar 1, 2025•0 citations

Establishing quantum advantage

Adam Bouland

What are quantum computers good for? This essay reviews the progress toward proving a quantum advantage over classical computing.

XRDS Crossroads The ACM Magazine for Students•Sep 20, 2016•1 citation

Are quantum computers really energy efficient?

Sophia Chen

Nature Computational Science•Jun 26, 2023•17 citations

Quantum all the way

How does our classical world emerge from the counterintuitive principles of quantum theory? Can we even be sure that the world doesn't 'go quantum' when no one is watching? Philip Ball talks to the theorists and experimentalists trying to find out.

Physics Today•May 5, 2008•12 citations
Everyone talks about the need for Explainable AI -- when, to supplement a long difficult-to-understand sequence of computational steps leading to AI's decision, we are looking for a shorter and understandable more-informal explanation for this decision. In this paper, we argue that this need is a particular case of what we call Explainable Mathematics -- when we want to supplement a long sequence of arguments and/or computations with a shorter and understandable more-informal explanation. Important instances of Explainable Mathematics are Yuri Gurevich's Quizani dialogs that help explain complex results from theoretical computer science and physicists' more-informal explanations of complex physical phenomena. We explain that in the physics' case, since -- according to most physicists -- all physical theories are approximate, the use of approximate more-informal methods often makes more sense that the use of rigorous methods that implicitly assume that the current theories are absolute correct. We then apply this argument to one of the common uses of physics in theory of computation -- that limitation by the speed of light limits the computation speed. Specifically, we show that quantum space-time ideas potentially allow computations at the micro-level speed of light which can be higher than its usual macro-level value. This potential increase in possible communication speed can speed up computations.