Theoretical analysis of a nearly optimal analog quantum search

Abstract

We analyze the possibility of modifying the original Farhi-Gutmann Hamiltonian algorithm in order to speed up the procedure for producing a suitably distributed unknown normalized quantum mechanical state. Such a modification is feasible provided only a nearly optimal fidelity is sought. We propose to select the lower bounds of the nearly optimal fidelity values such that their deviations from unit fidelity are less than the minimum error probability characterizing the optimum ambiguous discrimination scheme between the two nonorthogonal quantum states yielding the chosen nearly optimal fidelity values. Departing from the working assumptions of perfect state overlap and uniform distribution of the target state on the unit sphere in N-dimensional complex Hilbert space, we determine that the modified algorithm can indeed outperform the original analog counterpart of a quantum search algorithm. This performance enhancement occurs in terms of speed for a convenient choice of both the ratio E'/E between the energy eigenvalues E' and E of the modified search Hamiltonian and the quantum mechanical overlap x between the source and the target states. Finally, we briefly discuss possible analytical improvements of our investigation together with its potential relevance in practical quantum engineering applications.

arXiv comment26 pages, 5 figures, 1 table

References in corpus (21)

• Quantum Machine Learning
• Quantum Mechanics helps in searching for a needle in a haystack
• The maximum speed of dynamical evolution
• Quantum-enhanced machine learning
• Quantum State Discrimination
• Quantum limits to dynamical evolution
• The fundamental limit on the rate of quantum dynamics: the unified bound is tight
• Quantum information and precision measurement
• Imperfect measurements settings: implications on quantum state tomography and entanglement witnesses
• Exploring the trade-off between fidelity- and time-optimal control of quantum unitary transformations
• Adaptive quantum computation in changing environments using projective simulation
• Robust Measurement for the Discrimination of Binary Coherent States
• Approximate quantum error correction for generalized amplitude damping errors
• On Grover's Search Algorithm from a Quantum Information Geometry Viewpoint
• Geometric Algebra and Information Geometry for Quantum Computational Software
• Fixed-Point Adiabatic Quantum Search
• Generalized Quantum Search Hamiltonian
• Optimal cloning of qubits given by arbitrary axisymmetric distribution on Bloch sphere
• Quantum metrology at level anti-crossing
• Maximum Caliber Inference and the Stochastic Ising Model
• Transition probabilities and measurement statistics of postselected ensembles

Cited by in corpus (8)

• Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions
• Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions
• Qubit Geodesics on the Bloch Sphere from Optimal-Speed Hamiltonian Evolutions
• Geometric aspects of analog quantum search evolutions
• Complexity of Pure and Mixed Qubit Geodesic Paths on Curved Manifolds
• Transition Probabilities in Generalized Quantum Search Hamiltonian Evolutions
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution
• Optimal-speed unitary quantum time evolutions and propagation of light with maximal degree of coherence