• Login
    View Item 
    •   DSpace Home
    • SUNY Polytechnic Institute
    • SUNY Polytechnic Institute Faculty and Staff Research, Publications, and Creative Works
    • View Item
    •   DSpace Home
    • SUNY Polytechnic Institute
    • SUNY Polytechnic Institute Faculty and Staff Research, Publications, and Creative Works
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartment

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Geometric algebra and information geometry for quantum computational software

    Thumbnail
    View/Open
    Geometric Algebra and Information Geometry for Quantum Com_Final.pdf (656.4Kb)
    Date
    2017-03-15
    Author
    Cafaro, Carlo
    Publisher
    Physica A: Statistical Mechanics and its Applications
    Metadata
    Show full item record
    Subject
    geometric Clifford algebras
    probability theory
    quantum algorithms
    quantum mechanics
    Riemannian geometry
    information geometry
    Walsh–Hadamard operation
    Abstract
    The art of quantum algorithm design is highly nontrivial. Grover’s search algorithm constitutes a masterpiece of quantum computational software. In this article, we use methods of geometric algebra (GA) and information geometry (IG) to enhance the algebraic efficiency and the geometrical significance of the digital and analog representations of Grover’s algorithm, respectively. Specifically, GA is used to describe the Grover iterate and the discretized iterative procedure that exploits quantum interference to amplify the probability amplitude of the target-state before measuring the query register. The transition from digital to analog descriptions occurs via Stone’s theorem which relates the (unitary) Grover iterate to a suitable (Hermitian) Hamiltonian that controls Schrodinger’s quantum mechanical evolution of a quantum state towards the target state. Once the discrete-to-continuos transition is completed, IG is used to interpret Grover’s iterative procedure as a geodesic path on the manifold of the parametric density operators of pure quantum states constructed from the continuous approximation of the parametric quantum output state in Grover’s algorithm. Finally, we discuss the dissipationless nature of quantum computing, recover the quadratic speedup relation, and identify the superfluity of the Walsh–Hadamard operation from an IG perspective with emphasis on statistical mechanical considerations.
    URI
    http://hdl.handle.net/1951/69145
    Collections
    • SUNY Polytechnic Institute Faculty and Staff Research, Publications, and Creative Works [63]

    SUNY Digital Repository Support
    DSpace software copyright © 2002-2023  DuraSpace
    Contact Us
    DSpace Express is a service operated by 
    Atmire NV
     

     


    SUNY Digital Repository Support
    DSpace software copyright © 2002-2023  DuraSpace
    Contact Us
    DSpace Express is a service operated by 
    Atmire NV