Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Instrumentation and Measurement

Physically Constrained Bayesian Optimization for Quantum Ranging Under Complex Environments

Yue Wang, Tianqi Mao, Xiao Liang, Guangxiao Hu, Minze Chen, Zhongxiang Li, Dezhi Zheng

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Entangled photon ranging has the potential to surpass the classical precision limit, providing a key way for next-generation high-precision positioning and navigation systems. However, free-space photon transmission suffers from atmospheric turbulence and background noise, yielding a multimodal and nonconvex coincidence curve. Traditional methods relying on local peaks and fixed-shape assumptions easily fall into false peaks, leading to unstable time-delay estimations. Conventional global optimization algorithms ignore the physical traits of the coincidence peaks. They still suffer from slow convergence or misjudgments in noisy environments. To address this, we propose a robust quantum ranging method based on physically constrained Bayesian optimization (PCBO). By building a scoring function embedded with physical priors, this method effectively suppresses false peaks and optimizes global search efficiency, approaching the true delay within limited evaluations. In a 10-m free-space simulation, PCBO achieved a 96.0 % convergence rate under severe interference. For the successfully converged trials, the mean-absolute error (MAE) was as low as 3.34 mm, with the 90 % confidence interval bounded within 8.52 mm. Under identical conditions, PCBO outperforms traditional Bayesian optimization (BO) and particle swarm optimization (PSO) in both convergence speed and robustness. Ultimately, it provides an effective solution for high-precision quantum ranging in complex environments.

DOI
10.1109/tim.2026.3723498

Related papers

Quantum-Inspired Bayesian Optimization with Entangled Search Spaces

Jincheng Zhang

Bayesian Optimization (BO) is a powerful technique for optimizing black-box functions, particularly effective in scenarios with expensive evaluations. However, its performance often degrades significantly in high-dimensional search spaces, a phenomenon known as the "curse of dimensionality." This paper introduces a novel Bayesian Optimization framework termed Quantum-Inspired Bayesian Optimization (QIBO) that addresses this limitation by leveraging concepts from quantum mechanics, specifically entanglement, to structure the search space. QIBO models the search space as an entangled quantum system, where updates to individual parameters are constrained through Bell inequality-inspired mechanisms. This promotes correlated exploration and exploitation, leading to potentially faster convergence and improved performance compared to traditional BO. We formulate the optimization problem as a quantum state evolution governed by the Bell inequalities, and demonstrate its efficacy through theoretical analysis and conceptual examples, highlighting the potential for QIBO to overcome the challenges posed by high-dimensional search spaces. The key contribution lies in the strategic introduction of entanglement to guide the search process, moving beyond purely independent updates often found in standard BO.

•Sep 5, 2026•0 citations

Quantum-Inspired Bayesian Optimization via Entangled Variables

Jincheng Zhang

Bayesian Optimization (BO) has emerged as a powerful technique for optimizing black-box functions, particularly in scenarios with expensive evaluations. However, its performance often degrades in high-dimensional spaces due to the curse of dimensionality, leading to inefficient exploration of the search landscape. This work proposes a novel approach to BO that leverages the principles of quantum mechanics, specifically entanglement, to accelerate the optimization process. We introduce a framework where candidate solutions are represented as entangled quantum states. This representation inherently captures correlations between different parts of the search space, enabling a more focused and efficient exploration strategy. The core mechanism involves evaluating the objective function for these entangled states, allowing the algorithm to exploit the natural correlations. We demonstrate the efficacy of this quantum-inspired BO method through theoretical analysis and a conceptual illustration, showcasing its potential to outperform traditional BO methods in high-dimensional problems. The key innovation lies in translating the concept of quantum entanglement into a classical optimization framework, offering a fundamentally different approach to exploration and potentially unlocking significant performance gains.

•Sep 1, 2026•0 citations

A Robust Adaptive High-Precision Entangled Photons-Based Ranging System

Wei He, Yong Wang, Mu Zhou +3 more

Recently, ranging has played an increasingly important role in many scenarios, but the problems of limited security and accuracy have always been troubling. The entanglement ranging method provides picosecond-level clock synchronization and unconditional security and is deemed a good solution to meet the growing demand for accuracy and security, promising to play a significant role in the next generation of navigation. This paper focuses on the ranging system based on entangled photons, and proposes solutions to the challenges of accuracy and robustness. Specifically, a coincidence counting calibration algorithm is proposed to suppress the background noise, and a novel data selection algorithm based on relative quantum efficiency is proposed to suppress abnormal coincidence counting. Then, to improve the ranging accuracy even in challenging scenarios, the paper proposed a novel density-based hierarchical filtering algorithm to detect and filter outliers, resulting in more precise and reliable ranging. Finally, extensive experiments are carried out on the built test platform to verify the safety and effectiveness of the proposed system. The results show that the ranging error is 0.0225 m in the test time of 1 ns. The proposed algorithm reduced the ranging error of abnormal data from 1.5205 m to 0.0100 m, and achieved the probability (90%) of ranging error within 0.0150 m.

IEEE Transactions on Cognitive Communications and Networking•Apr 30, 2024•3 citations

Quantum-Inspired Bayesian Optimization with Adaptive Entanglement

Jincheng Zhang

Bayesian Optimization (BO) has emerged as a powerful technique for optimizing black-box functions, particularly in scenarios where evaluations are expensive. However, traditional BO often suffers from inefficient exploration due to the reliance on a fixed, uniform prior distribution. This paper proposes a novel Bayesian Optimization framework, termed Quantum-Inspired Bayesian Optimization with Adaptive Entanglement (QIBOA), which draws inspiration from quantum mechanics, specifically the concept of adaptive entanglement, to dynamically adjust the prior distribution. The core idea is to represent the prior distribution using entangled states, where the entanglement strength is adaptively modified based on the observed function values. Higher entanglement indicates greater uncertainty and encourages exploration, while lower entanglement signifies higher confidence and promotes exploitation. The adaptive nature of this entanglement allows QIBOA to effectively balance exploration and exploitation, leading to improved optimization performance. We demonstrate the effectiveness of QIBOA through theoretical analysis and illustrate its advantages with simulations against established BO algorithms. The key contributions of this work include a new exploration strategy rooted in quantum-inspired concepts and a framework for dynamically adapting the prior distribution in Bayesian Optimization.

•Aug 31, 2026•0 citations

Quantum-Inspired Bayesian Optimization with Amplitude Amplification

Jincheng Zhang

Bayesian Optimization (BO) is a powerful technique for optimizing black-box functions, frequently employed in areas such as machine learning hyperparameter tuning and experimental design. However, its performance can degrade significantly in high-dimensional spaces, leading to slow convergence and increased computational cost. This paper introduces a novel approach to Bayesian Optimization inspired by quantum amplitude amplification, a technique rooted in quantum computing. Our method utilizes a probabilistic representation of candidate solutions within a Hilbert space, employing amplitude amplification to systematically bias the search towards promising regions of the solution space. This approach aims to accelerate the optimization process, particularly in scenarios where traditional BO methods struggle due to the curse of dimensionality. The core claim of this work is to demonstrate a speedup in convergence compared to standard BO algorithms, leveraging the principles of amplitude amplification for enhanced exploration and exploitation. The theoretical framework is presented, alongside a detailed explanation of the algorithm's components, and the results are discussed, highlighting the potential for improved efficiency in complex optimization problems. We focus on the core mechanics of using amplitude amplification to enhance the probability of finding optimal solutions.

•Sep 4, 2026•0 citations

Bayesian Constraint Optimization for Quantum Complexity

Jincheng Zhang

Quantum complexity is a critical challenge in the development of quantum algorithms, demanding precise control over quantum states and minimizing the inherent uncertainty. Traditional optimization approaches often fail to effectively address this challenge, requiring extensive trial and error. This paper proposes a novel Bayesian Constraint Optimization (BCO) framework to address this limitation by incorporating a dynamic Bayesian network (DBN) that continuously evolves the optimization model based on observed error signals. The BDM allows for a more adaptive and robust algorithm design, potentially leading to significant improvements in quantum algorithm performance. We demonstrate the efficacy of this approach through a series of simulations exploring the design of various quantum circuits and demonstrating its ability to outperform existing static optimization techniques. This work represents a significant advancement in quantum algorithm design, moving beyond traditional methods and embracing a data-driven, Bayesian perspective.

•Sep 3, 2026•0 citations
Entangled photon ranging has the potential to surpass the classical precision limit, providing a key way for next-generation high-precision positioning and navigation systems. However, free-space photon transmission suffers from atmospheric turbulence and background noise, yielding a multimodal and nonconvex coincidence curve. Traditional methods relying on local peaks and fixed-shape assumptions easily fall into false peaks, leading to unstable time-delay estimations. Conventional global optimization algorithms ignore the physical traits of the coincidence peaks. They still suffer from slow convergence or misjudgments in noisy environments. To address this, we propose a robust quantum ranging method based on physically constrained Bayesian optimization (PCBO). By building a scoring function embedded with physical priors, this method effectively suppresses false peaks and optimizes global search efficiency, approaching the true delay within limited evaluations. In a 10-m free-space simulation, PCBO achieved a 96.0 % convergence rate under severe interference. For the successfully converged trials, the mean-absolute error (MAE) was as low as 3.34 mm, with the 90 % confidence interval bounded within 8.52 mm. Under identical conditions, PCBO outperforms traditional Bayesian optimization (BO) and particle swarm optimization (PSO) in both convergence speed and robustness. Ultimately, it provides an effective solution for high-precision quantum ranging in complex environments.
Bayesian Optimization (BO) is a powerful technique for optimizing black-box functions, particularly effective in scenarios with expensive evaluations. However, its performance often degrades significantly in high-dimensional search spaces, a phenomenon known as the "curse of dimensionality." This paper introduces a novel Bayesian Optimization framework termed Quantum-Inspired Bayesian Optimization (QIBO) that addresses this limitation by leveraging concepts from quantum mechanics, specifically entanglement, to structure the search space. QIBO models the search space as an entangled quantum system, where updates to individual parameters are constrained through Bell inequality-inspired mechanisms. This promotes correlated exploration and exploitation, leading to potentially faster convergence and improved performance compared to traditional BO. We formulate the optimization problem as a quantum state evolution governed by the Bell inequalities, and demonstrate its efficacy through theoretical analysis and conceptual examples, highlighting the potential for QIBO to overcome the challenges posed by high-dimensional search spaces. The key contribution lies in the strategic introduction of entanglement to guide the search process, moving beyond purely independent updates often found in standard BO.
Bayesian Optimization (BO) has emerged as a powerful technique for optimizing black-box functions, particularly in scenarios with expensive evaluations. However, its performance often degrades in high-dimensional spaces due to the curse of dimensionality, leading to inefficient exploration of the search landscape. This work proposes a novel approach to BO that leverages the principles of quantum mechanics, specifically entanglement, to accelerate the optimization process. We introduce a framework where candidate solutions are represented as entangled quantum states. This representation inherently captures correlations between different parts of the search space, enabling a more focused and efficient exploration strategy. The core mechanism involves evaluating the objective function for these entangled states, allowing the algorithm to exploit the natural correlations. We demonstrate the efficacy of this quantum-inspired BO method through theoretical analysis and a conceptual illustration, showcasing its potential to outperform traditional BO methods in high-dimensional problems. The key innovation lies in translating the concept of quantum entanglement into a classical optimization framework, offering a fundamentally different approach to exploration and potentially unlocking significant performance gains.
Recently, ranging has played an increasingly important role in many scenarios, but the problems of limited security and accuracy have always been troubling. The entanglement ranging method provides picosecond-level clock synchronization and unconditional security and is deemed a good solution to meet the growing demand for accuracy and security, promising to play a significant role in the next generation of navigation. This paper focuses on the ranging system based on entangled photons, and proposes solutions to the challenges of accuracy and robustness. Specifically, a coincidence counting calibration algorithm is proposed to suppress the background noise, and a novel data selection algorithm based on relative quantum efficiency is proposed to suppress abnormal coincidence counting. Then, to improve the ranging accuracy even in challenging scenarios, the paper proposed a novel density-based hierarchical filtering algorithm to detect and filter outliers, resulting in more precise and reliable ranging. Finally, extensive experiments are carried out on the built test platform to verify the safety and effectiveness of the proposed system. The results show that the ranging error is 0.0225 m in the test time of 1 ns. The proposed algorithm reduced the ranging error of abnormal data from 1.5205 m to 0.0100 m, and achieved the probability (90%) of ranging error within 0.0150 m.
Bayesian Optimization (BO) has emerged as a powerful technique for optimizing black-box functions, particularly in scenarios where evaluations are expensive. However, traditional BO often suffers from inefficient exploration due to the reliance on a fixed, uniform prior distribution. This paper proposes a novel Bayesian Optimization framework, termed Quantum-Inspired Bayesian Optimization with Adaptive Entanglement (QIBOA), which draws inspiration from quantum mechanics, specifically the concept of adaptive entanglement, to dynamically adjust the prior distribution. The core idea is to represent the prior distribution using entangled states, where the entanglement strength is adaptively modified based on the observed function values. Higher entanglement indicates greater uncertainty and encourages exploration, while lower entanglement signifies higher confidence and promotes exploitation. The adaptive nature of this entanglement allows QIBOA to effectively balance exploration and exploitation, leading to improved optimization performance. We demonstrate the effectiveness of QIBOA through theoretical analysis and illustrate its advantages with simulations against established BO algorithms. The key contributions of this work include a new exploration strategy rooted in quantum-inspired concepts and a framework for dynamically adapting the prior distribution in Bayesian Optimization.
Bayesian Optimization (BO) is a powerful technique for optimizing black-box functions, frequently employed in areas such as machine learning hyperparameter tuning and experimental design. However, its performance can degrade significantly in high-dimensional spaces, leading to slow convergence and increased computational cost. This paper introduces a novel approach to Bayesian Optimization inspired by quantum amplitude amplification, a technique rooted in quantum computing. Our method utilizes a probabilistic representation of candidate solutions within a Hilbert space, employing amplitude amplification to systematically bias the search towards promising regions of the solution space. This approach aims to accelerate the optimization process, particularly in scenarios where traditional BO methods struggle due to the curse of dimensionality. The core claim of this work is to demonstrate a speedup in convergence compared to standard BO algorithms, leveraging the principles of amplitude amplification for enhanced exploration and exploitation. The theoretical framework is presented, alongside a detailed explanation of the algorithm's components, and the results are discussed, highlighting the potential for improved efficiency in complex optimization problems. We focus on the core mechanics of using amplitude amplification to enhance the probability of finding optimal solutions.
Quantum complexity is a critical challenge in the development of quantum algorithms, demanding precise control over quantum states and minimizing the inherent uncertainty. Traditional optimization approaches often fail to effectively address this challenge, requiring extensive trial and error. This paper proposes a novel Bayesian Constraint Optimization (BCO) framework to address this limitation by incorporating a dynamic Bayesian network (DBN) that continuously evolves the optimization model based on observed error signals. The BDM allows for a more adaptive and robust algorithm design, potentially leading to significant improvements in quantum algorithm performance. We demonstrate the efficacy of this approach through a series of simulations exploring the design of various quantum circuits and demonstrating its ability to outperform existing static optimization techniques. This work represents a significant advancement in quantum algorithm design, moving beyond traditional methods and embracing a data-driven, Bayesian perspective.