Emergence of fault-tolerant quantum computers (FTQC) brings about promise of harnessing the power of quantum computing at larger scale. At the same time, as quantum computers are expected to process more sensitive information, there is a need to understand the security issues in fault-tolerant quantum computers, and develop defenses for attacks that may compromise confidentiality or integrity of the data processed by FTQC. While noisy intermediate-scale quantum (NISQ) computers have already been studied from the security perspective, understanding security issues with FTQC is still an open research question. To address the missing research gap, this work presents the first exploration of possible security vulnerabilities of FTQC. The work presents analysis of possible threat models and outlines potential vulnerabilities of FTQC. Understanding the landscape of the threats can help lead to development of safer FTQC design at both software and hardware levels.
Emergence of fault-tolerant quantum computers (FTQC) brings about promise of harnessing the power of quantum computing at larger scale. At the same time, as quantum computers are expected to process more sensitive information, there is a need to understand the security issues in fault-tolerant quantum computers, and develop defenses for attacks that may compromise confidentiality or integrity of the data processed by FTQC. While noisy intermediate-scale quantum (NISQ) computers have already been studied from the security perspective, understanding security issues with FTQC is still an open research question. To address the missing research gap, this work presents the first exploration of possible security vulnerabilities of FTQC. The work presents analysis of possible threat models and outlines potential vulnerabilities of FTQC. Understanding the landscape of the threats can help lead to development of safer FTQC design at both software and hardware levels.
The rapid growth of interest in quantum computing has brought about the need to secure these emerging computers against a range of security attacks. Among the potential security threats are physical attacks, including those orchestrated by malicious insiders within data centers where the quantum computers are located, which could compromise the integrity of computations and resulting data. To help in the understanding of emerging fault injection attacks on quantum computers, this paper presents an in-depth exploration of quantum computer fault injection attacks. This work introduces a classification of fault injection attacks and strategies, including an analysis of the domain of fault injection attacks, the fault targets, and the fault manifestations in quantum computers. The resulting classification highlights the landscape of the potential threats, and presents a road map for researchers and industry for developing security protection mechanisms against fault injection attacks for the emerging quantum computing systems.
As the works on quantum computing have seen substantial development in recent years, we are on the verge of seeing the fruitful result of the preliminary, early version of quantum computers. Nevertheless, in order to achieve full-fledged, large-scale quantum computers, two aspects still lacking in the existing quantum computers, i.e., scalability and reliability, will need to be more carefully considered and investigated. In this survey, we present a review of existing literature that aims to alleviate the scalability and reliability issues in quantum computers. In particular, we discuss how existing research leads to two main solutions: for advancing scalability, a distributed quantum computing (DQC) paradigm will be the primary direction instead of the general centralized quantum computing (CQC), whereas for attaining reliability, a fault-tolerant quantum computation (FTQC) approach would need to be leveraged instead of the existing noisy intermediate-scale quantum computers (NISQ). Combining both solutions, we highlight the essentiality of fault-tolerant distributed quantum computation (FT-DQC) and present related progress in the field. Furthermore, from the papers that we have gathered, we provide the taxonomy of the works to give a clearer landscape of the field and discuss the key issues in realizing FT-DQC.
The rapid growth of interest in quantum computing has brought about the need to secure these powerful machines against a range of physical attacks. As qubit counts increase and quantum computers achieve higher levels of fidelity, their potential to execute novel algorithms and generate sensitive intellectual property becomes more promising. However, there is a significant gap in our understanding of the vulnerabilities these computers face in terms of security and privacy attacks. Among the potential threats are physical attacks, including those orchestrated by malicious insiders within data centers where the quantum computers are located, which could compromise the integrity of computations and resulting data. This paper presents an exploration of fault-injection attacks as one class of physical attacks on quantum computers. This work first introduces a classification of fault-injection attacks and strategies, including the domain of fault-injection attacks, the fault targets, and fault manifestations in quantum computers. The resulting classification highlights the potential threats that exist. By shedding light on the vulnerabilities of quantum computers to fault-injection attacks, this work contributes to the development of robust security measures for this emerging technology.
Quantum computing has showcased potentials to address classically unsolvable problems and attracted research investigation all around the world. However, quantum devices are inherently noisy and create hurdles from true quantum supremacy. Despite researchers have strived to demonstrate quantum advantages at small scales in the noisy intermediate-scale quantum (NISQ) era, we are now at the turning point to craft fault tolerant quantum computers (FTQC) for large scale quantum computing. In this paper, we review the current status of available error control techniques, discuss the missing pieces of each technique for their practical adaptation, and envision the necessity to synergize them across vast design stacks, to enable fault tolerance in quantum computing.
The transition from classical to quantum computation marks a shift from deterministic binary logic to a probabilistic, entanglement‑driven framework able to address problems beyond classical reach. Today’s Noisy Intermediate ‑ Scale Quantum era features devices that lack full error correction yet already point toward larger, modular systems designed for fault‑tolerant operation. This paper examines the evolving paradigm shift from classical and NISQ ‑ era machines toward practical fault‑tolerant quantum computing, focusing on how advances in physical qubit technologies, control architectures, and error‑correction strategies are converging to bridge noisy prototypes and scalable, useful machines. We synthesize insights from historical semiconductor scaling trends, contemporary roadmaps from leading institutions and industry, and emerging modular designs with real‑time error decoding. Our analysis shows that while challenges around decoherence, connectivity, and classical co‑processing remain, coordinated progress in hardware, control, and software is laying a coherent foundation for future quantum platforms. The work concludes that quantum computing is maturing into a strategically significant paradigm, poised to redefine the limits of computation in simulation, optimization, and secure communication.
Current quantum computing research is divided into two eras: near-term intermediate scaling quantum (NISQ) and fault-tolerant quantum computing (FTQC). There is a significant gap in these both in terms of hardware and algorithms. An important question is “how to transition from NISQ to FTQC”? Some research looks at an intermediate third era of quantum computing, sometimes referred to as “early” fault-tolerant quantum computing (EFTQC). The idea is to establish a trade-off between hardware and algorithmic parameters such that we have limited size circuits, albeit large enough to allow some amount of error-correction at the cost of more number of samples and increased run-time. This also requires adjustment to algorithms for various tasks. One way to do this is to allow the algorithm to tolerate some level of noise in the input. These algorithms are called “robust” quantum algorithms. In this chapter, we will understand what EFTQC means and how we can distinguish between the three eras of quantum computing. Furthermore, we will look at the ideas behind algorithms suitable for EFTQC devices. Lastly, we will look at two examples of robust quantum algorithms for the task of quantum phase estimation.