Efficient Cauchy Distribution Based Quantum State Preparation by Using the Comparison Algorithm
Overview
The quantum Monte Carlo algorithm can provide significant speedup as compared to its classical counterpart. So far, most reported works utilize Grover’s state preparation algorithm. However, this algorithm relies on costly controlled Yrotations to apply the correct amplitudes onto the superposition states. Recently, a comparison-based state preparation method was proposed to reduce computational complexity by avoiding rotation operations. One critical aspect of this method is the generation of the comparison threshold associated with the amplitude of the quantum superposition states. The direct computation of the comparison threshold is often very costly. An alternative is to estimate the threshold with a Taylor approximation. However, Taylor approximations do not work well with heavy-tailed distribution functions like the Cauchy distribution which is widely used in applications such as financial modeling. Therefore, a new state preparation method needs to be developed. In this study, an efficient comparison-based state preparation method is proposed for the heavy-tailed Cauchy distribution. Instead of a single Taylor approximation for the entire function domain, this study uses quantum piecewise arithmetic to increase accuracy and reduce computational cost. The proposed piecewise function is in the simplest form to estimate the comparison threshold associated with the amplitudes. Numerical analysis shows that the number of required subdomains increases linearly as the maximum tolerated approximation error decreases exponentially. 197 subdomains are required to keep the error below 1/8192 of the maximum amplitude. Quantum parallelism ensures that the computational complexity of estimating the amplitudes is independent from the number of subdomains.
Competition history
- JSHS 2022
Resources
Related projects
ISEF · 2019
Improved Gate Level Simulation of Quantum Circuits
ISEF · 2018
Utilizing Machine Learning to Generate Efficient Quantum Algorithms
ISEF · 2026
Adaptive Peierls Phase Modulation for Quantum State Routing in Multi-Photon Systems Under Decay and Disorder
ISEF · 2025
Breaking Barriers in Quantum Circuit Optimization With Efficient and Noise-Resilient Real-Time Adaptation
AJAS · 2026
Exploring the Quantum Approximate Optimization Algorithm and Its Generalizations
ISEF · 2022
Efficient Computation of Interference Between Pathways in Quantum Control Systems
CSEF · 2026
Adaptive Calibration Scheduling for Quantum Processors via Conservative Bandits
ISEF · 2022
The Application of Grover Quantum Algorithm in Lifting Stage Restoration Problem
Closest projects by meaning, across every fair and year in the corpus.