Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Random Sampling Method01:09

Random Sampling Method

15.6K
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...
15.6K
Sampling Methods: Overview01:06

Sampling Methods: Overview

3.8K
A sample refers to a smaller subset representative of a larger population. In analytical chemistry, studying or analyzing an entire population is often impractical or impossible. Therefore, samples are used to draw inferences and generalize the whole population. The sampling method selects individuals or items from a population to create a sample. Standard sampling methods include random, judgemental, systematic, stratified, and cluster sampling. 
In analytical chemistry, the choice of...
3.8K
Sampling Methods: Sample Types01:18

Sampling Methods: Sample Types

3.6K
Sampling materials are classified into three main types: solid, liquid, and gas.
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...
3.6K
Sampling Theorem01:15

Sampling Theorem

1.5K
In signal processing, the analysis of continuous-time signals, denoted as x(t), often involves sampling techniques to convert these signals into discrete-time signals. This process is essential for digital representation and manipulation. A critical component in sampling is the train of impulses, characterized by the sampling interval and the sampling frequency. The relationship between these parameters and the original signal's properties dictates the success of the sampling process.
1.5K
Cluster Sampling Method01:20

Cluster Sampling Method

15.4K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.4K
Sampling Distribution01:12

Sampling Distribution

18.9K
Given simple random samples of size n from a given population with a measured characteristic such as mean, proportion, or standard deviation for each sample, the probability distribution of all the measured characteristics is called a sampling distribution. How much the statistic varies from one sample to another is known as the sampling variability of a statistic. You typically measure the sampling variability of a statistic by its standard error. The standard error of the mean is an example...
18.9K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

First Ionization Energy as the Asymptotic Limit of the Average Local Electron Energy.

Journal of chemical theory and computation·2020
Same author

What Is the Accuracy Limit of Adiabatic Linear-Response TDDFT Using Exact Exchange-Correlation Potentials and Approximate Kernels?

Journal of chemical theory and computation·2019
Same author

Visualizing atomic sizes and molecular shapes with the classical turning surface of the Kohn-Sham potential.

Proceedings of the National Academy of Sciences of the United States of America·2018
Same author

Construction of Fermi Potentials from Electronic Wave Functions.

Journal of chemical theory and computation·2018
Same author

Exact exchange-correlation potentials of singlet two-electron systems.

The Journal of chemical physics·2017
Same author

Improved method for generating exchange-correlation potentials from electronic wave functions.

The Journal of chemical physics·2017

Related Experiment Video

Updated: Mar 17, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K

Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis.

Jan Vrbik1, Egor Ospadov2, Stuart M Rothstein2

  • 1Department of Mathematics, Brock University, St. Catharines, Ontario L2S 3A1, Canada.

The Journal of Chemical Physics
|July 17, 2016
PubMed
Summary
This summary is machine-generated.

Ospadov and Rothstein introduced a pure-sampling quantum Monte Carlo algorithm (PSQMC) with an auxiliary Path Z. This path ensures statistical independence, enabling exact Metropolis decisions without approximations for improved pure sampling.

More Related Videos

Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method
05:51

Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method

Published on: July 19, 2019

6.7K
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

15.1K

Related Experiment Videos

Last Updated: Mar 17, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

1.2K
Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method
05:51

Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method

Published on: July 19, 2019

6.7K
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

15.1K

Area of Science:

  • Computational Physics
  • Quantum Monte Carlo Methods

Background:

  • Reptation algorithms in quantum Monte Carlo simulations often rely on approximations.
  • Microscopic reversibility and detailed balance are common requirements for these algorithms.

Purpose of the Study:

  • To introduce a novel pure-sampling quantum Monte Carlo algorithm (PSQMC).
  • To eliminate approximations in the Metropolis decision step of quantum Monte Carlo simulations.

Main Methods:

  • Development of a PSQMC algorithm featuring an auxiliary Path Z.
  • Connecting midpoints of current (X) and proposed (Y) paths with Path Z.
  • Ensuring statistical independence between Paths X and Y by extending Path Z.

Main Results:

  • Path Z provides statistical independence for sufficiently long paths.
  • The Metropolis decision in PSQMC is exact, without approximations.
  • This method avoids the need for microscopic reversibility or G(x → x'; τ) factors.

Conclusions:

  • The novel PSQMC algorithm offers an exact Metropolis decision step.
  • Statistical dependence between paths can negatively impact pure sampling accuracy.
  • This approach presents a unique advantage over existing reptation algorithms.