Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/153821
Full metadata record
DC FieldValueLanguage
dc.contributor.authorConlon, Lorcán O.en_US
dc.contributor.authorSuzuki, Junen_US
dc.contributor.authorLam, Ping Koyen_US
dc.contributor.authorAssad, Syed Muhamaden_US
dc.date.accessioned2021-12-30T00:39:27Z-
dc.date.available2021-12-30T00:39:27Z-
dc.date.issued2021-
dc.identifier.citationConlon, L. O., Suzuki, J., Lam, P. K. & Assad, S. M. (2021). Efficient computation of the Nagaoka–Hayashi bound for multiparameter estimation with separable measurements. Npj Quantum Information, 7(1), 110-. https://dx.doi.org/10.1038/s41534-021-00414-1en_US
dc.identifier.issn2056-6387en_US
dc.identifier.urihttps://hdl.handle.net/10356/153821-
dc.description.abstractFinding the optimal attainable precisions in quantum multiparameter metrology is a non-trivial problem. One approach to tackling this problem involves the computation of bounds which impose limits on how accurately we can estimate certain physical quantities. One such bound is the Holevo Cramér–Rao bound on the trace of the mean squared error matrix. The Holevo bound is an asymptotically achievable bound when one allows for any measurement strategy, including collective measurements on many copies of the probe. In this work, we introduce a tighter bound for estimating multiple parameters simultaneously when performing separable measurements on a finite number of copies of the probe. This makes it more relevant in terms of experimental accessibility. We show that this bound can be efficiently computed by casting it as a semidefinite programme. We illustrate our bound with several examples of collective measurements on finite copies of the probe. These results have implications for the necessary requirements to saturate the Holevo bound.en_US
dc.language.isoenen_US
dc.relation.ispartofnpj Quantum Informationen_US
dc.rights© 2021 The Author(s). This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.en_US
dc.subjectScience::Physicsen_US
dc.titleEfficient computation of the Nagaoka–Hayashi bound for multiparameter estimation with separable measurementsen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.identifier.doi10.1038/s41534-021-00414-1-
dc.description.versionPublished versionen_US
dc.identifier.scopus2-s2.0-85110634359-
dc.identifier.issue1en_US
dc.identifier.volume7en_US
dc.identifier.spage110en_US
dc.subject.keywordsQuantum Informationen_US
dc.subject.keywordsQuantum Metrologyen_US
dc.description.acknowledgementThis work was supported by the Australian Research Council (ARC) under the Centre of Excellence for Quantum Computation and Communication Technology (Grant No. CE170100012). J.S. was supported by the UEC Research Support Program, the University of Electro-Communications. The authors are grateful to Professor Nagaoka and Professor Hayashi for helpful discussions.en_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:SPMS Journal Articles
Files in This Item:
File Description SizeFormat 
s41534-021-00414-1.pdf1.08 MBAdobe PDFView/Open

Page view(s)

24
Updated on Jul 3, 2022

Download(s)

15
Updated on Jul 3, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.