Transition Probabilities in Generalized Quantum Search Hamiltonian Evolutions

Abstract

A relevant problem in quantum computing concerns how fast a source state can be driven into a target state according to Schrödinger's quantum mechanical evolution specified by a suitable driving Hamiltonian. In this paper, we study in detail the computational aspects necessary to calculate the transition probability from a source state to a target state in a continuous time quantum search problem defined by a multi-parameter generalized time-independent Hamiltonian. In particular, quantifying the performance of a quantum search in terms of speed (minimum search time) and fidelity (maximum success probability), we consider a variety of special cases that emerge from the generalized Hamiltonian. In the context of optimal quantum search, we find it is possible to outperform, in terms of minimum search time, the well-known Farhi-Gutmann analog quantum search algorithm. In the context of nearly optimal quantum search, instead, we show it is possible to identify sub-optimal search algorithms capable of outperforming optimal search algorithms if only a sufficiently high success probability is sought. Finally, we briefly discuss the relevance of a tradeoff between speed and fidelity with emphasis on issues of both theoretical and practical importance to quantum information processing.

arXiv comment17 pages, 6 figures, 3 tables. Online ready in Int. J. Geometric Methods in Modern Physics (2020)

References in corpus (21)

• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum Copying: Beyond the No-Cloning Theorem
• Quantum-enhanced machine learning
• Quantum State Discrimination
• Phase covariant quantum cloning
• Exploring the trade-off between fidelity- and time-optimal control of quantum unitary transformations
• Adaptive quantum computation in changing environments using projective simulation
• 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
• Cosmological dark energy effects from entanglement
• Generalized Quantum Search Hamiltonian
• The Chern-Simons current in systems of DNA-RNA transcriptions
• Maximum Caliber Inference and the Stochastic Ising Model
• Entangled states in quantum cosmology and the interpretation of Lambda
• Oscillating universes as eigensolutions of cosmological Schrödinger equation
• Dark energy from entanglement entropy
• The Chern-Simons Current in Time Series of Knots and Links in Proteins
• Theoretical analysis of a nearly optimal analog quantum search
• Entanglement inside the cosmological apparent horizon
• Transition probabilities and measurement statistics of postselected ensembles

Cited by in corpus (5)

• Qubit Geodesics on the Bloch Sphere from Optimal-Speed Hamiltonian Evolutions
• Geometric aspects of analog quantum search evolutions
• Information Geometric Aspects of Probability Paths with Minimum Entropy Production for Quantum State Evolution
• A Quantum Informational Approach to the Problem of Time
• Optimal-speed unitary quantum time evolutions and propagation of light with maximal degree of coherence