Scaling up to problem sizes: an environmental life cycle assessment of quantum computing
Bibliographic record
Abstract
Abstract With the demonstrated ability to perform calculations in seconds that would take classical supercomputers thousands of years, quantum computers namely hold the promise of radically advancing sustainable IT. However, quantum computers face challenges due to the inherent noise in physical qubits, necessitating error correction for reliable operation in solving industrial-scale problems, which will require more computation time, energy, and electronic components than initial laboratory-scale experiments. Yet, while researchers have modeled and analyzed the environmental impacts of classical computers using Life cycle assessment the environmental performance of quantum computing remains unknown to date. This study contributes to filling this critical gap in two ways: (1) by establishing an environmental profile for quantum computers based on superconducting qubits; and (2) by comparing it to a functionally equivalent profile of a state-of-the-art supercomputer. With the comparison based on the problem size, the paper shows how the usage time can drive an environmental advantage for quantum computers under specific scaling conditions and quantum error correcting codes. The results emphasize that quantum error correction hardware has a substantial environmental impact due to the numerous electronic components needed to achieve 100 logical qubits. This paper can serve as a basis for designing more environmentally friendly quantum computers and for establishing their environmental profiles, as well as those of the human activities that will use them.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.010 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".