Fixed-point quantum continuous search algorithm with optimal query complexity
arXiv:2502.15556 · doi:10.1007/s11433-024-2629-1
Abstract
Continuous search problems (CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an uncountably infinite space, presenting unique computational challenges. In this work, we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges, achieving a quadratic speedup. Inspired by the discrete search results, we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs, demonstrating the optimality of our approach. In addition, we demonstrate how to design the internal structure of the quantum search oracle for specific problems. Furthermore, we develop a general framework to apply this algorithm to a range of problem types, including optimization and eigenvalue problems involving continuous variables.
13 pages, 4 figures
References in corpus (30)
- Quantum information with continuous variables
- Gaussian Quantum Information
- Quantum algorithm for solving linear systems of equations
- Detection of 15 dB Squeezed States of Light and their Application for the Absolute Calibration of Photoelectric Quantum Efficiency
- Universal Quantum Computation with Continuous-Variable Cluster States
- Continuous variable quantum information: Gaussian states and beyond
- Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform
- Continuous-variable quantum neural networks
- Quantum Computing with Continuous-Variable Clusters
- One-Way Quantum Computing in the Optical Frequency Comb
- Experimental Preparation of Quadripartite Cluster and GHZ Entangled States for Continuous Variables
- Fixed-point quantum search with an optimal number of queries
- Building Gaussian Cluster States by Linear Optics
- A different kind of quantum search
- Bosonic quantum error correction codes in superconducting quantum circuits
- Implementation of Grover's Quantum Search Algorithm in a Scalable System
- Quantum information processing with bosonic qubits in circuit QED
- Gate sequence for continuous variable one-way quantum computation
- Continuous variable quantum computation with spatial degrees of freedom of photons
- Heisenberg limited single-mode quantum metrology
- Demonstration of a Controlled-Phase Gate for Continuous-Variable One-Way Quantum Computation
- Scalable and Programmable Phononic Network with Trapped Ions
- Examples of Gaussian cluster computation
- Simple scheme for two-qubit Grover search in cavity QED
- Implementation of three-qubit Grover search in cavity QED
- Exact gate decompositions for photonic quantum computing
- All-optical quantum computing using cubic phase gates
- Simple implementation of a quantum search with trapped ions
- A Query-based Quantum Eigensolver
- Continuous optimization by quantum adaptive distribution search