Bures metric

Known as: Bures distance, Helstrom metric 
In mathematics, in the area of quantum information geometry, the Bures metric or Helstrom metric defines an infinitesimal distance between density… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
The compression capability of several generations of video coding standards is compared by means of peak signal-to-noise ratio… (More)
  • table I
  • table II
  • table III
  • table V
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Metric spaces are playing an increasing role in mathematics and the applied sciences. Over the past two decades the development… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Test case prioritization techniques involve scheduling over test cases in an order that improves the performance of regression… (More)
Is this relevant?
2007
2007
The aim of this paper is to provide a method for explicit computation of the Bures metric over the space of N-level quantum… (More)
Is this relevant?
2007
2007
In this paper, we consider the problem where a point robot in a 2D or 3D environment equipped with an omnidirectional range… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1999
1999
The aim of this paper is to derive explicit formulae for the Riemannian Bures metric g on the manifold D of (finite dimensional… (More)
Is this relevant?
1999
1999
The Riemannian Bures metric on the space of (normalized) complex positive matrices is used for parameter estimation of mixed… (More)
Is this relevant?
1998
1998
It is shown that the connection form (gauge field) related to the generalization of the Berry phase to mixed states proposed by… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We improve previously proposed conditions each measure of entanglement has to satisfy. We present a class of entanglement… (More)
  • figure 1
  • figure 2
Is this relevant?
1991
1991
A dynamic data structure is given that maintains the minimal distance in a set of n points in k-dimensional space in O((log n) k… (More)
Is this relevant?