Abstract Storing quantum information in a error correction code can protect it from errors, but the ability to transform stored fault tolerant way is equally important. Logical Pauli group operators be implemented on Calderbank-Shor-Steane (CSS) codes, commonly-studied category of by applying series physical X and Z gates. this form are fault-tolerant because each qubit acted upon at most one g...

A nalog circuit implementations of fuzzy logic are characterized by performing logical connectives of analog signals. They can be considered as generalization of digital circuits to a range of logical values, thus forming a special class of analog circuits. The idea of this work is to exploit this relationship for testing. For fault modeling the behavior of faulty fuzzy gates is investigated th...

Fourier states are multi-qubit registers that facilitate phase rotations in fault-tolerant quantum computing. We propose distillation protocols for constructing the fundamental, n-qubit Fourier state with error O(2) at a cost of O(n logn) Toffoli gates and Clifford gates, or any arbitrary Fourier state using O(n) gates. We analyze these protocols with methods from digital signal processing. The...

This paper considers the fault detection problem for a single fault in a single MOS channel-connected subcircuit. We identify the following three decision sub-problems : (i) decide if a test vector exists; (ii) decide if an initializing vector exists; and (iii) decide if a test pair is robust. We prove that each of these problems is NP complete. More importantly, we prove that the rst two remai...

A Built-In Self-Test (BIST) approach is presented for the Internal Configuration Access Port (ICAP) and Frame Error Correcting Code (ECC) logic cores embedded in Xilinx Virtex-4 and Virtex-5 Field Programmable Gate Arrays (FPGAs). The Frame ECC logic facilitates the detection of Single Event Upsets (SEUs) in the FPGA configuration memory. The ICAP provides read and write access to the configura...

Numerical simulation results are presented which suggest that a class of non-adiabatic rapid passage sweeps first realized experimentally in 1991 should be capable of implementing a set of quantum gates that is universal for one-qubit unitary operations and whose elements operate with error probabilities Pe < 10. The sweeps are noncomposite and generate controllable quantum interference effects...

Due to its fault-tolerant gates, the Clifford+T library consisting of Hadamard (denoted by H), T , and CNOT gates has attracted interest in the synthesis of quantum circuits. Since the implementation of T gates is expensive, recent research is aiming at minimizing the use of such gates. It has been shown that T -depth optimizations can be implemented efficiently for circuits consisting only of ...

There are quantum algorithms that can efficiently simulate quantum physics, factor large numbers and estimate integrals. As a result, quantum computers can solve otherwise intractable computational problems. One of the main problems of experimental quantum computing is to preserve fragile quantum states in the presence of errors. It is known that if the needed elementary operations (gates) can ...