arXiv:1512.05051

Diagnosis of single faults in quantum circuits

Debajyoti Bera, Subhamoy Maitra, Sparsa Roychowdhury, Susanta Chakraborty

Published Dec 16, 2015• 2 citations

Abstract

Detecting and isolating faults is crucial for synthesis of quantum circuits. Under the single fault assumption that is now routinely accepted in circuit fault analysis, we show that the behaviour of faulty quantum circuits can be fully characterized by the single faulty gate and the corresponding fault model. This allows us to efficiently determine test input states as well as measurement strategy that can be used to detect every single-gate fault using very few test cases and with minimal probability of error; in fact we demonstrate that most commonly used quantum gates can be isolated without any error under the single missing gate fault (SMGF) model. We crucially exploit the quantum nature of circuits to show vast improvement upon the existing works of automatic test pattern generation (ATPG) for quantum circuits.

DOI: 10.48550/arxiv.1512.05051

Related papers

Detection and Diagnosis of Single Faults in Quantum Circuits

Debajyoti Bera

Detection and isolation of faults is a crucial step in the physical realization of quantum circuits. Even though quantum gates and circuits compute reversible functions, the standard techniques of automatic test pattern generation (ATPG) for classical reversible circuits are not directly applicable to quantum circuits. For faulty quantum circuits under the widely accepted single fault assumption, we show that their behavior can be fully characterized by the (single) faulty gate and the corresponding fault model. This allows us to efficiently determine test input states as well as measurement strategy for fault detection and diagnosis. Building on top of these, we design randomized algorithms which are able to detect every nontrivial single-gate fault with minimal probability of error. We also describe similar algorithms for fault diagnosis. We evaluate our algorithms by the number of output samples that needs to be collected and the probability of error. Both of these can be related to the eigenvalues of the operators corresponding to the circuit gates. We experimentally compare all our strategies with the state-of-the-art ATPG techniques for quantum circuits under the “single missing faulty gate” model and demonstrate that significant improvement is possible if we can exploit the quantum nature of circuits.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and SystemsJun 22, 201716 citations

Detection and diagnosis of faulty quantum circuits

Alexandru Paler, Ilia Polian, John P. Hayes

A new approach to detecting and diagnosing faults in quantum circuits is introduced. In order to account for the probabilistic nature of quantum circuits, collections of test experiments, called binary tomographic tests (BTTs), are generated. A BTT can identify a fault with respect to some user-defined confidence threshold τ. We present an algorithm to generate BTTs that either detect, or ensure the absence of, all modeled faults in a given circuit. We also present an adaptive diagnostic method to locate quantum faults. While classical circuits, even probabilistic ones, only handle ordinary probabilities, quantum circuits deal with quantum states, which have phase as an extra probabilistic parameter. The tomographic testing methods introduced previously for probabilistic circuits are unable to detect differences in phase, and therefore leave many quantum faults undetected. In contrast, we develop a design-for-test method which is specifically intended to detect faults that only affect the phase of a quantum state. We give experimental results for benchmark and random circuits which show high coverage of quantum faults by BTTs, and good resolution in the case of the adaptive diagnosis method.

Asia and South Pacific Design Automation Conference (ASP-DAC)Jan 1, 201216 citations

Automated Test Pattern Generation for Quantum Circuits

Jacob Biamonte

This work extends a general method used to test classical circuits to quantum circuits. Gate internal errors are address using a discrete fault model. Fault models to represent unwanted nearest neighbor entanglement as well as unwanted qubit rotation are presented. When witnessed, the faults we model are probabilistic, but there is a set of tests with the highest probability of detecting a discrete repetitive fault. A method of probabilistic set covering to identify the minimal set of tests is introduced. A large part of our work consisted of writing a software package that allows us to compare various fault models and test strategies for quantum networks. Faculty Mentor: Marek A. Perkowski

PSU McNair Scholars Online JournalJan 1, 20053 citations

Fault Models for Quantum Mechanical Switching Networks

Jeff S.Allen Jacob D. Biamonte, Jeff Allen, Marek A. Perkowski

Abstract This work justifies several quantum gate level fault models and discusses the causal error mechanisms thwarting correct function. A quantum adaptation of the classical test set generation technique known as constructing a fault table is given. This classical technique optimizes test plans to detect all the most common error types. This work therefore considers the set of predominate errors modeled by unwanted qubit rotations. In classical test, a fault table is constructed allowing the comparison between a circuit’s nominal response and a response perturbed by each separately considered error. It was found that isolating a correct circuit from a circuit containing any of the Pauli Fault rotations, requires applications of just two independent test vectors. This is related to the proven fact that a reversible system preserves the probability that additional information may be present. Thus, the probability of detection for an observable fault is related only to the probability of presence. A theorem that better connects classical ideas to quantum test set generation is presented. This leads directly to a relationship between the deterministic presence of a fault in the state vector observed with some probability and the probabilistic presence of a fault observed deterministically (Relating Time and Space Error Models). 1

Jan 1, 200514 citations

Fast Testing Quantum Circuits

Jacob Biamonte, Marek A. Perkowski, Jae‐Seung Lee

This paper introduces the problem of test generation and test minimization for quantum circuits using a discrete fault model. QuFault, our software package generates test sequences for arbitrary quantum circuits using the very efficient simulator QuIDDPro [1]. The quantum fault table and the test set minimization algorithm is presented, along with some tricks to make quantum testing as deterministic as possible. As our fault model we use the single qubit rotation operators about the x, y and z axis. The angle of the rotation is based on the expected accuracy of the mechanism performing the unitary operations, or the largest impact of expected noise from the environment. We consider superposition inputs as well as interference in order to detect phase faults, such as possible errors traveling backwards through controlled gates.

arXiv:quant-ph/0501108Jan 20, 20050 citations

Fault Testing Quantum Switching Circuits

Marek A. Perkowski, Jacob Biamonte

Test pattern generation is an electronic design automation tool that attempts to find an input (or test) sequence that, when applied to a digital circuit, enables one to distinguish between the correct circuit behavior and the faulty behavior caused by particular faults. The effectiveness of this classical method is measured by the fault coverage achieved for the fault model and the number of generated vectors, which should be directly proportional to test application time. This work address the quantum process validation problem by considering the quantum mechanical adaptation of test pattern generation methods used to test classical circuits. We found that quantum mechanics allows one to execute multiple test vectors concurrently, making each gate realized in the process act on a complete set of characteristic states in space/time complexity that breaks classical testability lower bounds.

Jan 1, 20100 citations