#### Filter Results:

#### Publication Year

1995

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

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

A classical computer does not allow to calculate a discrete cosine transform on AE points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and… (More)

- JENNY G. FUSELIER, Paula Tretkoff, Peter Stiller, Jenny G. Fuselier, Matthew Papanikolas, Andreas Klappenecker +12 others
- 2007

The theory of hypergeometric functions over finite fields was developed in the mid-1980s by Greene. Since that time, connections between these functions and elliptic curves and modular forms have been investigated by mathematicians such as Ahlgren, Frechette, Koike, Ono, and Papanikolas. In this dissertation, we begin by giving a survey of these results and… (More)

Classical 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 δ = O(√ n), and the converse is proved in the case of narrow-sense codes.… (More)

Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer code. We derive a necessary and sufficient condition that allows to decide when a Clifford code is a stabilizer code, and… (More)

- BY PRADEEP, KIRAN SARVEPALLI, 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 bit-and 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… (More)

— Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from… (More)

— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of network coding for this model is concentrated around the expected value of its minimum cut. Furthermore, we establish… (More)

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)