Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1612.05180

Random samples of quantum states: Online resources

Jiangwei Shang, Yi-Lin Seah, Wang, Boyu, Hui Khoon Ng, David John Nott, Berthold‐Georg Englert

Published Dec 15, 2016• 2 citations
arXivHTMLPDF

Abstract

This is the documentation for generating random samples from the quantum state space in accordance with a specified distribution, associated with this webpage: http://tinyurl.com/QSampling . Ready-made samples (each with at least a million points) from various distributions are available for download, or one can generate one's own samples from a chosen distribution using the provided source codes. The sampling relies on the Hamiltonian Monte Carlo algorithm as described in New J. Phys. 17, 043018 (2015). The random samples are reposited in the hope that they would be useful for a variety of tasks in quantum information and quantum computation. Constructing credible regions for tomographic data, optimizing a function over the quantum state space with a complicated landscape, testing the typicality of entanglement among states from a multipartite quantum system, or computing the average of some quantity of interest over a subset of quantum states are but some exemplary applications among many.

DOI
10.48550/arxiv.1612.05180

Related papers

Monte Carlo sampling from the quantum state space. I

Jiangwei Shang, Yi-Lin Seah, Hui Khoon Ng +2 more

High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local maxima or evaluating an integral over a region in the quantum state space are but two exemplary applications of many. These tasks can only be performed reliably and efficiently with Monte Carlo methods, which involve good samplings of the parameter space in accordance with the relevant target distribution. We show how the standard strategies of rejection sampling, importance sampling, and Markov-chain sampling can be adapted to this context, where the samples must obey the constraints imposed by the positivity of the statistical operator. For illustration, we generate sample points in the probability space of qubits, qutrits, and qubit pairs, both for tomographically complete and incomplete measurements. We use these samples for various purposes: establish the marginal distribution of the purity; compute the fractional volume of separable two-qubit states; and calculate the size of regions with bounded likelihood.

arXiv:1407.7805•New Journal of Physics•Apr 13, 2015•33 citations

Monte Carlo sampling from the quantum state space. II

Yi-Lin Seah, Jiangwei Shang, Hui Khoon Ng +2 more

High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local maxima or evaluating an integral over a region in the quantum state space are but two exemplary applications of many. These tasks can only be performed reliably and efficiently with Monte Carlo methods, which involve good samplings of the parameter space in accordance with the relevant target distribution. We show how the Markov-chain Monte Carlo method known as Hamiltonian Monte Carlo, or hybrid Monte Carlo, can be adapted to this context. It is applicable when an efficient parameterization of the state space is available. The resulting random walk is entirely inside the physical parameter space, and the Hamiltonian dynamics enable us to take big steps, thereby avoiding strong correlations between successive sample points while enjoying a high acceptance rate. We use examples of single and double qubit measurements for illustration.

arXiv:1407.7806•New Journal of Physics•Apr 13, 2015•40 citations

Quantum Random Numbers: A Survey on Sources, Numerical Evidence, and Applications in Security and Computing

Sebastian Raubitzek, Stefan Mühlhauser, Kevin Mallinger

Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.

Entropy•Nov 10, 2026•0 citations

Quantum Random Number Generator with Programmable Probability Distributions

Lac Nguyen, Patrick Rehain, Yong Meng Sua +1 more

We present a method of generating quantum random numbers with arbitrarily defined probability distributions featuring high dimensionality and post-processing free, for significantly improved Monte-Carlo simulations and data analyses.

Frontiers in Optics•Jan 1, 2018•0 citations

Sampling Quantum States with Inequality Constraints

Weijun Li, Rui Han, Jiangwei Shang +2 more

Random samples of quantum states with specific properties are useful for various applications, such as Monte Carlo integration over the state space. In the high-dimensional situations that one already encounters when working with a few qubits, the quantum state space has a very complicated boundary, and it is challenging to incorporate the specific properties into the sampling algorithm. In this paper, we present the Sequentially Constrained Monte Carlo (SCMC) algorithm as a practical and versatile method for sampling quantum states in accordance with properties that can be stated as inequalities. We apply the SCMC algorithm to the generation of samples of bound entangled states; for example, we obtain nearly ten thousand bound, entangled, two-qutrit states in a few minutes, compared with less than ten such states per day from independence sampling in our implementation. In the second application, we draw samples of high-dimensional quantum states from a narrowly peaked target distribution and observe, for the system sizes investigated, that SCMC sampling remains computationally manageable as the dimensions grow. In yet another application, the SCMC algorithm produces uniformly distributed quantum states in regions bounded by values of the problem-specific target distribution; such samples are needed when estimating parameters from the probabilistic data acquired in quantum experiments.

arXiv:2109.14215•Entropy•May 29, 2026•4 citations

Efficient Bayesian credible-region certification for quantum-state tomography

Changhun Oh, Yong Siah Teo, Hyunseok Jeong

Standard Bayesian credible-region theory for constructing an error region on the unique estimator of an unknown state in general quantum-state tomography to calculate its size and credibility relies on heavy Monte Carlo sampling of the state space followed by filtering to obtain the correct region sample. This conventional methodology typically gives negligible yield for very small error regions originating from large data sets. In this article, we discuss at length the in-region sampling theory for computing both size and credibility from region-average quantities that avoids this general problem altogether. Among the many possible numerical choices, we study the performance and properties of accelerated hit-and-run Monte Carlo algorithm for in-region sampling and provide its complexity estimates for quantum states. Finally with our in-region concept, by alternatively quantifying the region capacity with the region-average distance between two states in the region (measured for instance with either the Hilbert-Schmidt, trace-class, or Bures distance), we derive approximation formulas to analytically estimate both region capacity and credibility without Monte Carlo computation.

arXiv:1902.02602•Physical Review A•Jul 26, 2019•11 citations
This is the documentation for generating random samples from the quantum state space in accordance with a specified distribution, associated with this webpage: http://tinyurl.com/QSampling . Ready-made samples (each with at least a million points) from various distributions are available for download, or one can generate one's own samples from a chosen distribution using the provided source codes. The sampling relies on the Hamiltonian Monte Carlo algorithm as described in New J. Phys. 17, 043018 (2015). The random samples are reposited in the hope that they would be useful for a variety of tasks in quantum information and quantum computation. Constructing credible regions for tomographic data, optimizing a function over the quantum state space with a complicated landscape, testing the typicality of entanglement among states from a multipartite quantum system, or computing the average of some quantity of interest over a subset of quantum states are but some exemplary applications among many.
High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local maxima or evaluating an integral over a region in the quantum state space are but two exemplary applications of many. These tasks can only be performed reliably and efficiently with Monte Carlo methods, which involve good samplings of the parameter space in accordance with the relevant target distribution. We show how the standard strategies of rejection sampling, importance sampling, and Markov-chain sampling can be adapted to this context, where the samples must obey the constraints imposed by the positivity of the statistical operator. For illustration, we generate sample points in the probability space of qubits, qutrits, and qubit pairs, both for tomographically complete and incomplete measurements. We use these samples for various purposes: establish the marginal distribution of the purity; compute the fractional volume of separable two-qubit states; and calculate the size of regions with bounded likelihood.
High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local maxima or evaluating an integral over a region in the quantum state space are but two exemplary applications of many. These tasks can only be performed reliably and efficiently with Monte Carlo methods, which involve good samplings of the parameter space in accordance with the relevant target distribution. We show how the Markov-chain Monte Carlo method known as Hamiltonian Monte Carlo, or hybrid Monte Carlo, can be adapted to this context. It is applicable when an efficient parameterization of the state space is available. The resulting random walk is entirely inside the physical parameter space, and the Hamiltonian dynamics enable us to take big steps, thereby avoiding strong correlations between successive sample points while enjoying a high acceptance rate. We use examples of single and double qubit measurements for illustration.
Random numbers are used to generate cryptographic keys, to run Monte Carlo simulations, and to train and sample machine learning models. Most software obtains them from deterministic pseudo-random number generators, which have good statistical properties but are predictable once their internal state is known. Quantum random number generators take their output from measurements on quantum systems, whose outcomes are not fixed by any prior state of the device. This article introduces the types of random number generators, reviews studies that compare quantum and pseudo-random numbers in numerical experiments, and lists the sources of randomness available in current computing systems. It then describes applications of quantum randomness in security, hashing, software, artificial intelligence, and public randomness. The quality of encryption is treated as depending on three factors: the algorithm, its implementation, and the randomness of keys and other security-relevant values. We give arguments for which applications benefit from quantum randomness, name further areas in which it could be tested, and outline next steps.
Random samples of quantum states with specific properties are useful for various applications, such as Monte Carlo integration over the state space. In the high-dimensional situations that one already encounters when working with a few qubits, the quantum state space has a very complicated boundary, and it is challenging to incorporate the specific properties into the sampling algorithm. In this paper, we present the Sequentially Constrained Monte Carlo (SCMC) algorithm as a practical and versatile method for sampling quantum states in accordance with properties that can be stated as inequalities. We apply the SCMC algorithm to the generation of samples of bound entangled states; for example, we obtain nearly ten thousand bound, entangled, two-qutrit states in a few minutes, compared with less than ten such states per day from independence sampling in our implementation. In the second application, we draw samples of high-dimensional quantum states from a narrowly peaked target distribution and observe, for the system sizes investigated, that SCMC sampling remains computationally manageable as the dimensions grow. In yet another application, the SCMC algorithm produces uniformly distributed quantum states in regions bounded by values of the problem-specific target distribution; such samples are needed when estimating parameters from the probabilistic data acquired in quantum experiments.
Standard Bayesian credible-region theory for constructing an error region on the unique estimator of an unknown state in general quantum-state tomography to calculate its size and credibility relies on heavy Monte Carlo sampling of the state space followed by filtering to obtain the correct region sample. This conventional methodology typically gives negligible yield for very small error regions originating from large data sets. In this article, we discuss at length the in-region sampling theory for computing both size and credibility from region-average quantities that avoids this general problem altogether. Among the many possible numerical choices, we study the performance and properties of accelerated hit-and-run Monte Carlo algorithm for in-region sampling and provide its complexity estimates for quantum states. Finally with our in-region concept, by alternatively quantifying the region capacity with the region-average distance between two states in the region (measured for instance with either the Hilbert-Schmidt, trace-class, or Bures distance), we derive approximation formulas to analytically estimate both region capacity and credibility without Monte Carlo computation.