Quantum Interference Proposal Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns as finite-shot proposal distributions for QUBO/Ising optimization. Candidate $n_b$ -bit strings are sampled from these distributions, scored classically and used to update an elite frontier of low-energy solutions. QIPS uses a fixed two-layer gate-based circuit architecture with 100 shots per circuit while the Hilbert-space dimension grows as $2^{n_b}$ . Across six benchmark families with $18 \le n_b \le 29$ , QIPS maintains competitive progress relative to a matched classical control that preserves the same search loop, frontier update rule and proposal budget, with total proposals proportional to $n_b$ . Performance is assessed using top- $K$ coverage, hit rate, multiplicity, Hilbert-space coverage and dyadic-rank metrics. The results identify localized quantum interference as a resource-efficient proposal mechanism for computational quantum optimization.Quantum Interference Proposal Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns as finite-shot proposal distributions for QUBO/Ising optimization. Candidate $n_b$-bit strings are sampled from these distributions, scored classically and used to update an elite frontier of low-energy solutions. QIPS uses a fixed two-layer gate-based circuit architecture with 100 shots per circuit while the Hilbert-space dimension grows as $2^{n_b}$. Across six benchmark families with $18 \le n_b \le 29$, QIPS maintains competitive progress relative to a matched classical control that preserves the same search loop, frontier update rule and proposal budget, with total proposals proportional to $n_b$. Performance is assessed using top-$K$ coverage, hit rate, multiplicity, Hilbert-space coverage and dyadic-rank metrics. The results identify localized quantum interference as a resource-efficient proposal mechanism for computational quantum optimization.

quant-pharXiv:2607.27509Jul 31, 20260 citations

QIPS: quantum information and quantum physics in space

T. Schmitt-Manderbach, Thomas Scheidl, Rupert Ursin +9 more

The aim of the QIPS project (financed by ESA) is to explore quantum phenomena and to demonstrate quantum communication over long distances. Based on the current state-of-the-art a first study investigating the feasibility of space based quantum communication has to establish goals for mid-term and long-term missions, but also has to test the feasibility of key issues in a long distance ground-to-ground experiment. We have therefore designed a proof-of-concept demonstration for establishing single photon links over a distance of 144 km between the Canary Islands of La Palma and Tenerife to evaluate main limitations for future space experiments. Here we report on the progress of this project and present first measurements of crucial parameters of the optical free space link.The aim of the QIPS project (financed by ESA) is to explore quantum phenomena and to demonstrate quantum communication over long distances. Based on the current state-of-the-art a first study investigating the feasibility of space based quantum communication has to establish goals for mid-term and long-term missions, but also has to test the feasibility of key issues in a long distance ground-to-ground experiment. We have therefore designed a proof-of-concept demonstration for establishing single photon links over a distance of 144 km between the Canary Islands of La Palma and Tenerife to evaluate main limitations for future space experiments. Here we report on the progress of this project and present first measurements of crucial parameters of the optical free space link.

International Conference on Space Optics (ICSO)Nov 21, 20170 citations

Quantum-Enhanced Generalized Pattern Search Optimization

Colton Mikes, David H. Gutman, Victoria E. Howle

While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from O(N) to O(N) However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the O(N) oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only O(N) oracle calls.While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from O(N) to O(N) However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the O(N) oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only O(N) oracle calls.

Quantum ReportsSep 29, 20241 citation

n_b

-bit strings are sampled from these distributions, scored classically and used to update an elite frontier of low-energy solutions. QIPS uses a fixed two-layer gate-based circuit architecture with 100 shots per circuit while the Hilbert-space dimension grows as

2^{n_b}

. Across six benchmark families with

18 \le n_b \le 29

, QIPS maintains competitive progress relative to a matched classical control that preserves the same search loop, frontier update rule and proposal budget, with total proposals proportional to

n_b

. Performance is assessed using top-

K

coverage, hit rate, multiplicity, Hilbert-space coverage and dyadic-rank metrics. The results identify localized quantum interference as a resource-efficient proposal mechanism for computational quantum optimization.