Related papers: Real-Valued Somewhat-Pseudorandom Unitaries
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
We apply the operation of random independent thinning on the eigenvalues of $n\times n$ Haar distributed unitary random matrices. We study gap probabilities for the thinned eigenvalues, and we study the statistics of the eigenvalues of…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…
We prove that the squared singular values of a fixed matrix multiplied with a truncation of a Haar distributed unitary matrix are distributed by a polynomial ensemble. This result is applied to a multiplication of a truncated unitary matrix…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
The nonorthogonality of coherent states is a fundamental property which prevents them from being perfectly and deterministically discriminated. To circumvent this problem, we present an experimentally feasible protocol for the probabilistic…
We introduce a new notion called ${\cal Q}$-secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an $n$-qubit state to an $(n+m)$-qubit state in an isometric manner. In terms of security,…
Uniform random rotations are a useful primitive in applications such as fast Johnson-Lindenstrauss embeddings, kernel approximation, communication-efficient learning, and recent AI compression pipelines, but they are computationally…
We consider random matrix ensembles on the set of Hermitian matrices that are heavy tailed, in particular not all moments exist, and that are invariant under the conjugate action of the unitary group. The latter property entails that the…
Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for instance: $ \bullet $ its value in $1$…
A unitary state $t$-design is an ensemble of pure quantum states whose moments match up to the $t$-th order those of states uniformly sampled from a $d$-dimensional Hilbert space. Typically, unitary state $t$-designs are obtained by…
Among ${\cal P}$-pseudo-Hermitian Hamiltonians $H ={\cal P}^{-1} H^\dagger \cal P}$ with real spectra, the ''weakly pseudo-Hermitian" ones (i.e., those employing non-self-adjoint ${\cal P} \neq {\cal P}^\dagger$) form a remarkable…
Phase estimation is a quantum algorithm for measuring the eigenvalues of a Hamiltonian. We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent…
A one-parameter random matrix model is proposed for describing the statistics of the local amplitudes and phases of electron eigenfunctions in a mesoscopic quantum dot in an arbitrary magnetic field. Comparison of the statistics obtained…
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure…
We investigate the problems of 1-D and 2-D signal recovery from subsampled Hadamard measurements using Haar wavelet sparsity prior. These problems are of interest in, e.g., computational imaging applications relying on optical multiplexing…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
This paper, for the first time, addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions, specifically quantum physical unclonable functions (qPUFs). Our results show that the…
We study time evolution of a subsystem's density matrix under unitary evolution, generated by a sufficiently complex, say quantum chaotic, Hamiltonian, modeled by a random matrix. We exactly calculate all coherences, purity and…