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

Geometry and Dynamics of Algorithms on the Quantum Informaiton Space

Yoshio Uwano

Published Jul 1, 2013• 0 citations
OpenAlex

Abstract

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.

Related papers

Geometry and Dynamics of a Quantum Search Algorithm for an Ordered Tuple of Multi-Qubits

Yoshio Uwano

geodesic in (2 n+1 -1)-dimensional sphere.Further, the reduced search sequence is given rise to the complex projective space CP 2 n -1 through a geometric reduction, which is also shown to be on a geodesic in CP 2 n -1 .Roughly speaking, the reduction in [15] is made through the phase-factor elimination from quantum states, so that CP 2 n -1 is thought of as the space of rays.Note that the geodesics above are associated with the standard metric on (2 n+1 -1)-dimensional sphere and with the Fubini-Study metric on CP 2 n -1 , respectively.The Fubini-Study metric on CP 2 n -1 is utilized also in [15] to measure the minimum distance from each state involved in the search sequence to the submanifold consisting of non-entangled states, which characterizes the entanglement of the states along the search.As expected benefits of geometric and dynamical views on quantum algorithmic studies like [15], the following would be worth listed;1 By revealing underlying geometry of quantum algorithms (not necessarily universal), numbers of results in geometry are expected to be applied to make advances in quantum computation and information.2 On looked upon the iterations made in algorithms as (discrete) time-evolutions of states, numbers of results in dynamical systems are expected to be applied to make advances in quantum computation and information.3 In view of a close connection between geometry and dynamical systems, geometric and dynamical-systems studies on quantum algorithms may provide interesting examples of dynamical systems.It would be worth noting here that there exists another approach to quantum searches using adiabatic evolution [16][17][18].That approach, however, is outside the scope of this chapter since the search dealt with in this chapter is organized on the so-called amplitude magnification technique [8] which differs from the adiabatic evolution.

InTech eBooks•Feb 13, 2013•1 citation

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

Quantum Information and Computation•Nov 1, 2008•130 citations

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

arXiv:quant-ph/0701004•Dec 31, 2006•206 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

Quantum Computational Riemannian and Sub-Riemannian Geodesics

Kosuke Shizume, Takao Nakajima, Ryo Nakayama +1 more

Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.

Progress of Theoretical Physics•Jun 1, 2012•9 citations

Geometric Models for Quantum Statistical Inference

Dorje C. Brody, Lane P. Hughston

Abstract Our purpose here is to draw attention to an interesting relationship that can be shown to hold between (a) information geometry, and (b) quantum geometry. By ‘information geometry’, we mean the natural geometry associated with families of probability distributions. This is a subject that goes back more than half a century to the pioneering work of Rao (1945), who showed that the Fisher information matrix associated with a parametrised family of probability dis tributions gives rise to a natural Riemannian metric on the parameter space. This then allows one to speak in a precise way of the ‘distance’ between two probability distributions, an idea that turns out to be useful in problems of statistical inference. An extensive literature has thus developed, following this line of enquiry, on applications of differential geometry to statistics (see, e.g., Amari (1985), Barndorff-Nielsen et al. (1986), Murray and Rice (1993)). By ‘quantum geometry’, on the other hand, we mean the geometry of the manifold of states associated with a given quantum mechanical system. In particular, we consider the manifold of ‘pure’ states associated with a given complex Hilbert space. This is the space of ‘rays’ through the origin in the Hilbert space, which has the structure of a complex projective space. It is known that the usual rules of quantum mechanics allow one to construct a natural metric on this space, namely the Fubini-Study metric, the specification of which is equivalent to all the familiar structure associated with ordinary quantum mechanics.

Oxford University Press eBooks•Apr 30, 1998•5 citations
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.
geodesic in (2 n+1 -1)-dimensional sphere.Further, the reduced search sequence is given rise to the complex projective space CP 2 n -1 through a geometric reduction, which is also shown to be on a geodesic in CP 2 n -1 .Roughly speaking, the reduction in [15] is made through the phase-factor elimination from quantum states, so that CP 2 n -1 is thought of as the space of rays.Note that the geodesics above are associated with the standard metric on (2 n+1 -1)-dimensional sphere and with the Fubini-Study metric on CP 2 n -1 , respectively.The Fubini-Study metric on CP 2 n -1 is utilized also in [15] to measure the minimum distance from each state involved in the search sequence to the submanifold consisting of non-entangled states, which characterizes the entanglement of the states along the search.As expected benefits of geometric and dynamical views on quantum algorithmic studies like [15], the following would be worth listed;1 By revealing underlying geometry of quantum algorithms (not necessarily universal), numbers of results in geometry are expected to be applied to make advances in quantum computation and information.2 On looked upon the iterations made in algorithms as (discrete) time-evolutions of states, numbers of results in dynamical systems are expected to be applied to make advances in quantum computation and information.3 In view of a close connection between geometry and dynamical systems, geometric and dynamical-systems studies on quantum algorithms may provide interesting examples of dynamical systems.It would be worth noting here that there exists another approach to quantum searches using adiabatic evolution [16][17][18].That approach, however, is outside the scope of this chapter since the search dealt with in this chapter is organized on the so-called amplitude magnification technique [8] which differs from the adiabatic evolution.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
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.
Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.
Abstract Our purpose here is to draw attention to an interesting relationship that can be shown to hold between (a) information geometry, and (b) quantum geometry. By ‘information geometry’, we mean the natural geometry associated with families of probability distributions. This is a subject that goes back more than half a century to the pioneering work of Rao (1945), who showed that the Fisher information matrix associated with a parametrised family of probability dis tributions gives rise to a natural Riemannian metric on the parameter space. This then allows one to speak in a precise way of the ‘distance’ between two probability distributions, an idea that turns out to be useful in problems of statistical inference. An extensive literature has thus developed, following this line of enquiry, on applications of differential geometry to statistics (see, e.g., Amari (1985), Barndorff-Nielsen et al. (1986), Murray and Rice (1993)). By ‘quantum geometry’, on the other hand, we mean the geometry of the manifold of states associated with a given quantum mechanical system. In particular, we consider the manifold of ‘pure’ states associated with a given complex Hilbert space. This is the space of ‘rays’ through the origin in the Hilbert space, which has the structure of a complex projective space. It is known that the usual rules of quantum mechanics allow one to construct a natural metric on this space, namely the Fubini-Study metric, the specification of which is equivalent to all the familiar structure associated with ordinary quantum mechanics.