Related Concept Videos
Sampling Theorem
Sampling Methods: Overview
In analytical chemistry, the choice of...
Upsampling
Sampling Continuous Time Signal
In the...
Sampling Plans
Random sampling is a method where each member of the population has an equal chance of being selected for the sample. It involves selecting individuals randomly, often using random number generators or lottery-type methods. For example, when analyzing the properties of a...
Sampling Methods: Sample Types
Solid samples include a variety of substances, such as sediments from water bodies, soil, metals, and biological tissues. Two standard methods for extracting sediments from water bodies are grab sampling and piston coring. Grab sampling involves using a device to collect a discrete sediment sample from the bottom of a water body with minimal disturbance. Grab samples do not always represent the entire area due to...
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
Consistent inclusion of triple substitutions within a coupled cluster based static quantum embedding theory.
Independent association of leg-height ratio with 15 cardiometabolic diseases.
Related Experiment Video
Updated: Feb 22, 2026

Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Operator-level quantum acceleration of non-logconcave sampling.
Jiaqi Leng1,2, Zhiyan Ding2,3, Zherui Chen2
1Simons Institute for the Theory of Computing, University of California, Berkeley, CA 94720.
This study introduces a quantum algorithm to accelerate sampling from complex probability distributions, offering significant speedups for non-logconcave potentials where classical methods fail. It enables faster simulations in fields like physics and machine learning.
Area of Science:
- Quantum computing
- Computational physics
- Statistical mechanics
- Machine learning
Background:
- Sampling from probability distributions is crucial in various scientific domains.
- Classical methods like Langevin dynamics struggle with non-logconcave distributions, hindering performance.
- Complex energy landscapes pose significant challenges for accurate and efficient sampling.
Purpose of the Study:
- To develop a quantum algorithm for accelerating continuous-time sampling dynamics.
- To address the limitations of classical sampling methods in non-logconcave settings.
- To enable efficient sampling from complex, rugged energy landscapes.
Main Methods:
- Encoding the target Gibbs measure into quantum state amplitudes.
- Utilizing a block matrix factorization of the Witten Laplacian operator.
- Implementing Gibbs sampling via singular value thresholding.
- Developing a quantum algorithm for replica exchange Langevin diffusion.
Main Results:
- A provable acceleration for a broad class of continuous-time sampling dynamics.
- Up to a quartic quantum speedup over classical Langevin-based methods for non-logconcave distributions.
- The first quantum algorithm to accelerate replica exchange Langevin diffusion.
Conclusions:
- The developed quantum algorithm offers a significant advantage for sampling complex distributions.
- This work provides a powerful new tool for simulating systems in physics, chemistry, and beyond.
- Quantum computing can overcome fundamental limitations of classical sampling techniques.

