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

fQuantum : A Quantum Computing Fault Simulator

Suresh k Devanathan, M.L. Bushnell

Published Mar 1, 2013• 0 citations
OpenAlex

Abstract

Abstract—We like to introduce fQuantum, a Quantum Computing Fault Simulator and new quantum computing fault model based on Hadamard, PauliX, PauliY and PauliZ gates, and the traditional stuck-at-1 SA1 and stuck-at-0 SA0 faults. We had close to 100 % fault coverage on most circuits. The problem with lower coverage comes from function gates, which we will deal with, in future versions of this paper. Keywords—fQuantum,Fault Simulator, Quantum Computing I.

Related papers

Quantum Models and Method for Analysis and Testing Computing Systems

Vladimir I. Hahanov, S. Hyduke, Wajeb Gharibi +3 more

Matrix method for quantum diagnosing functional failures and stuck-at faults in software or hardware units is proposed. It is based on qubit data structures comprising diagnostic information, which allows significantly reducing the computational complexity of the simulation and diagnosis due to the introduction of parallel logical operations on the matrix data. The quantum method for fault-free simulating digital units with the possibility of online repair of digital system components is presented. It is characterized by significantly improved performance due to addressed processing procedure of the functional primitives, defined by Q-coverages.

International Conference on Information Technology: New Generations•Apr 1, 2014•20 citations

Qubit-driven Fault Simulation

Vladimir I. Hahanov, Wajeb Gharibi, Eugenia I. Litvinova +1 more

Quantum data structures, methods, algorithms and software applications for parallel solution of combinatorial problems, including design and test, on classical computers by using extra memory are proposed. Quantum models and methods for design and test of specific logic functionalities are developed based on the use of vector qubit data structures and memory-driven architectures for parallel computing algorithms, in order to significantly improve the performance of testing and deductive simulation of digital systems-on-chips. A new quantum method of test generation for single stuck-at faults of logic functions through taking Boolean derivatives with respect to their qubit coverages is proposed. The quantum method of deductive simulation of stuck-at faults of logical functions through the synthesis of matrices of Boolean derivatives with respect to their qubit coverage has been developed. The performance of methods for test synthesis and their analysis has no analogues in algorithmic performance.

IEEE Latin American Test Symposium (LATS)•Mar 1, 2019•26 citations

Fault Analysis and Quantum Hardware Validation of a Peres Gate Based Reversible Full Adder

Balakrishna Peyyala, Nagalakshmi Harisha A, S. N. Koteswara Rao G.

Quantum computing is gaining importance as a promising approach for achieving energy-efficient and reliable computation, where reversible logic circuits play a key role. Full adders are fundamental components of arithmetic and logic units, and their correct operation is essential for overall system performance. With continued technology scaling, digital circuits are increasingly affected by manufacturing defects and permanent faults, making fault modeling and testability analysis critically important. Among various fault models, the stuck-at fault model is widely used due to its simplicity and its ability to represent common physical defects. This paper presents a detailed stuck-at fault analysis of a reversible full adder designed using Peres gates. The proposed architecture efficiently generates Sum and Carry outputs while reducing gate count and information loss. To evaluate practical feasibility, the full adder is implemented on the IBM quantum computing platform using IBM Composer and simulated through the Qiskit framework. Both fault-free and faulty conditions are examined by introducing stuck- at-0 and stuck-at-1 faults at key nodes affecting the Sum and Carry outputs. State-vector analysis, probability distributions, and measurement results are obtained for all possible input combinations. The exhaustive fault analysis achieves a fault coverage of 87.5% for both SA-0 and SA-1 conditions, indicating high fault observability. The results confirm that the proposed Peres gate–based reversible full adder is well suited for fault-tolerant arithmetic applications in reversible and quantum computing environments.

•Mar 30, 2026•0 citations

On Finding Sensitivity of Quantum and Classical Gates

Debajyoti Bera, Steven Thomas Homer

We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results. 1

•Jun 5, 2009•0 citations

Realistic Fault Models and Fault Simulation for Quantum Dot Quantum Circuits

Cheng-Yun Hsieh, Chen-Hung Wu, Chia-Hsien Huang +2 more

Testing for quantum circuits (QC) is a challenging task because QC is intrinsically probabilistic. Existing fault models for QC, such as missing gate faults, are not suitable for quantum dot QC. This paper proposes realistic fault models and fault simulation for quantum dot QC. Our fault models are based on real physical phenomenon of quantum dot devices so that they represent real defect behavior or control errors. Our fault simulation does not need to fully expand gate matrices to 2nx 2n, where n is the number of qubits. Using sparse matrix multiplication, our fault simulation saves a lot of memory and CPU time. We also calculate the test repetition of each test pattern so that we can estimate our test time. Based on fault simulation of a full adder QC, we can select a small test set of six test patterns, totally 526 repetitions, to detect all faults with 99% confidence level.

ACM/IEEE Design Automation Conference (DAC)•Jul 1, 2020•4 citations

New Limits on Fault-Tolerant Quantum Computation

Harry Buhrman, Richard Cleve, Monique Laurent +3 more

We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of thetas = (6 - 2radic2)/7 ap 45%, thereby improving on a previous bound of 50% (due to Razborov, 2004). More precisely, the circuit model for which we prove this bound contains perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qubit gates that are subject to depolarizing noise thetas. We prove that this set of gates cannot be universal for arbitrary (even classical) computation, from which the upper bound on the noise threshold for fault-tolerant quantum computation follows

arXiv:quant-ph/0604141•Annual Symposium on Foundations of Computer Science•Jan 1, 2006•67 citations
Abstract—We like to introduce fQuantum, a Quantum Computing Fault Simulator and new quantum computing fault model based on Hadamard, PauliX, PauliY and PauliZ gates, and the traditional stuck-at-1 SA1 and stuck-at-0 SA0 faults. We had close to 100 % fault coverage on most circuits. The problem with lower coverage comes from function gates, which we will deal with, in future versions of this paper. Keywords—fQuantum,Fault Simulator, Quantum Computing I.
Matrix method for quantum diagnosing functional failures and stuck-at faults in software or hardware units is proposed. It is based on qubit data structures comprising diagnostic information, which allows significantly reducing the computational complexity of the simulation and diagnosis due to the introduction of parallel logical operations on the matrix data. The quantum method for fault-free simulating digital units with the possibility of online repair of digital system components is presented. It is characterized by significantly improved performance due to addressed processing procedure of the functional primitives, defined by Q-coverages.
Quantum data structures, methods, algorithms and software applications for parallel solution of combinatorial problems, including design and test, on classical computers by using extra memory are proposed. Quantum models and methods for design and test of specific logic functionalities are developed based on the use of vector qubit data structures and memory-driven architectures for parallel computing algorithms, in order to significantly improve the performance of testing and deductive simulation of digital systems-on-chips. A new quantum method of test generation for single stuck-at faults of logic functions through taking Boolean derivatives with respect to their qubit coverages is proposed. The quantum method of deductive simulation of stuck-at faults of logical functions through the synthesis of matrices of Boolean derivatives with respect to their qubit coverage has been developed. The performance of methods for test synthesis and their analysis has no analogues in algorithmic performance.
Quantum computing is gaining importance as a promising approach for achieving energy-efficient and reliable computation, where reversible logic circuits play a key role. Full adders are fundamental components of arithmetic and logic units, and their correct operation is essential for overall system performance. With continued technology scaling, digital circuits are increasingly affected by manufacturing defects and permanent faults, making fault modeling and testability analysis critically important. Among various fault models, the stuck-at fault model is widely used due to its simplicity and its ability to represent common physical defects. This paper presents a detailed stuck-at fault analysis of a reversible full adder designed using Peres gates. The proposed architecture efficiently generates Sum and Carry outputs while reducing gate count and information loss. To evaluate practical feasibility, the full adder is implemented on the IBM quantum computing platform using IBM Composer and simulated through the Qiskit framework. Both fault-free and faulty conditions are examined by introducing stuck- at-0 and stuck-at-1 faults at key nodes affecting the Sum and Carry outputs. State-vector analysis, probability distributions, and measurement results are obtained for all possible input combinations. The exhaustive fault analysis achieves a fault coverage of 87.5% for both SA-0 and SA-1 conditions, indicating high fault observability. The results confirm that the proposed Peres gate–based reversible full adder is well suited for fault-tolerant arithmetic applications in reversible and quantum computing environments.
We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results. 1
Testing for quantum circuits (QC) is a challenging task because QC is intrinsically probabilistic. Existing fault models for QC, such as missing gate faults, are not suitable for quantum dot QC. This paper proposes realistic fault models and fault simulation for quantum dot QC. Our fault models are based on real physical phenomenon of quantum dot devices so that they represent real defect behavior or control errors. Our fault simulation does not need to fully expand gate matrices to 2nx 2n, where n is the number of qubits. Using sparse matrix multiplication, our fault simulation saves a lot of memory and CPU time. We also calculate the test repetition of each test pattern so that we can estimate our test time. Based on fault simulation of a full adder QC, we can select a small test set of six test patterns, totally 526 repetitions, to detect all faults with 99% confidence level.
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of thetas = (6 - 2radic2)/7 ap 45%, thereby improving on a previous bound of 50% (due to Razborov, 2004). More precisely, the circuit model for which we prove this bound contains perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qubit gates that are subject to depolarizing noise thetas. We prove that this set of gates cannot be universal for arbitrary (even classical) computation, from which the upper bound on the noise threshold for fault-tolerant quantum computation follows