Fault Models for Quantum Mechanical Switching Networks

Abstract

The difference between faults and errors is that, unlike faults, errors can be corrected using control codes. In classical test and verification one develops a test set separating a correct circuit from a circuit containing any considered fault. Classical faults are modelled at the logical level by fault models that act on classical states. The stuck fault model, thought of as a lead connected to a power rail or to a ground, is most typically considered. A classical test set complete for the stuck fault model propagates both binary basis states, 0 and 1, through all nodes in a network and is known to detect many physical faults. A classical test set complete for the stuck fault model allows all circuit nodes to be completely tested and verifies the function of many gates. It is natural to ask if one may adapt any of the known classical methods to test quantum circuits. Of course, classical fault models do not capture all the logical failures found in quantum circuits. The first obstacle faced when using methods from classical test is developing a set of realistic quantum-logical fault models. Developing fault models to abstract the test problem away from the device level motivated our study. Several results are established. First, we describe typical modes of failure present in the physical design of quantum circuits. From this we develop fault models for quantum binary circuits that enable testing at the logical level. The application of these fault models is shown by adapting the classical test set generation technique known as constructing a fault table to generate quantum test sets. A test set developed using this method is shown to detect each of the considered faults.

(almost) Forgotten rewrite from 2005

References in corpus (8)

• Distance measures to compare real and ideal quantum processes
• Quantum process tomography of a controlled-NOT gate
• Tackling Systematic Errors in Quantum Logic Gates with Composite Rotations
• Preparing high purity initial states for nuclear magnetic resonance quantum computing
• Effects of Noisy Oracle on Search Algorithm Complexity
• Quantum error correction of systematic errors using a quantum search framework
• Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations

Cited by in corpus (1)

• Equivalence Checking of Quantum Finite-State Machines