RECORD
Quantum Advantage and Y2K Bug: Comparison
Software Engineering · Submitted 24 Jul 2019
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Thus, in order to maintain crypto agility of the software, one needs to start preparing for the era of quantum advantage proactively.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Quantum Computers (QCs), once they mature, will be able to solve some problems faster than Classic Computers. This phenomenon is called "quantum advantage" (or a stronger term "quantum supremacy"). Quantum advantage will help us to speed up computations in many areas, from artificial intelligence to medicine. However, QC power can also be leveraged to break modern cryptographic algorithms, which pervade modern software: use cases range from encryption of Internet traffic, to encryption of disks, to signing blockchain ledgers. While the exact date when QCs will evolve to reach quantum advantage is unknown, the consensus is that this future is near. Thus, in order to maintain crypto agility of the software, one needs to start preparing for the era of quantum advantage proactively. In this paper, we recap the effect of quantum advantage on the existing and new software systems, as well as the data that we currently store. We also highlight similarities and differences between the security challenges brought by QCs and the challenges that software engineers faced twenty years ago while fixing widespread Y2K bug. Technically, the Y2K bug and the quantum advantage problems are different: the former was caused by timing-related problems, while the latter is caused by a cryptographic algorithm being non-quantum-resistant. However, conceptually, the problems are similar: we know what the root cause is, the fix (strategically) is straightforward, yet the implementation of the fix is challenging. To address the quantum advantage challenge, we create a seven-step roadmap, deemed 7E. It is inspired by the lessons-learnt from the Y2K era amalgamated with modern knowledge. The roadmap gives developers a structured way to start preparing for the quantum advantage era, helping them to start planning for the creation of new as well as the evolution of the existent software.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Quantum Computers (QCs), once they mature, will be able to solve some problems faster than Classic Computers. | background 1.00 | 0.05 | 0.06 | hedged possibility 0.87 |
| s1 | This phenomenon is called "quantum advantage" (or a stronger term "quantum supremacy"). | background 1.00 | 0.05 | 0.04 | asserted 0.99 |
| s2 | Quantum advantage will help us to speed up computations in many areas, from artificial intelligence to medicine. | background 0.99 | 0.05 | 0.04 | asserted 0.78 |
| s3 | However, QC power can also be leveraged to break modern cryptographic algorithms, which pervade modern software: use cases range from encryption of Internet traffic, to encryption of disks, to signing blockchain ledgers. | background 1.00 | 0.05 | 0.06 | hedged possibility 0.52 |
| s4 | While the exact date when QCs will evolve to reach quantum advantage is unknown, the consensus is that this future is near. | background 0.98 | 0.05 | 0.05 | asserted 0.53 |
| s5 | Thus, in order to maintain crypto agility of the software, one needs to start preparing for the era of quantum advantage proactively. | background 0.74 | 0.08 | 0.18 | asserted 1.00 |
| s6 | In this paper, we recap the effect of quantum advantage on the existing and new software systems, as well as the data that we currently store. | contribution 1.00 | 0.77 | 0.07 | asserted 0.89 |
| s7 | We also highlight similarities and differences between the security challenges brought by QCs and the challenges that software engineers faced twenty years ago while fixing widespread Y2K bug. | contribution 1.00 | 0.70 | 0.09 | asserted 0.97 |
| s8 | Technically, the Y2K bug and the quantum advantage problems are different: the former was caused by timing-related problems, while the latter is caused by a cryptographic algorithm being non-quantum-resistant. | interpretation 0.38 | 0.20 | 0.08 | asserted 1.00 |
| s9 | However, conceptually, the problems are similar: we know what the root cause is, the fix (strategically) is straightforward, yet the implementation of the fix is challenging. | interpretation 0.65 | 0.44 | 0.21 | asserted 1.00 |
| s10 | To address the quantum advantage challenge, we create a seven-step roadmap, deemed 7E. | contribution 0.97 | 0.93 | 0.20 | asserted 1.00 |
| s11 | It is inspired by the lessons-learnt from the Y2K era amalgamated with modern knowledge. | method 0.67 | 0.64 | 0.06 | asserted 1.00 |
| s12 | The roadmap gives developers a structured way to start preparing for the quantum advantage era, helping them to start planning for the creation of new as well as the evolution of the existent software. | contribution 0.86 | 0.73 | 0.26 | asserted 0.98 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Quantum Computers (QCs), once they mature, will be able to solve some problems faster than Classic Computers. This phenomenon is called "quantum advantage" (or a stronger term "quantum supremacy"). Quantum advantage will help us to speed up computations in many areas, from artificial intelligence to medicine. However, QC power can also be leveraged to break modern cryptographic algorithms, which pervade modern software: use cases range from encryption of Internet traffic, to encryption of disks, to signing blockchain ledgers. While the exact date when QCs will evolve to reach quantum advantage is unknown, the consensus is that this future is near. Thus, in order to maintain crypto agility of the software, one needs to start preparing for the era of quantum advantage proactively. In this paper, we recap the effect of quantum advantage on the existing and new software systems, as well as the data that we currently store. We also highlight similarities and differences between the security challenges brought by QCs and the challenges that software engineers faced twenty years ago while fixing widespread Y2K bug. Technically, the Y2K bug and the quantum advantage problems are different: the former was caused by timing-related problems, while the latter is caused by a cryptographic algorithm being non-quantum-resistant. However, conceptually, the problems are similar: we know what the root cause is, the fix (strategically) is straightforward, yet the implementation of the fix is challenging. To address the quantum advantage challenge, we create a seven-step roadmap, deemed 7E. It is inspired by the lessons-learnt from the Y2K era amalgamated with modern knowledge. The roadmap gives developers a structured way to start preparing for the quantum advantage era, helping them to start planning for the creation of new as well as the evolution of the existent software.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.