#### Filter Results:

#### Publication Year

1993

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

For one qubit systems, we present a short, elementary argument characterizing unital quantum operators in terms of their action on Bloch vectors. We then show how our approach generalizes to multi-qubit systems, obtaining inequalities that govern when a " diagonal " superoperator on the Bloch region is a quantum operator. These inequalities are the n-qubit… (More)

- H. T. Williams
- 1993

A presentation of the problem of calculating the vector coupling coefficients for SU 3 ⊃ SU 2 ⊗ U 1 is made, in the spirit of traditional treatments of SU2 coupling. The coefficients are defined as the overlap matrix element between product states and a coupled state with good SU3 quantum numbers. A technique for resolution of the outer degeneracy problem,… (More)

- K F Cubitt, H T Williams, +14 authors N J Melendez
- 2012

The capstone experience of the biology major is the 3-semester research program sequence. Students complete a potentially publishable project, which often complements their applications to graduate or medical school. Some of these projects are eventually published in peer-reviewed journals. Development of an intelligent reasoning system to distinguish… (More)

This study investigates the impact of banks characteristics, financial structure and macroeconomic indicators on banks Capital base in the Nigerian banking industry. The study does not account for ratio analysis in the computation of capital adequacy but rather it examines the determinant of Capital adequacy in Nigeria during the period 1980 – 2008 within… (More)

- P. S. Bourdon, H. T. Williams
- Quantum Information & Computation
- 2007

Let N be a positive integer, let b < N be a positive integer relatively prime to N , and let r be the order of b modulo N. Finally, let QC be a quantum computer whose input register has the size specified in Shor's original description of his order-finding algorithm. We prove that when Shor's algorithm is implemented on QC, then the probability P of… (More)

Let N be a (large) positive integer, and let b < N be a positive integer relatively prime to N whose order modulo N is large. Let QC be a quantum computer whose input register has the size specified in Shor's original description of his order-finding algorithm. We show that when Shor's algorithm is implemented on QC, then the probability of obtaining a… (More)

- ‹
- 1
- ›