Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover, Terry Rudolph

TL;DR
This paper presents a straightforward method for creating quantum superpositions that approximate efficiently integrable probability distributions, enabling more effective quantum sampling and analysis.
Contribution
It introduces a simple, efficient process for generating quantum superpositions that approximate a wide class of probability distributions, including log-concave ones.
Findings
Enables quantum approximation of efficiently integrable distributions
Provides a practical method for quantum sampling tasks
Improves efficiency over previous approaches
Abstract
We give a simple and efficient process for generating a quantum superposition of states which form a discrete approximation of any efficiently integrable (such as log concave) probability density functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
