most citedFast simulation of stabilizer circuits using a graph state representation

173 citations · 249 across the 3 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph200518 cited

Spin gases as microscopic models for non-Markovian decoherence

L. Hartmann, J. Calsamiglia, W. Dür +1

We analyze a microscopic decoherence model in which the total system is described as a spin gas. A spin gas consists of N classically moving particles with additional, interacting…

quant-ph200558 cited

Distillation of multipartite entanglement by complementary stabilizer measurements

Akimasa Miyake, Hans J. Briegel

We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements, to distill directly a wider range of states beyond the stab…

quant-ph2005173 cited

Fast simulation of stabilizer circuits using a graph state representation

Simon Anders, Hans J. Briegel

According to the Gottesman-Knill theorem, a class of quantum circuits, namely the so-called stabilizer circuits, can be simulated efficiently on a classical computer. We introduce…

quant-ph2005245 cited

Multipartite entanglement in spin chains

Otfried Guehne, Geza Toth, Hans J. Briegel

We investigate the presence of multipartite entanglement in macroscopic spin chains. We discuss the Heisenberg and the XY model and derive bounds on the internal energy for systems…

quant-ph20053 cited

Entanglement and decoherence in spin gases

J. Calsamiglia, L. Hartmann, W. Dür +1

We study the dynamics of entanglement in spin gases. A spin gas consists of a (large) number of interacting particles whose random motion is described classically while their inter…

quant-ph20045 cited

Algorithmic complexity of quantum states

C. Mora, H. J. Briegel

In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the…