Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

Portland State University

Electrical and Computer Engineering Faculty Publications and Presentations

2005

Quantum computers -- Testing

Articles 1 - 3 of 3

Full-Text Articles in Engineering

Extending Classical Test To Quantum, Jacob D. Biamonte, Minki Jeong, Jae-Seung Lee, Marek Perkowski Jun 2005

Extending Classical Test To Quantum, Jacob D. Biamonte, Minki Jeong, Jae-Seung Lee, Marek Perkowski

Electrical and Computer Engineering Faculty Publications and Presentations

We first introduce a method called quantum path verification, where we search for a break in a quantum network. After explaining these capabilities, we address gate internal faults. We present new fault models to represent crosstalk and unwanted nearest neighbor entanglement. When witnessed, these errors are probabilistic, but there is a set of tests that has the highest probability of detecting a fault. We introduce a method of probabilistic set covering to identify this set of tests. A large part of our work consisted of writing a software package that allows us to compare various fault models and test strategies.


Realizing Ternary Quantum Switching Networks Without Ancilla Bits, Marek Perkowski, Guowu Yang, Xiaoyu Song, Jinzhao Wu Jan 2005

Realizing Ternary Quantum Switching Networks Without Ancilla Bits, Marek Perkowski, Guowu Yang, Xiaoyu Song, Jinzhao Wu

Electrical and Computer Engineering Faculty Publications and Presentations

This paper investigates the synthesis of quantum networks built to realize ternary switching circuits in the absence of ancilla bits. The results we established are twofold. The first shows that ternary Swap, ternary NOT and ternary Toffoli gates are universal for the realization of arbitrary n × n ternary quantum switching networks without ancilla bits. The second result proves that all n×n quantum ternary networks can be generated by NOT, Controlled-NOT, Multiply-Two and Toffoli gates. Our approach is constructive.


Synthesis Of Ternary Quantum Logic Circuits By Decomposition, Marek Perkowski Jan 2005

Synthesis Of Ternary Quantum Logic Circuits By Decomposition, Marek Perkowski

Electrical and Computer Engineering Faculty Publications and Presentations

Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. [1,12] Multivalued quantum systems have also been used in the framework of quantum cryptography, [4] and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. [5] An evolutionary algorithm based synthesizer for ternary quantum circuits has recently been presented, [2] as well as a synthesis method based on matrix factorization [3].In this paper, a recursive synthesis method for ternary quantum circuits based on the Cosine-Sine unitary matrix decomposition is presented.