#### Filter Results:

- Full text PDF available (94)

#### Publication Year

1995

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (45)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Avanti Ketkar, Andreas Klappenecker, Santosh Kumar, Pradeep Kiran Sarvepalli
- IEEE Transactions on Information Theory
- 2006

One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum error-correcting codes have been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum… (More)

- Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli
- IEEE Transactions on Information Theory
- 2007

Classical Bose-Chaudhuri-Hocquenghem (BCH) codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its dual code only if its designed distance delta=O(radicn), and the converse is proved in the… (More)

- JENNY G. FUSELIER, Albert Boggess, +16 authors Angie Allen
- 2007

Hypergeometric Functions Over Finite Fields and Relations to Modular Forms and Elliptic Curves. (August 2007) Jenny G. Fuselier, B.S., Texas A&M University Chair of Advisory Committee: Dr. Matthew Papanikolas The theory of hypergeometric functions over finite fields was developed in the mid1980s by Greene. Since that time, connections between these… (More)

- Andreas Klappenecker, Martin Rötteler
- International Conference on Finite Fields and…
- 2003

Two orthonormal bases B andB′ of a d-dimensional complex inner-product space are called mutually unbiased if and only if |〈b|b〉| = 1/d holds for all b ∈ B and b′ ∈ B′. The size of any set containing pairwise mutually unbiased bases of C cannot exceed d + 1. If d is a power of a prime, then extremal sets containing d+1 mutually unbiased bases are known to… (More)

- Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli
- 2006 IEEE International Symposium on Information…
- 2006

An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this paper, it is shown that one can also deduce from the design parameters whether or not a primitive, narrow-sense BCH… (More)

- A. Klappenecker, M. Rotteler
- Proceedings. International Symposium on…
- 2005

Mutually unbiased bases (MUBs) are a primitive used in quantum information processing to capture the principle of complementarity. While constructions of maximal sets of d+1 such bases are known for system of prime power dimension d, it is unknown whether this bound can be achieved for any non-prime power dimension. In this paper we demonstrate that maximal… (More)

- BY PRADEEP KIRAN, ANDREAS KLAPPENECKER, MARTIN RÖTTELER, P. K. Sarvepalli
- 2009

Recently, quantum error-correcting codes have been proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bitand phase-flip errors. An example for a channel that exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit and phase… (More)

- Andreas Klappenecker, Martin Rötteler
- IEEE Trans. Information Theory
- 2002

Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with abelian index groups. We show that in general an index group of a nice error basis is necessarily solvable.

- Guang Song, Andreas Klappenecker
- Quantum Information & Computation
- 2003

The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is… (More)

- Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch
- DIALM-PODC
- 2010

We discuss the problem of predicting the number of available parking spaces in a parking lot. The parking lot is modeled by a continuous-time Markov chain, following Caliskan, Barthels, Scheuermann, and Mauve. The parking lot regularly communicates the number of occupied spaces, capacity, arrival and parking rate through a vehicular ad-hoc network. The… (More)