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

arXiv:quant-ph/0409033 · International Journal of Quantum Information

QUANTUM COMPUTATION BASED PROBABILITY DENSITY FUNCTION ESTIMATION

Ferenc Balázs, Sándor Imre

Published Dec 16, 2004• 0 citations
arXivHTMLPDF

Abstract

Signal processing techniques will lean on blind methods in the near future, where no redundant, resource allocating information will be transmitted through the channel. To achieve a proper decision, however, it is essential to know at least the probability density function (PDF), which to estimate is classically a time consumpting and/or less accurate hard task that may make decisions to fail. This paper describes the design of a quantum assisted PDF estimation method also by way of an example, which promises to achieve the exact PDF by proper setting of parameters in a very rapid way.

DOI
10.1142/s0219749905000578

Related papers

PROBABILITY DENSITY FUNCTION CONTROL OF QUANTUM SYSTEMS

Yifan Xing, Jun Yong Wu

This paper proposes a new method of controlling quantum systems via probability density function (PDF) control. Based on the quantum model from the PDF perspective, two specific control algorithms are proposed for the general case and limited input energy, respectively. Unlike traditional quantum control methods, this method directly controls the probability distribution of the quantum state. It provides an alternative method for quantum control engineering.

International Journal of Modern Physics B•Jun 9, 2011•2 citations

Quantum-Based Probability Density Estimation

Jincheng Zhang

This paper explores the potential of quantum computing for probability density estimation (PDE), a crucial component of many machine learning algorithms. Traditional PDE methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially inaccurate estimates. We propose a novel approach leveraging quantum circuits to perform PDE, capitalizing on quantum phenomena like superposition and entanglement to accelerate and potentially enhance the estimation process. Specifically, we outline a quantum algorithm designed to approximate probability density functions (PDFs) directly from data samples. The core of our approach involves encoding data into a quantum state and utilizing quantum gates to perform calculations related to the PDF. Furthermore, we address the challenges of noise inherent in quantum systems through the integration of quantum error correction techniques. This work lays the theoretical groundwork for a quantum-enhanced PDE method, demonstrating the feasibility of significantly improving estimation speed and accuracy for complex datasets. We focus on the conceptual design and potential benefits of this approach, without performing actual experimental validation.

•Aug 31, 2026•0 citations

Turbulent Mixing Simulation via a Quantum Algorithm

Guanglei Xu, Andrew J. Daley, Peyman Givi +1 more

Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this work, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. The results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.

AIAA Journal•Dec 5, 2017•44 citations

Title: Adaptive Quantum Sampling for Probability Density Estimation

Jincheng Zhang

This paper explores the application of adaptive quantum sampling to probability density estimation, a critical task in various fields including physics, chemistry, and finance. Classical methods struggle with high-dimensional probability distributions, often requiring computationally intensive sampling techniques. We introduce a novel quantum algorithm that dynamically adjusts its sampling strategy based on observed data, significantly enhancing the accuracy of probability density estimation compared to traditional methods. The core mechanism leverages quantum circuits to implement a probabilistic sampling process, ensuring a more robust and efficient estimation of distributions. We detail the algorithm's architecture, key quantum operations, and demonstrate its effectiveness through simulations and illustrative examples. The resulting quantum algorithm holds the potential to unlock deeper insights into complex probability distributions, offering a significant advancement in statistical analysis.

•Sep 1, 2026•0 citations

Quantum-Enhanced Probability Density Estimation for Complex Systems

Jincheng Zhang

This paper investigates the application of quantum entanglement to improve the estimation of probability density within complex systems. The core claim posits the design of a quantum algorithm, termed "Quantum Entangled Probability," that leverages entanglement to accelerate and enhance predictive modeling capabilities. Current probabilistic methods face significant computational challenges, particularly when dealing with intricate systems exhibiting high dimensionality and complex dependencies. Quantum computing, through its unique properties of superposition and entanglement, offers the potential to overcome these limitations, providing a pathway to more accurate and efficient predictions. This research explores the theoretical foundations and practical implementation of this novel approach, focusing on its potential impact on diverse fields requiring precise probabilistic modeling. The paper details the Quantum Entangled Probability algorithm, its underlying principles, and preliminary experimental results demonstrating its efficacy in a simulated environment.

•Sep 4, 2026•0 citations

AmbShield: Enhancing Physical Layer Security With Ambient Backscatter Devices Against Eavesdroppers

Yifan Zhang, Yishan Yang, Masoud Kaveh +4 more

Passive eavesdropping compromises confidentiality in wireless networks, especially in resource-constrained environments where heavyweight cryptography is impractical. Physical layer security (PLS) exploits channel randomness and spatial selectivity to confine information to an intended receiver with modest overhead. However, typical PLS techniques, such as using beamforming, artificial noise, and reconfigurable intelligent surfaces, often involve added active power or specialized deployment, and, in many designs, rely on precise time synchronization and perfect CSI estimation, which limits their practicality. To this end, we propose AmbShield, an AmBD-assisted PLS scheme that leverages naturally distributed AmBDs to simultaneously strengthen the legitimate channel and degrade eavesdroppers' without requiring extra transmit power and with minimal deployment overhead. In AmbShield, AmBDs are exploited as friendly jammers that randomly backscatter to create interference at eavesdroppers, and as passive relays that backscatter the desired signal to enhance the capacity of legitimate devices. We further develop a unified analytical framework that analyzes the exact probability density function (PDF) and cumulative distribution function (CDF) of legitimate and eavesdropper signal-to-interference-noise ratio (SINR), and a closed-form secrecy outage probability (SOP). The analysis provides clear design guidelines on various practical system parameters to minimize SOP. Extensive experiments that include Monte Carlo simulations, theoretical derivations, and high-SNR asymptotic analysis demonstrate the security gains of AmbShield across diverse system parameters under imperfect synchronization and CSI estimation.

arXiv:2601.09867•IEEE Transactions on Information Forensics and Security•Jan 1, 2026•2 citations
Signal processing techniques will lean on blind methods in the near future, where no redundant, resource allocating information will be transmitted through the channel. To achieve a proper decision, however, it is essential to know at least the probability density function (PDF), which to estimate is classically a time consumpting and/or less accurate hard task that may make decisions to fail. This paper describes the design of a quantum assisted PDF estimation method also by way of an example, which promises to achieve the exact PDF by proper setting of parameters in a very rapid way.
This paper explores the potential of quantum computing for probability density estimation (PDE), a crucial component of many machine learning algorithms. Traditional PDE methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially inaccurate estimates. We propose a novel approach leveraging quantum circuits to perform PDE, capitalizing on quantum phenomena like superposition and entanglement to accelerate and potentially enhance the estimation process. Specifically, we outline a quantum algorithm designed to approximate probability density functions (PDFs) directly from data samples. The core of our approach involves encoding data into a quantum state and utilizing quantum gates to perform calculations related to the PDF. Furthermore, we address the challenges of noise inherent in quantum systems through the integration of quantum error correction techniques. This work lays the theoretical groundwork for a quantum-enhanced PDE method, demonstrating the feasibility of significantly improving estimation speed and accuracy for complex datasets. We focus on the conceptual design and potential benefits of this approach, without performing actual experimental validation.
Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this work, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. The results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.
This paper explores the application of adaptive quantum sampling to probability density estimation, a critical task in various fields including physics, chemistry, and finance. Classical methods struggle with high-dimensional probability distributions, often requiring computationally intensive sampling techniques. We introduce a novel quantum algorithm that dynamically adjusts its sampling strategy based on observed data, significantly enhancing the accuracy of probability density estimation compared to traditional methods. The core mechanism leverages quantum circuits to implement a probabilistic sampling process, ensuring a more robust and efficient estimation of distributions. We detail the algorithm's architecture, key quantum operations, and demonstrate its effectiveness through simulations and illustrative examples. The resulting quantum algorithm holds the potential to unlock deeper insights into complex probability distributions, offering a significant advancement in statistical analysis.
This paper investigates the application of quantum entanglement to improve the estimation of probability density within complex systems. The core claim posits the design of a quantum algorithm, termed "Quantum Entangled Probability," that leverages entanglement to accelerate and enhance predictive modeling capabilities. Current probabilistic methods face significant computational challenges, particularly when dealing with intricate systems exhibiting high dimensionality and complex dependencies. Quantum computing, through its unique properties of superposition and entanglement, offers the potential to overcome these limitations, providing a pathway to more accurate and efficient predictions. This research explores the theoretical foundations and practical implementation of this novel approach, focusing on its potential impact on diverse fields requiring precise probabilistic modeling. The paper details the Quantum Entangled Probability algorithm, its underlying principles, and preliminary experimental results demonstrating its efficacy in a simulated environment.
Passive eavesdropping compromises confidentiality in wireless networks, especially in resource-constrained environments where heavyweight cryptography is impractical. Physical layer security (PLS) exploits channel randomness and spatial selectivity to confine information to an intended receiver with modest overhead. However, typical PLS techniques, such as using beamforming, artificial noise, and reconfigurable intelligent surfaces, often involve added active power or specialized deployment, and, in many designs, rely on precise time synchronization and perfect CSI estimation, which limits their practicality. To this end, we propose AmbShield, an AmBD-assisted PLS scheme that leverages naturally distributed AmBDs to simultaneously strengthen the legitimate channel and degrade eavesdroppers' without requiring extra transmit power and with minimal deployment overhead. In AmbShield, AmBDs are exploited as friendly jammers that randomly backscatter to create interference at eavesdroppers, and as passive relays that backscatter the desired signal to enhance the capacity of legitimate devices. We further develop a unified analytical framework that analyzes the exact probability density function (PDF) and cumulative distribution function (CDF) of legitimate and eavesdropper signal-to-interference-noise ratio (SINR), and a closed-form secrecy outage probability (SOP). The analysis provides clear design guidelines on various practical system parameters to minimize SOP. Extensive experiments that include Monte Carlo simulations, theoretical derivations, and high-SNR asymptotic analysis demonstrate the security gains of AmbShield across diverse system parameters under imperfect synchronization and CSI estimation.