2k citations · 18.4k across the 171 of their papers we have counts for
12 papers · 1 filter
Graph states as ground states of many-body spin-1/2 Hamiltonians
M. Van den Nest, K. Luttmer, W. Dür +1
We consider the problem whether graph states can be ground states of local interaction Hamiltonians. For Hamiltonians acting on n qubits that involve at most two-body interactions,…
On the role of memory errors in quantum repeaters
L. Hartmann, B. Kraus, H. -J. Briegel +1
We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard op…
Classical spin models and the quantum stabilizer formalism
M. Van den Nest, W. Dür, H. J. Briegel
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. M…
Quantum Kolmogorov complexity and its applications
C. Mora, H. Briegel, B. Kraus
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information re…
Measurement-based quantum computation and undecidable logic
M. Van den Nest, H. J. Briegel
We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum s…
Classical simulation versus universality in measurement based quantum computation
M. Van den Nest, W. Dür, G. Vidal +1
We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure rec…
Optimal purification of thermal graph states
Alastair Kay, Jiannis K. Pachos, Wolfgang Dür +1
In this paper, a purification protocol is presented and its performance is proven to be optimal when applied to a particular subset of graph states that are subject to local Z-nois…
Entanglement purification protocols for all graph states
Caroline Kruszynska, Akimasa Miyake, Hans J. Briegel +1
We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare ou…
Universal resources for measurement-based quantum computation
Maarten Van den Nest, Akimasa Miyake, Wolfgang Dür +1
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by th…
One-way Quantum Computation - a tutorial introduction
Dan E. Browne, Hans J. Briegel
In this book chapter, we provide a tutorial introduction to one-way quantum computation and many of the techniques one can use to understand it. The techniques which are described…
Ground state approximation for strongly interacting systems in arbitrary dimension
S. Anders, M. B. Plenio, W. Dür +2
We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based…
Entanglement in Graph States and its Applications
M. Hein, W. Dür, J. Eisert +3
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters t…