Mana is a measure of the amount of non-Clifford resources required to create a state; the mana of a mixed state on $\ell$ qudits bounded by $\le \frac 1 2 (\ell \ln d - S_2)$; $S_2$ the state's second Renyi entropy. We compute the mana of Haar-random pure and mixed states and find that the mana is nearly logarithmic in Hilbert space dimension: that is, extensive in number of qudits and logarithmic in qudit dimension. In particular, the average mana of states with less-than-maximal entropy falls short of that maximum by $\ln π/2$. We then connect this result to recent work on near-Clifford approximate $t$-designs; in doing so we point out that mana is a useful measure of non-Clifford resources precisely because it is not differentiable.
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly implement Haar random unitary matrices in optical circuits, with no requirement for prior or explicit matrix calculations. Our physically-motivated and compact representation directly maps independent probability density functions for parameters in Haar random unitary matrices, to optical circuit components. We go on to extend the results to the case of random u…
Spectral properties and coding transitions of Haar-random quantum codes
Princeton University（普林斯顿大学）；Max Planck Institute for the Physics of Complex Systems（马克斯·普朗克复杂系统物理研究所）；University of California, Berkeley（加州大学伯克利分校）；California Institute of Technology（加州理工学院）
We provide a computer algebra package called Random Tensor Network Integrator (RTNI). It allows to compute averages of tensor networks containing multiple Haar-distributed random unitary matrices and deterministic symbolic tensors. Such tensor networks are represented as multigraphs, with vertices corresponding to tensors or random unitaries and edges corresponding to tensor contractions. Input and output spaces of random unitaries may be subdivided into arbitrary tensor factors, with dimensions treated symbolically. The algorithm implements the graphical Weingarten calculus and produces a wei…
We provide an elementary proof for a theorem due to Petz and Réffy which states that for a random $n\times n$ unitary matrix with distribution given by the Haar measure on the unitary group U(n), the upper left (or any other) $k\times k$ submatrix converges in distribution, after multiplying by a normalization factor $\sqrt{n}$ and as $n\to\infty$, to a matrix of independent complex Gaussian random variables with mean 0 and variance 1.
We study the scrambling of quantum information in local random unitary circuits by focusing on the tripartite information proposed by Hosur et al. We provide exact results for the averaged Rényi-$2$ tripartite information in two cases: (i) the local gates are Haar random and (ii) the local gates are dual-unitary and randomly sampled from a single-site Haar-invariant measure. We show that the latter case defines a one-parameter family of circuits, and prove that for a "maximally chaotic" subset of this family quantum information is scrambled faster than in the Haar-random case. Our approach is …
Relative entropy of entanglement of Haar random states
Rikkyo University（立教大学）；RIKEN Quantum, Transformative Research Innovation Platform of RIKEN platforms (TRIP) Headquarters, RIKEN（RIKEN量子与变革性研究创新平台（TRIP）总部，理化学研究所）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Fundamental Quantum Science Program (FQSP), RIKEN（基础量子科学计划（FQSP），理化学研究所）
We numerically study the measurement-driven quantum phase transition of Haar-random quantum circuits in $1+1$ dimensions. By analyzing the tripartite mutual information we are able to make a precise estimate of the critical measurement rate $p_c = 0.17(1)$. We extract estimates for the associated bulk critical exponents that are consistent with the values for percolation, as well as those for stabilizer circuits, but differ from previous estimates for the Haar-random case. Our estimates of the surface order parameter exponent appear different from that for stabilizer circuits or percolation, b…
The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8\% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by t…
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 framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.
We present a technique for derandomising large deviation bounds of functions on the unitary group. We replace the Haar distribution with a pseudo-random distribution, a k-design. k-designs have the first k moments equal to those of the Haar distribution. The advantage of this is that (approximate) k-designs can be implemented efficiently, whereas Haar random unitaries cannot. We find large deviation bounds for unitaries chosen from a k-design and then illustrate this general technique with three applications. We first show that the von Neumann entropy of a pseudo-random state is almost maximal…
Asymptotic distinguishability of Haar-averaged measurement models
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences（波兰科学院理论与应用物理研究所）；International Centre for Theory of Quantum Technologies, University of Gdansk（格但斯克大学量子技术理论国际中心）
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 that random circuits of only polynomial length will approximate the first and second moments of the Haar distribution, thus forming approximate 1- and 2-designs. Previous constructions required longer circuits and worked only for specific gate sets. As a corollary of our main result, we also improve previous bounds on the convergence rate of random walks on t…
Unitary $k$-designs are finite ensembles of unitary matrices that approximate the Haar distribution over unitary matrices. Several ensembles are known to be 2-designs, including the uniform distribution over the Clifford group, but no family of ensembles was previously known to form a 3-design. We prove that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected. Our proof strategy works for any distribution of unitaries satisfying a property we call Pauli 2-mixing and proceeds without the use of heavy mathematical machiner…
We consider sequences of random quantum channels defined using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through tensor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to fo…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation with high probability. In this work, we show that the Haar random unitary can be replaced by a uniformly random unitary chosen from a finite set called an approximate unitary t-design for t = O(log n). Choosing a unitary from such a design requires…
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary $t$-designs. Unitary $t$-designs are probability distributions that mimic Haar randomness up to $t$th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth $O(n t^{10.5})$ are approximate unitary $t$-designs. In this work, we revisit th…
State-of-the-art classical neural networks are observed to be vulnerable to small crafted adversarial perturbations. A more severe vulnerability has been noted for quantum machine learning (QML) models classifying Haar-random pure states. This stems from the concentration of measure phenomenon, a property of the metric space when sampled probabilistically, and is independent of the classification protocol. In order to provide insights into the adversarial robustness of a quantum classifier on real-world classification tasks, we focus on the adversarial robustness in classifying a subset of enc…
One-Body Purity, Non-Gaussianity, and Entanglement in Interacting Integrable Models
Georg-August-Universität Göttingen（哥廷根大学）；Helmholtz-Zentrum Dresden-Rossendorf（德累斯顿-罗斯多夫亥姆霍兹中心）；Wrocław University of Science and Technology（弗罗茨瓦夫理工大学）；J. Stefan Institute（约瑟夫·斯蒂芬研究所）；University of Ljubljana（卢布尔雅那大学）；The Pennsylvania State University（宾夕法尼亚州立大学）
Pauli spectrum and nonstabilizerness of random fermionic Gaussian states
Universität zu Köln（科隆大学）；Barcelona Supercomputing Center（巴塞罗那超级计算中心）；Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与工程中心）
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a universal set, mimicking quantum algorithms in the quantum circuit representation. We show numerically that these ensembles converge to the well--known circular unitary ensemble (CUE) for general complex quantum algorithms, and to the Haar orthogonal ensemble (HOE) for real quantum algorithms. We provide exact analytical formulas for the average and typical inter…
