Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Highly efficient estimation of entanglement measures for large experimentally created graph states via simple measurements

Wunderlich, Harald and Virmani, Shashank and Plenio, Martin B. (2010) Highly efficient estimation of entanglement measures for large experimentally created graph states via simple measurements. New Journal of Physics, 12. ISSN 1367-2630

[img]
Preview
Text (Wunderlich-etal-NJP-2010-Highly-efficient-estimation-of-entanglement-measures)
Wunderlich_etal_NJP_2010_Highly_efficient_estimation_of_entanglement_measures.pdf - Final Published Version
License: Creative Commons Attribution-NonCommercial-ShareAlike 3.0 logo

Download (569kB) | Preview

Abstract

Quantifying experimentally created entanglement could in principle be accomplished by measuring the entire density matrix and calculating an entanglement measure of choice thereafter. Due to the tensor structure of the Hilbert space, this approach becomes unfeasible even for medium-sized systems. Here we present methods for quantifying the entanglement of arbitrarily large two-colorable graph states from simple measurements. The presented methods provide non-trivial bounds on the entanglement for any state as long as there is sufficient fidelity with such a graph state. The measurement data considered here is merely given by stabilizer measurements, thus leading to an exponential reduction in the number of measurements required. We provide analytical results for the robustness of entanglement and the relative entropy of entanglement.