activity
19962003
most citedCluster states, algorithms and graphs

6 citations · 9 across the 3 of their papers we have counts for

collaborators

9 papers

quant-ph20032 cited

Quantum error correcting codes and one-way quantum computing: Towards a quantum memory

Dirk Schlingemann

For realizing a quantum memory we suggest to first encode quantum information via a quantum error correcting code and then concatenate combined decoding and re-encoding operations.…

quant-ph20036 cited

Cluster states, algorithms and graphs

Dirk Schlingemann

The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation i…

quant-ph20021 cited

Infinitely entangled states

M. Keyl, D. Schlingemann, R. F. Werner

For states in infinite dimensional Hilbert spaces entanglement quantities like the entanglement of distillation can become infinite. This leads naturally to the question, whether o…

quant-ph2002

Logical network implementation for cluster states and graph codes

Dirk Schlingemann

In a previous paper a straight forward construction method for quantum error correcting codes, based on graphs, has been presented. These graph codes are directly related to cluste…

quant-ph2001

Stabilizer codes can be realized as graph codes

D. Schlingemann

We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer cod…

hep-th1999

Euclidean field theory on a sphere

Dirk Schlingemann

This paper is concerned with a structural analysis of euclidean field theories on the euclidean sphere. In the first section we give proposal for axioms for a euclidean field theor…