230 results on '"Klappenecker, Andreas"'
Search Results
2. Encoding Classical Information in Gauge Subsystems of Quantum Codes
- Author
-
Nemec, Andrew and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
We show how to construct hybrid quantum-classical codes from subsystem codes by encoding the classical information into the gauge qudits using gauge fixing. Unlike previous work on hybrid codes, we allow for two separate minimum distances, one for the quantum information and one for the classical information. We give an explicit construction of hybrid codes from two classical linear codes using Bacon-Casaccino subsystem codes, as well as several new examples of good hybrid code., Comment: 22 pages, 2 figures
- Published
- 2020
- Full Text
- View/download PDF
3. Nonbinary Error-Detecting Hybrid Codes
- Author
-
Nemec, Andrew and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Hybrid codes simultaneously encode both quantum and classical information, allowing for the transmission of both across a quantum channel. We construct a family of nonbinary error-detecting hybrid stabilizer codes that can detect one error while also encoding a single classical bit over the residue class rings $\mathbb{Z}_{q}$ inspired by constructions of nonbinary non-additive codes., Comment: 9 pages
- Published
- 2020
4. Infinite Families of Quantum-Classical Hybrid Codes
- Author
-
Nemec, Andrew and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that hybrid codes can always detect more errors than comparable quantum codes. We also introduce the weight enumerators for general hybrid codes, which we then use to derive linear programming bounds. Finally, inspired by the construction of some families of nonadditive codes, we construct several infinite families of genuine hybrid codes with minimum distance two and three., Comment: 10 pages. arXiv admin note: text overlap with arXiv:1901.02913
- Published
- 2019
5. Hybrid Codes
- Author
-
Nemec, Andrew and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
A hybrid code can simultaneously encode classical and quantum information into quantum digits such that the information is protected against errors when transmitted through a quantum channel. It is shown that a hybrid code has the remarkable feature that it can detect more errors than a comparable quantum code that is able to encode the classical and quantum information. Weight enumerators are introduced for hybrid codes that allow to characterize the minimum distance of hybrid codes. Surprisingly, the weight enumerators for hybrid codes do not obey the usual MacWilliams identity., Comment: 5 pages
- Published
- 2019
- Full Text
- View/download PDF
6. Bird's-eye view on Noise-Based Logic
- Author
-
Kish, Laszlo B., Granqvist, Claes-Goran, Horvath, Tamas, Klappenecker, Andreas, Wen, He, and Bezrukov, Sergey M.
- Subjects
Computer Science - Emerging Technologies - Abstract
Noise-based logic is a practically deterministic logic scheme inspired by the randomness of neural spikes and uses a system of uncorrelated stochastic processes and their superposition to represent the logic state. We briefly discuss various questions such as (i) What does practical determinism mean? (ii) Is noise-based logic a Turing machine? (iii) Is there hope to beat (the dreams of) quantum computation by a classical physical noise-based processor, and what are the minimum hardware requirements for that? Finally, (iv) we address the problem of random number generators and show that the common belief that quantum number generators are superior to classical (thermal) noise-based generators is nothing but a myth., Comment: paper in press
- Published
- 2014
- Full Text
- View/download PDF
7. Sharing classical secrets with CSS codes
- Author
-
Sarvepalli, Pradeep Kiran and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error correcting code, the converse is not true. Motivated by this we sought to find quantum codes which can be converted to secret sharing schemes. If we are interested in sharing classical secrets using quantum information, then we show that a class of pure $[[n,1,d]]_q$ CSS codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense the unauthorized parties do not learn anything about the secret. Gottesman had given conditions to test whether a given subset is an authorized or unauthorized set; they enable us to determine the access structure of quantum secret sharing schemes. For the secret sharing schemes proposed in this paper the access structure can be characterized in terms of minimal codewords of the classical code underlying the CSS code. This characterization of the access structure for quantum secret sharing schemes is thought to be new.
- Published
- 2009
- Full Text
- View/download PDF
8. Degenerate quantum codes and the quantum Hamming bound
- Author
-
Sarvepalli, Pradeep Kiran and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether or not the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this paper we show that Calderbank-Shor-Steane (CSS) codes with alphabet $q\geq 5$ cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes which allows us to strengthen the Rains' bound that an $[[n,k,d]]_2$ code cannot correct more than $\floor{(n+1)/6}$ errors to $\floor{(n-k+1)/6}$. Additionally, we also show that the general quantum codes $[[n,k,d]]_q$ with $k+d\leq {(1-2eq^{-2})n}$ cannot beat the quantum Hamming bound., Comment: Reformulated one of the results, corrected an erroneous remark and added a few more results
- Published
- 2008
- Full Text
- View/download PDF
9. Constructions of Subsystem Codes over Finite Fields
- Author
-
Aly, Salah A. and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dimensions of subsystem and co-subystem are introduced that maintain or improve the minimum distance. As a consequence, many optimal subsystem codes are obtained. Furthermore, it is shown how given subsystem codes can be extended, shortened, or combined to yield new subsystem codes. These subsystem code constructions are used to derive tables of upper and lower bounds on the subsystem code parameters.
- Published
- 2008
10. Encoding Subsystem Codes
- Author
-
Sarvepalli, Pradeep Kiran and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the known results on encoding of stabilizer codes. Along the way we also show how Clifford codes can be encoded. We also show that gauge qubits can be exploited to reduce the encoding complexity., Comment: 31 pages, LaTeX
- Published
- 2008
11. Scheduling Sensors by Tiling Lattices
- Author
-
Klappenecker, Andreas, Lee, Hyunyoung, and Welch, Jennifer L.
- Subjects
Computer Science - Networking and Internet Architecture - Abstract
Suppose that wirelessly communicating sensors are placed in a regular fashion on the points of a lattice. Common communication protocols allow the sensors to broadcast messages at arbitrary times, which can lead to problems should two sensors broadcast at the same time. It is shown that one can exploit a tiling of the lattice to derive a deterministic periodic schedule for the broadcast communication of sensors that is guaranteed to be collision-free. The proposed schedule is shown to be optimal in the number of time slots., Comment: 9 pages, 11 figures
- Published
- 2008
12. Network Coding Capacity of Random Wireless Networks under a SINR Model
- Author
-
Kong, Zhenning, Aly, Salah A., Soljanin, Emina, Yeh, Edmund M., and Klappenecker, Andreas
- Subjects
Computer Science - Information Theory ,Computer Science - Networking and Internet Architecture - Abstract
Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless networks are modelled by random geometric graphs with interference and noise. In this model, the capacities of links are not independent. By employing coupling and martingale methods, we show that, under mild conditions, the network coding capacity for random wireless networks still exhibits a concentration behavior around the mean value of the minimum cut.
- Published
- 2008
13. Asymmetric Quantum LDPC Codes
- Author
-
Sarvepalli, Pradeep Kiran, Roetteler, Martin, and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Recently, quantum error-correcting codes were proposed that capitalize on the fact that many physical error models lead to a significant asymmetry between the probabilities for bit flip and phase flip errors. An example for a channel which exhibits such asymmetry is the combined amplitude damping and dephasing channel, where the probabilities of bit flips and phase flips can be related to relaxation and dephasing time, respectively. We give systematic constructions of asymmetric quantum stabilizer codes that exploit this asymmetry. Our approach is based on a CSS construction that combines BCH and finite geometry LDPC codes., Comment: 5 pages, 1 figure, 1 table, to appear in the Proceedings of the 2008 IEEE International Symposium on Information Theory
- Published
- 2008
- Full Text
- View/download PDF
14. Subsystem Code Constructions
- Author
-
Aly, Salah A. and Klappenecker, Andreas
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor product of two vector spaces: the subsystem and the co-subsystem. A generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. The existence of numerous families of MDS subsystem codes is established. Propagation rules are derived that allow one to obtain longer and shorter subsystem codes from given subsystem codes. Furthermore, propagation rules are derived that allow one to construct a new subsystem code by combining two given subsystem codes., Comment: 5 pages, trading dimensions of subsystem codes, MDS subsystem codes, and propagation rules. All stabilizer codes are converted to subsystem codes. A talk given at QEC07, and submitted to IEEE ISIT 2008
- Published
- 2007
15. Bounds on the Network Coding Capacity for Wireless Random Networks
- Author
-
Aly, Salah A., Kapoor, Vishal, Meng, Jie, and Klappenecker, Andreas
- Subjects
Computer Science - Information Theory ,Computer Science - Networking and Internet Architecture - Abstract
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 upper and lower bounds for wireless nodes using Chernoff bound. Our experiments show that our theoretical predictions are well matched by simulation results., Comment: Netcoding07
- Published
- 2007
16. Asymptotics of the quantum Hamming bound for subsystem codes
- Author
-
Klappenecker, Andreas and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics - Abstract
Ashikhmin and Litsyn showed that all binary stabilizer codes - pure or impure - of sufficiently large length obey the quantum Hamming bound, ruling out the possibility that impure codes of large length can outperform pure codes with respect to sphere packing. In contrast we show that impure subsystem codes do not obey the quantum Hamming bound for pure subsystem codes, not even asymptotically. We show that there exist arbitrarily long Bacon-Shor codes that violate the quantum Hamming bound., Comment: 2 pages
- Published
- 2007
17. Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model
- Author
-
Kong, Zhenning, Aly, Salah A., Soljanin, Emina, Yeh, Edmund M., and Klappenecker, Andreas
- Subjects
Computer Science - Information Theory - Abstract
In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless networks are modeled by random geometric graphs with interference and noise. In this model, the capacities of links are not independent. We consider two scenarios, single source multiple destinations and multiple sources multiple destinations. In the first scenario, employing coupling and martingale methods, we show that the network coding capacity for random wireless networks still exhibits a concentration behavior around the mean value of the minimum cut under some mild conditions. Furthermore, we establish upper and lower bounds on the network coding capacity for dependent and independent nodes. In the second one, we also show that the network coding capacity still follows a concentration behavior. Our simulation results confirm our theoretical predictions.
- Published
- 2007
18. On Subsystem Codes Beating the Hamming or Singleton Bound
- Author
-
Klappenecker, Andreas and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics - Abstract
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field can beat the Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the Hamming bound. A number of open problems concern the comparison in performance of stabilizer and subsystem codes. One of the open problems suggested by Poulin's work asks whether a subsystem code can use fewer syndrome measurements than an optimal MDS stabilizer code while encoding the same number of qudits and having the same distance. We prove that linear subsystem codes cannot offer such an improvement under complete decoding., Comment: 18 pages more densely packed than classically possible
- Published
- 2007
- Full Text
- View/download PDF
19. Graphs, Quadratic Forms, and Quantum Codes
- Author
-
Grassl, Markus, Klappenecker, Andreas, and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new connection between quantum codes and quadratic forms. We provide some simple examples to illustrate our results., Comment: 5 pages, 2 figures, paper presented at the 2002 IEEE International Symposium on Information Theory
- Published
- 2007
- Full Text
- View/download PDF
20. Quantum Convolutional BCH Codes
- Author
-
Aly, Salah A., Grassl, Markus, Klappenecker, Andreas, Roetteler, Martin, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to construct classical convolutional codes from block codes, in particular BCH codes. These codes have the property that they contain their Euclidean, respectively Hermitian, dual codes. Hence, they can be used to define quantum convolutional codes by the stabilizer code construction. We compute BCH-like bounds on the free distances which can be controlled as in the case of block codes, and establish that the codes have non-catastrophic encoders., Comment: 4 pages, minor changes, accepted for publication at the 10th Canadian Workshop on Information Theory (CWIT'07)
- Published
- 2007
- Full Text
- View/download PDF
21. Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
- Author
-
Aly, Salah A., Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
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 Reed- Muller codes. A Singleton bound for pure convolutional stabilizer codes is given., Comment: 5 pages; updated parameters of classical (whence quantum) RM convolutional codes
- Published
- 2007
22. Duadic Group Algebra Codes
- Author
-
Aly, Salah A., Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Computer Science - Information Theory ,Quantum Physics - Abstract
Duadic group algebra codes are a generalization of quadratic residue codes. This paper settles an open problem raised by Zhu concerning the existence of duadic group algebra codes. These codes can be used to construct degenerate quantum stabilizer codes that have the nice feature that many errors of small weight do not need error correction; this fact is illustrated by an example., Comment: 5 pages
- Published
- 2007
23. Subsystem Codes
- Author
-
Aly, Salah A., Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]q subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits., Comment: 8 pages; 44th Allerton Conference
- Published
- 2006
24. Clifford Code Constructions of Operator Quantum Error Correcting Codes
- Author
-
Klappenecker, Andreas and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in terms of Clifford codes, an elegant generalization of stabilizer codes due to Knill. Character-theoretic methods are used to derive a simple method to construct operator quantum error-correcting codes from any classical additive code over a finite field., Comment: 11 pages of character theory; minor changes, theorem 6 added
- Published
- 2006
25. On Quantum and Classical BCH Codes
- Author
-
Aly, Salah A., Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics - Abstract
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 d=O(sqrt(n)), and the converse is proved in the case of narrow-sense codes. Furthermore, the dimension of narrow-sense BCH codes with small design distance is completely determined, and - consequently - the bounds on their minimum distance are improved. These results make it possible to determine the parameters of quantum BCH codes in terms of their design parameters., Comment: 17 pages, LaTeX
- Published
- 2006
26. Remarkable Degenerate Quantum Stabilizer Codes Derived from Duadic Codes
- Author
-
Aly, Salah A., Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics - Abstract
Good quantum codes, such as quantum MDS codes, are typically nondegenerate, meaning that errors of small weight require active error-correction, which is--paradoxically--itself prone to errors. Decoherence free subspaces, on the other hand, do not require active error correction, but perform poorly in terms of minimum distance. In this paper, examples of degenerate quantum codes are constructed that have better minimum distance than decoherence free subspaces and allow some errors of small weight that do not require active error correction. In particular, two new families of [[n,1,>= sqrt(n)]]_q degenerate quantum codes are derived from classical duadic codes., Comment: 4 pages
- Published
- 2006
27. Nonbinary stabilizer codes over finite fields
- Author
-
Ketkar, Avanti, Klappenecker, Andreas, Kumar, Santosh, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
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 the theory of such codes is not as advanced as that of binary quantum codes. This paper describes the basic theory of stabilizer codes over finite fields. The relation between stabilizer codes and general quantum codes is clarified by introducing a Galois theory for these objects. A characterization of nonbinary stabilizer codes over GF(q) in terms of classical codes over GF(q^2) is provided that generalizes the well-known notion of additive codes over GF(4) of the binary case. This paper derives lower and upper bounds on the minimum distance of stabilizer codes, gives several code constructions, and derives numerous families of stabilizer codes, including quantum Hamming codes, quadratic residue codes, quantum Melas codes, quantum BCH codes, and quantum character codes. The puncturing theory by Rains is generalized to additive codes that are not necessarily pure. Bounds on the maximal length of maximum distance separable stabilizer codes are given. A discussion of open problems concludes this paper., Comment: 58 pages, LaTeX
- Published
- 2005
28. On Approximately Symmetric Informationally Complete Positive Operator-Valued Measures and Related Systems of Quantum States
- Author
-
Klappenecker, Andreas, Roetteler, Martin, Shparlinski, Igor, and Winterhof, Arne
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
We address the problem of constructing positive operator-valued measures (POVMs) in finite dimension $n$ consisting of $n^2$ operators of rank one which have an inner product close to uniform. This is motivated by the related question of constructing symmetric informationally complete POVMs (SIC-POVMs) for which the inner products are perfectly uniform. However, SIC-POVMs are notoriously hard to construct and despite some success of constructing them numerically, there is no analytic construction known. We present two constructions of approximate versions of SIC-POVMs, where a small deviation from uniformity of the inner products is allowed. The first construction is based on selecting vectors from a maximal collection of mutually unbiased bases and works whenever the dimension of the system is a prime power. The second construction is based on perturbing the matrix elements of a subset of mutually unbiased bases. Moreover, we construct vector systems in $\C^n$ which are almost orthogonal and which might turn out to be useful for quantum computation. Our constructions are based on results of analytic number theory., Comment: 29 pages, LaTeX
- Published
- 2005
- Full Text
- View/download PDF
29. New Tales of the Mean King
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
The Mean King's problem asks to determine the outcome of a measurement that is randomly selected from a set of complementary observables. We review this problem and offer a combinatorial solution. More generally, we show that whenever an affine resolvable design exists, then a state reconstruction problem similar to the Mean King's problem can be defined and solved. As an application of this general framework we consider a problem involving three qubits in which the outcome of nine different measurements can be determined without using ancillary qubits. The solution is based on a measurement derived from Hadamard designs., Comment: 20 pages, 1 figure, uses yfonts
- Published
- 2005
30. Mutually Unbiased Bases are Complex Projective 2-Designs
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
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 systems 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 sets of MUBs come with a rich combinatorial structure by showing that they actually are the same objects as the complex projective 2-designs with angle set {0,1/d}. We also give a new and simple proof that symmetric informationally complete POVMs are complex projective 2-designs with angle set {1/(d+1)}., Comment: 5 pages; minor corrections, two remarks on previous work added, submitted to 2005 IEEE International Symposium on Information Theory
- Published
- 2005
31. Nonbinary Quantum Reed-Muller Codes
- Author
-
Sarvepalli, Pradeep Kiran and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
We construct nonbinary quantum codes from classical generalized Reed-Muller codes and derive the conditions under which these quantum codes can be punctured. We provide a partial answer to a question raised by Grassl, Beth and Roetteler on the existence of q-ary quantum MDS codes of length n with q\le n\le q^2-1., Comment: 4 pages, submitted to IEEE ISIT 2005
- Published
- 2005
32. Primitive Quantum BCH Codes over Finite Fields
- Author
-
Aly, Salah, Klappenecker, Andreas, and Sarvepalli, Pradeep Kiran
- Subjects
Quantum Physics ,Computer Science - Information Theory - Abstract
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 contains its Euclidean or Hermitian dual code. This information is invaluable in the construction of quantum BCH codes. A new proof is provided for the dimension of BCH codes with small designed distance, and simple bounds on the minimum distance of such codes and their duals are derived as a consequence. These results allow us to derive the parameters of two families of primitive quantum BCH codes as a function of their design parameters., Comment: 5 pages; title changed, references added, revised
- Published
- 2005
33. The simplified Toffoli gate implementation by Margolus is optimal
- Author
-
Song, Guang and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
Unitary operations are expressed in the quantum circuit model as a finite sequence of elementary gates, such as controlled-not gates and single qubit gates. We prove that the simplified Toffoli gate by Margolus, which coincides with the Toffoli gate up to a single change of sign, cannot be realized with less than three controlled-not gates. If the circuit is implemented with three controlled-not gates, then at least four additional single qubit gates are necessary. This proves that the implementation suggested by Margolus is optimal., Comment: 15 pages, 44 figures, submitted to Quantum Information and Computation
- Published
- 2003
34. Remarks on Clifford codes
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
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 compile a table of all true Clifford codes for error groups of small order., Comment: 10 pages; submitted to Quantum Information and Computation
- Published
- 2003
35. Quantum Software Reusability
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits., Comment: 20 pages latex, 11 postscript figures
- Published
- 2003
36. Constructions of Mutually Unbiased Bases
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if ||^2=1/d holds for all b in B and b' in 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 known to exist. We give a simplified proof of this fact based on the estimation of exponential sums. We discuss conjectures and open problems concerning the maximal number of mutually unbiased bases for arbitrary dimensions., Comment: 8 pages latex
- Published
- 2003
37. On the Monomiality of Nice Error Bases
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
Unitary error bases generalize the Pauli matrices to higher dimensional systems. Two basic constructions of unitary error bases are known: An algebraic construction by Knill, which yields nice error bases, and a combinatorial construction by Werner, which yields shift-and-multiply bases. An open problem posed by Schlingemann and Werner (see http://www.imaph.tu-bs.de/qi/problems/6.html) relates these two constructions and asks whether each nice error basis is equivalent to a shift-and-multiply basis. We solve this problem and show that the answer is negative. However, we also show that it is always possible to find a fairly sparse representation of a nice error basis., Comment: 6 pages
- Published
- 2003
38. Engineering Functional Quantum Algorithms
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most O(mK+m^2log m) elementary gates. The functions of U are realized by a generic quantum circuit, which has a particularly simple structure. Among other results, we obtain efficient circuits for the fractional Fourier transform., Comment: 4 pages, 2 figures
- Published
- 2002
- Full Text
- View/download PDF
39. Optimal Realizations of Controlled Unitary Gates
- Author
-
Song, Guang and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
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 optimal if and only if the matrix U satisfies the conditions tr U != 0, tr UX != 0, and det U != 1. We also derive optimal implementations in the non-generic cases., Comment: 32 figures, 22 pages
- Published
- 2002
40. Quantum Computing and a Unified Approach to Fast Unitary Transforms
- Author
-
Agaian, Sos S. and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log^2 N) operations to transform a state vector of a quantum computer of length N., Comment: 11 pages, LaTeX2e, 15 figures, not viewable as dvi. To appear in Image Processing: Algorithms and Systems, Electronic Imaging 2002, San Jose, SPIE, 2002. Odd title beyond our control
- Published
- 2002
- Full Text
- View/download PDF
41. On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log^2 N) elementary quantum gates are necessary to implement any of those transforms for input sequences of length N., Comment: 15 pages, LaTeX 2e. Expanded version of quant-ph/0111038. SPECLOG 2000, Tampere, Finland
- Published
- 2001
42. Discrete Cosine Transforms on Quantum Computers
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
A classical computer does not allow to calculate a discrete cosine transform on N 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 the discrete sine transforms of size NxN and types I,II,III, and IV with as little as O(log^2 N) operations on a quantum computer, whereas the known fast algorithms on a classical computer need O(N log N) operations., Comment: 5 pages, LaTeX 2e, IEEE ISPA01, Pula, Croatia, 2001
- Published
- 2001
43. Beyond Stabilizer Codes II: Clifford Codes
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an abelian index group. In particular, if the errors are modelled by tensor products of Pauli matrices, then the associated Clifford codes are necessarily stabilizer codes., Comment: 9 pages, LaTeX2e. Minor changes. Title changed by request of IEEE Trans. IT
- Published
- 2000
44. Beyond Stabilizer Codes I: Nice Error Bases
- Author
-
Klappenecker, Andreas and Roetteler, Martin
- Subjects
Quantum Physics ,Computer Science - Emerging Technologies - Abstract
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., Comment: 12 pages, LaTeX2e. Minor changes. Title changed by request of IEEE Trans. IT
- Published
- 2000
45. The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms
- Author
-
Bowden, Charles M., Chen, Goong, Diao, Zijian, and Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the two-dimensional 1-qubit space. In this paper, we show that H and P(.) suffice to generate the unitary group U(2) and, consequently, through controlled-U operations and their concatenations, the entire unitary group U(2^n) on n-qubits can be generated. Since any quantum computing algorithm in an n-qubit quantum computer is based on operations by matrices in U(2^n), in this sense we have the universality of the QFT., Comment: 12 pages, 3 figures, submitted to SIAM Journal on Computing
- Published
- 2000
46. Wavelets and Wavelet Packets on Quantum Computers
- Author
-
Klappenecker, Andreas
- Subjects
Quantum Physics - Abstract
We show how periodized wavelet packet transforms and periodized wavelet transforms can be implemented on a quantum computer. Surprisingly, we find that the implementation of wavelet packet transforms is less costly than the implementation of wavelet transforms on a quantum computer., Comment: 11 pages, 10 postscript figure, to appear in Proc. of Wavelet Applications in Signal and Image Processing VII
- Published
- 1999
- Full Text
- View/download PDF
47. Stochastic Modeling of Dynamic Distributed Systems with Crash Recovery and Its Application to Atomic Registers
- Author
-
Bonomi, Silvia, Klappenecker, Andreas, Lee, Hyunyoung, Welch, Jennifer L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Baldoni, Roberto, editor, Flocchini, Paola, editor, and Binoy, Ravindran, editor
- Published
- 2012
- Full Text
- View/download PDF
48. Dynamic Regular Registers in Systems with Churn
- Author
-
Klappenecker, Andreas, Lee, Hyunyoung, Welch, Jennifer L., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Défago, Xavier, editor, Petit, Franck, editor, and Villain, Vincent, editor
- Published
- 2011
- Full Text
- View/download PDF
49. A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes
- Author
-
Nemec, Andrew, primary and Klappenecker, Andreas, additional
- Published
- 2022
- Full Text
- View/download PDF
50. Finding available parking spaces made easy
- Author
-
Klappenecker, Andreas, Lee, Hyunyoung, and Welch, Jennifer L.
- Published
- 2014
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.