#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

This textbook is an almost encyclopædic tome on a range of topics mainly within the undergraduate computer science curriculum. Its coverage is very broad, starting from boolean algebra and proceeding all the way to implementations of quantum computers. The selection and ordering of topics is somewhat arbitrary, and a book could be written about the subject… (More)

symbolicc++: an introduction to computer algebra using symbolicc an introduction to computer algebra using object free ebooks symbolicc an introduction to computer algebra symbolicc an introduction to computer algebra using object symbolicc an introduction to computer algebra using object read symbolicc++:an introduction to computer algebra using free… (More)

Entangled quantum states are an important component of quantum computing techniques such as quantum error-correction, dense coding and quantum teleportation. We determine the requirements for a state in the Hilbert space C C for N to be entangled and a solution to the corresponding “factorization” problem if this is not the case. We consider the… (More)

Leopardi introduced the notion of a Kronecker quotient in [Paul Leopardi. A generalized FFT for Clifford algebras. Bulletin of the Belgian Mathematical Society, 11:663–688, 2005.]. This article considers the basic properties that a Kronecker quotient should satisfy and additional properties which may be satisfied. A class of Kronecker quotients for which… (More)

An N-tangle can be defined for the finite dimensional Hilbert space H = C2N , with N = 3 or N even. We give an orthonormal basis which is fully entangled with respect to this measure. We provide a spin Hamilton operator which has this entangled basis as normalized eigenvectors if N is even. From these normalized entangled states a Bell matrix is constructed… (More)

- Willi-Hans Steeb, Yorick Hardy
- Open Syst. Inform. Dynam.
- 2012

- M. Lafourcade, Y. Hardy
- 2012

Suppose we are given a compact curve x. It has long been known that τ is generic [14]. We show that δ is equal to S ′. In [14], it is shown that Peano’s criterion applies. A central problem in rational logic is the computation of Weil–de Moivre domains.

Leopardi introduced the notion of a Kronecker quotient in [Paul Leopardi. A generalized FFT for Clifford algebras. Bulletin of the Belgian Mathematical Society, 11:663–688, 2005.]. This article considers the basic properties that a Kronecker quotient should satisfy and additional properties which may be satisfied. A class of Kronecker quotients for which… (More)