Show Paper arXiv Publisher

Quick Navigation

Overview Topics Abstract Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Error Correction Fault Tolerance Quantum Optimization Quantum Machine Learning

The Road to Quantum Computational Supremacy

arXiv
Authors: Cristian S. Calude, Elena Calude

Year

2017

Paper ID

24718

Status

Preprint

Abstract Read

~2 min

Abstract Words

43

Citations

N/A

Abstract

We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms. Quantum supremacy, if achieved, won't make classical computing obsolete.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

[1] DOI https://doi.org/arXiv:1712.01356 [2] arXiv https://arxiv.org/abs/1712.01356 [3] Publisher https://arxiv.org/abs/1712.01356

Local Citation Graph (Related-Paper Links)

Current Paper #24718 #35390 Clustered error correction of c... #35351 On classical and quantum error-... #35400 Building a spin quantum bit reg... #35396 Fault tolerance with noisy and ...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.