Gaussian Amplitude Amplification for Quantum Pathfinding
arXiv:2112.08167 · doi:10.3390/e24070963
Abstract
We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding minimum or maximum solutions on a weighted directed graph. We focus on a geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by gaussian distributions. We then demonstrate how an oracle which encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases which are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.
References in corpus (29)
- A variational eigenvalue solver on a quantum processor
- Strengths and Weaknesses of Quantum Computing
- Quantum Amplitude Amplification and Estimation
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Tight bounds on quantum searching
- Spatial search by quantum walk
- Qudits and high-dimensional quantum computing
- Multi-valued Logic Gates for Quantum Computation
- Quantum Information Scrambling in a Superconducting Qutrit Processor
- Experimental high-dimensional quantum teleportation
- Quantum annealing of the Traveling Salesman Problem
- On Arbitrary Phases in Quantum Amplitude Amplification
- Phase matching in quantum searching
- Quantum search without entanglement
- Practical trapped-ion protocols for universal qudit-based quantum computing
- Asymptotic Improvements to Quantum Circuits via Qutrits
- Implementation of a Walsh-Hadamard gate in a superconducting qutrit
- Global Symmetry is Unnecessary for Fast Quantum Search
- Quantum gates on hybrid qudits
- Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm
- Quantum Phase Estimation with Time-Frequency Qudits in a Single Photon
- Geometry of Quantum Computation with Qutrits
- Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition
- Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs
- Qudit-Basis Universal Quantum Computation using Interactions
- Subdivided Phase Oracle for NISQ Search Algorithms
- Quantum heuristic algorithm for traveling salesman problem
- Quantum Amplitude Amplification Operators
- Amplitude Amplification for Optimization via Subdivided Phase Oracle