Loading Probability Distributions in a Quantum circuit
-
Updated
Oct 13, 2024 - Mathematica
Loading Probability Distributions in a Quantum circuit
Determines how long unknown phases must persist for quantum complement sampling to outperform ordinary samples, with matching copy bounds and explicit resource accounting.
Reproducible 2 × 4 Ising-ladder spectral validation for Ancilla-Efficient QSAMPLE Preparation (IEEE QCE 2026, QALG). Code, paper, CSV results and tests.
Linear sample complexity for erasing address labels from coherent injection examples, separating supplied quantum samples from reversible oracle access.
Coherent weighted spanning-tree preparation on irregular graphs, with clean reversible circuits and sharp fixed-gap query bounds in weight contrast.
Optimal query bounds for mean estimation from fresh quantum samplers under a local replay limit, with exact-inverse algorithms and adaptive lower bounds.
To associate your repository with the quantum-sampling topic, visit your repo's landing page and select "manage topics."