Related papers: Sampling cubic rings
Simulating many-body quantum systems poses significant challenges due to the large size of the state space. To address this issue, we propose using an SU(2) coherent state for individual spins to simulate spins on a lattice and derive…
This note introduces "Q-marginals", which are quantum states encoding some probability distribution in a manner suitable for use in Quantum Monte Carlo Integration (QMCI), and shows that these can be prepared directly from a classical…
We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems. Our unified framework provides a streamlined approach for constructing…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical…
For a Haar random set $\mathcal{S}\subset U(d)$ of quantum gates we consider the uniform measure $\nu_\mathcal{S}$ whose support is given by $\mathcal{S}$. The measure $\nu_\mathcal{S}$ can be regarded as a…
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query complexity that is asymptotically the same, up to log…
We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…
Let $\Omega$ be the multiply connected domain in the extended complex plane $\overline{\C}$ obtained by removing $m$ non-overlapping rectilinear segments from the infinite strip $S=\{z\,:\, \left|\Im z\right|<\pi/2\}$. In this paper, we…
We develop a unified approach for construction of symplectic forms for 1D integrable equations with the periodic and rapidly decaying initial data. As an example we consider the cubic nonlinear Schr\"{o}dinger equation.
A conditional sampling oracle for a probability distribution D returns samples from the conditional distribution of D restricted to a specified subset of the domain. A recent line of work (Chakraborty et al. 2013 and Cannone et al. 2014)…
We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…
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…
We show that a quantum channel $\mathcal{N}$ constructed by averaging over $\mathcal{O}(\log d/\epsilon^2)$ randomly chosen unitaries gives a local $\epsilon$-randomizing map with non-negative probability. The idea comes from a small…
Let $R=k[|t^a,t^b,t^c|]$ be a complete intersection numerical semigroup ring over an infinite field $k$, where $a,b,c\in\BN$. The generalized Loewy length, which is Auslander's index in this case, is computed in terms of the minimal…
We propose a construction of the spherical subalgebra of a symplectic reflection algebra of an arbitrary rank corresponding to a star-shaped affine Dynkin diagram. Namely, it is obtained from the universal enveloping algebra of a certain…
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
We study how efficiently a $k$-element set $S\subseteq[n]$ can be learned from a uniform superposition $|S\rangle$ of its elements. One can think of $|S\rangle=\sum_{i\in S}|i\rangle/\sqrt{|S|}$ as the quantum version of a uniformly random…
We model the scrambling of a Rubik's cube by a Markov chain and introduce a stopping time $T$ which is a quite natural candidate to be a strong uniform time. This may pave the way for estimating the number of moves required to scramble a…