scholarly journals On Grover’s search algorithm from a quantum information geometry viewpoint

2012 ◽  
Vol 391 (4) ◽  
pp. 1610-1625 ◽  
Author(s):  
Carlo Cafaro ◽  
Stefano Mancini
Keyword(s):  
Quantum Information ◽  
Search Algorithm ◽  
Information Geometry ◽  
Grover’S Search Algorithm

scholarly journals Quantum Orlicz Spaces in Information Geometry

2004 ◽  
Vol 11 (04) ◽  
pp. 359-375 ◽  
Author(s):  
R. F. Streater
Keyword(s):  
Quantum Information ◽  
Tangent Space ◽  
Selfadjoint Operator ◽  
Affine Connection ◽  
Orlicz Spaces ◽  
Trace Class ◽  
Information Geometry ◽  
Young Function ◽  
Affine Structure ◽  
Cotangent Space

Let H0 be a selfadjoint operator such that Tr e−βH0 is of trace class for some β < 1, and let χɛ denote the set of ɛ-bounded forms, i.e., ∥(H0+C)−1/2−ɛX(H0+C)−1/2+ɛ∥ < C for some C > 0. Let χ := Span ∪ɛ∈(0,1/2]χɛ. Let [Formula: see text] denote the underlying set of the quantum information manifold of states of the form ρx = e−H0−X−ψx, X ∈ χ. We show that if Tr e−H0 = 1. 1. the map Φ, [Formula: see text] is a quantum Young function defined on χ 2. The Orlicz space defined by Φ is the tangent space of [Formula: see text] at ρ0; its affine structure is defined by the (+1)-connection of Amari 3. The subset of a ‘hood of ρ0, consisting of p-nearby states (those [Formula: see text] obeying C−1ρ1+p ≤ σ ≤ Cρ1 − p for some C > 1) admits a flat affine connection known as the (−1) connection, and the span of this set is part of the cotangent space of [Formula: see text] 4. These dual structures extend to the completions in the Luxemburg norms.

scholarly journals Quantifying computational advantage of Grover’s algorithm with the trace speed

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Valentin Gebhart ◽  
Luca Pezzè ◽  
Augusto Smerzi
Keyword(s):  
Quantum Coherence ◽  
Search Algorithm ◽  
Quantum Algorithms ◽  
Physical Origin ◽  
Computational Advantage ◽  
Speed Up ◽  
Quantum Speed Up ◽  
Quantum Statistical ◽  
Grover’S Search Algorithm ◽  
General Physical

AbstractDespite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover’s search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. For time-dependent partial depolarization and for interrupted Grover searches, the speed-up is specifically bounded by the maximal trace speed that occurs during the algorithm operations. Our results quantify the quantum speed-up with a physical resource that is experimentally measurable and related to multipartite entanglement and quantum coherence.

Sign in / Sign up

Export Citation Format

Share Document