Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9910115

A Comment on Fisher Information and Quantum Algorithms

J J Alvarez, César Gómez

Published Oct 27, 1999• 19 citations
arXivHTMLPDF

Abstract

We show that Grover's algorithm defines a geodesic in quantum Hilbert space with the Fubini-Study metric. From statistical point of view Grover's algorithm is characterized by constant Fisher's function. Quantum algorithms changing complexity class as Shor's factorization does not preserve constant Fisher's information. An adiabatic quantum factorization algorithm in non polynomial time is presented to exemplify the result.

DOI
10.48550/arxiv.quant-ph/9910115

Related papers

Decrease of Fisher information and the information geometry of evolution equations for quantum mechanical probability amplitudes

Carlo Cafaro, Paul M. Alsing

The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is characterized by its decrease along the solutions of the Boltzmann equation for Maxwellian molecules in the two-dimensional case. From a quantum mechanical standpoint, the output state in Grover's quantum search algorithm follows a geodesic path obtained from the Fubini-Study metric on the manifold of Hilbert-space rays. Additionally, Grover's algorithm is specified by constant Fisher information. In this paper, we present an information geometric characterization of the oscillatory or monotonic behavior of statistically parametrized squared probability amplitudes originating from special functional forms of the Fisher information function: constant, exponential decay, and power-law decay. Furthermore, for each case, we compute both the computational speed and the availability loss of the corresponding physical processes by exploiting a convenient Riemannian geometrization of useful thermodynamical concepts. Finally, we briefly comment on the possibility of using the proposed methods of information geometry to help identify a suitable trade-off between speed and thermodynamic efficiency in quantum search algorithms.

arXiv:1804.04009•Physical review. E•Apr 9, 2018•20 citations

Geometry and Dynamics of Algorithms on the Quantum Informaiton Space

Yoshio Uwano

Quantum computation and quantum information are known well to be very hot interdisciplinary fields [1], where a number of approaches have been taken. In a series of papers [2, 3, 4, 5], the author takes geometric and dynamical-system approaches to differential equations on the quantum information space (QIS) raised from algorithms in engineering. One of the keys to the papers is the fact that the SLD-Fisher metric of the QIS is obtained from the natural Riemannian metric of the space of ordered tuples of multiqubits through a geometric reduction [2]. On the QIS, three types of geodesics are of much interest; the m-geodesics, the e-geodesics and the Levi-Civita geodesics. As a continuation of the paper [5] showing that the Grover search geodesic for a given ordered tuple of multiqubits is reduced to an m-geodesic on the QIS, this talk presents presents the classes curves which are reduced to the m-, the e-, and the Levi-Civita geodesics on the QIS. In particular, the curves related with the m-geodesics are discussed in detail. Since the QIS consists of positive-(semi)definite matrices with unit trace, computer algebra would be worth applying to matrix computations on the QIS. Applicability of computer algebra will be discussed also in this talk.

•Jul 1, 2013•0 citations

Quantum Information in Geometric Quantum Mechanics

G. F. Volkert

A fundamental starting point in quantum information theory is the consideration of the von Neumann entropy and its generalization to relative quantum entropies. A particular feature of quantum relative entropies is their relation via their Hessian to monotonic Riemannian metrics on the dense set of invertible mixed quantum states (Lesniewski and Ruskai 1999). These metrics are also known as quantum Fisher information metrics and provide a direct link to quantum estimation theory (Helstrom 1969). Quantum Fisher information metrics which are extendable to pure states coincide all with the Fubini Study metric of the projective Hilbert space of complex rays. This theses outlines possible advantages of an inverse approach to quantum information theory, by starting with the Fubini Study metric rather then with the von Neumann entropy. This is done in a first step by associating to the Fubini Study metric a covariant and a contra-variant structure on the punctured Hilbert space as being available in the geometric formulation of quantum mechanics. While the contra-variant structure leads to a quantum version of the Cramér-Rao inequality for general 1-dimensional submanifolds of pure states, the covariant structure provides alternative entanglement monotones by identifying an inner product on the pullback tensor fields on local unitary group orbits of quantum states. It is shown in the case of two qubits that these monotones yield a more efficient estimation of entanglement than standard measures from the literature as those associated with the linearization of the von Neumann entropy.

•Jan 1, 2011•0 citations

An information geometric viewpoint of algorithms in quantum computing

Carlo Cafaro, Stefano Mancini

We show that quantum information geometry can be used to characterize Grover's searching algorithm. Specifically, quantifying the notion of quantum distinguishability between parametric density operators by means of the Wigner-Yanase quantum information metric, we uncover that the quantum searching problem can be recast in an information geometric framework where Grover's dynamics is characterized by a geodesic on the manifold of the parametric density operators of pure quantum states constructed from the continuos approximation of the parametric quantum out-put state in Grover's algorithm.

AIP conference proceedings•Jan 1, 2012•10 citations

From Geometric Quantum Mechanics to Quantum Information

Paolo Aniello, Jesús Clemente-Gallardo, Giuseppe Marmo +1 more

We consider the geometrization of quantum mechanics. We then focus on the pull-back of the Fubini-Study metric tensor field from the projective Hibert space to the orbits of the local unitary groups. An inner product on these tensor fields allows us to obtain functions which are invariant under the considered local unitary groups. This procedure paves the way to an algorithmic approach to the identification of entanglement monotone candidates. Finally, a link between the Fubini-Study metric and a quantum version of the Fisher information metric is discussed.

arXiv:1101.0625•Jan 3, 2011•12 citations

Geometric Analysis of Grover's Search Algorithm in the Presence of Perturbation

Wenliang Jin

"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."

•Jul 1, 2013•0 citations
We show that Grover's algorithm defines a geodesic in quantum Hilbert space with the Fubini-Study metric. From statistical point of view Grover's algorithm is characterized by constant Fisher's function. Quantum algorithms changing complexity class as Shor's factorization does not preserve constant Fisher's information. An adiabatic quantum factorization algorithm in non polynomial time is presented to exemplify the result.
The relevance of the concept of Fisher information is increasing in both statistical physics and quantum computing. From a statistical mechanical standpoint, the application of Fisher information in the kinetic theory of gases is characterized by its decrease along the solutions of the Boltzmann equation for Maxwellian molecules in the two-dimensional case. From a quantum mechanical standpoint, the output state in Grover's quantum search algorithm follows a geodesic path obtained from the Fubini-Study metric on the manifold of Hilbert-space rays. Additionally, Grover's algorithm is specified by constant Fisher information. In this paper, we present an information geometric characterization of the oscillatory or monotonic behavior of statistically parametrized squared probability amplitudes originating from special functional forms of the Fisher information function: constant, exponential decay, and power-law decay. Furthermore, for each case, we compute both the computational speed and the availability loss of the corresponding physical processes by exploiting a convenient Riemannian geometrization of useful thermodynamical concepts. Finally, we briefly comment on the possibility of using the proposed methods of information geometry to help identify a suitable trade-off between speed and thermodynamic efficiency in quantum search algorithms.
Quantum computation and quantum information are known well to be very hot interdisciplinary fields [1], where a number of approaches have been taken. In a series of papers [2, 3, 4, 5], the author takes geometric and dynamical-system approaches to differential equations on the quantum information space (QIS) raised from algorithms in engineering. One of the keys to the papers is the fact that the SLD-Fisher metric of the QIS is obtained from the natural Riemannian metric of the space of ordered tuples of multiqubits through a geometric reduction [2]. On the QIS, three types of geodesics are of much interest; the m-geodesics, the e-geodesics and the Levi-Civita geodesics. As a continuation of the paper [5] showing that the Grover search geodesic for a given ordered tuple of multiqubits is reduced to an m-geodesic on the QIS, this talk presents presents the classes curves which are reduced to the m-, the e-, and the Levi-Civita geodesics on the QIS. In particular, the curves related with the m-geodesics are discussed in detail. Since the QIS consists of positive-(semi)definite matrices with unit trace, computer algebra would be worth applying to matrix computations on the QIS. Applicability of computer algebra will be discussed also in this talk.
A fundamental starting point in quantum information theory is the consideration of the von Neumann entropy and its generalization to relative quantum entropies. A particular feature of quantum relative entropies is their relation via their Hessian to monotonic Riemannian metrics on the dense set of invertible mixed quantum states (Lesniewski and Ruskai 1999). These metrics are also known as quantum Fisher information metrics and provide a direct link to quantum estimation theory (Helstrom 1969). Quantum Fisher information metrics which are extendable to pure states coincide all with the Fubini Study metric of the projective Hilbert space of complex rays. This theses outlines possible advantages of an inverse approach to quantum information theory, by starting with the Fubini Study metric rather then with the von Neumann entropy. This is done in a first step by associating to the Fubini Study metric a covariant and a contra-variant structure on the punctured Hilbert space as being available in the geometric formulation of quantum mechanics. While the contra-variant structure leads to a quantum version of the Cramér-Rao inequality for general 1-dimensional submanifolds of pure states, the covariant structure provides alternative entanglement monotones by identifying an inner product on the pullback tensor fields on local unitary group orbits of quantum states. It is shown in the case of two qubits that these monotones yield a more efficient estimation of entanglement than standard measures from the literature as those associated with the linearization of the von Neumann entropy.
We show that quantum information geometry can be used to characterize Grover's searching algorithm. Specifically, quantifying the notion of quantum distinguishability between parametric density operators by means of the Wigner-Yanase quantum information metric, we uncover that the quantum searching problem can be recast in an information geometric framework where Grover's dynamics is characterized by a geodesic on the manifold of the parametric density operators of pure quantum states constructed from the continuos approximation of the parametric quantum out-put state in Grover's algorithm.
We consider the geometrization of quantum mechanics. We then focus on the pull-back of the Fubini-Study metric tensor field from the projective Hibert space to the orbits of the local unitary groups. An inner product on these tensor fields allows us to obtain functions which are invariant under the considered local unitary groups. This procedure paves the way to an algorithmic approach to the identification of entanglement monotone candidates. Finally, a link between the Fubini-Study metric and a quantum version of the Fisher information metric is discussed.
"For an initial uniform superposition over all pos- sible computational basis states, we explore the perfor- mance of Grover’s search algorithm geometrically when imposing a perturbation on the Walsh-Hadamard trans- formation contained in the Grover iteration. We give the geometric picture to visualize the quantum search process in the three-dimensional space and show that Grover’s search algorithm can work well with an appropriately chosen per- turbation. Thereby we corroborate Grover’s conclusion that if the perturbation is small, then it will have little impact on the implementation of this algorithm. We also prove that Grover’s path cannot achieve a geodesic under a perturba- tion of the Fubini-Study metric."