Related papers: Clifford entropy
We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…
We study pseudo entropy for a particular linear combination of entangled states in qubit systems, two-dimensional free conformal field theories (CFT), and two-dimensional holographic CFT. We observe phenomena that the pseudo entropy can be…
We study the problem of estimating a distribution over a finite alphabet from an i.i.d. sample, with accuracy measured in relative entropy (Kullback-Leibler divergence). While optimal bounds on the expected risk are known, high-probability…
In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…
Even though mutually unbiased bases and entropic uncertainty relations play an important role in quantum cryptographic protocols they remain ill understood. Here, we construct special sets of up to 2n+1 mutually unbiased bases (MUBs) in…
We analyze entropic uncertainty relations for two orthogonal measurements on a $N$-dimensional Hilbert space, performed in two generic bases. It is assumed that the unitary matrix $U$ relating both bases is distributed according to the Haar…
Here we present an analytic approximation for the entropy of floating-point numbers, along with bounds on the error of this approximation. It is well-known that the differential entropy is tightly linked to the discrete entropy of a…
Magic is the resource that quantifies the amount of beyond-Clifford operations necessary for universal quantum computing. It bounds the cost of classically simulating quantum systems via stabilizer circuits central to quantum error…
This article studies the Fourier spectrum characterization of functions in the Clifford algebra-valued Hardy spaces $H^p(\mathbf R^{n+1}_+), 1\leq p\leq \infty.$ Namely, for $f\in L^p(\mathbf R^n)$, Clifford algebra-valued, $f$ is further…
We derive a general approximate solution to the problem of minimizing the conditional entropy of a qudit-qubit system resulting from a local projective measurement on the qubit, which is valid for general entropic forms and becomes exact in…
The entanglement entropy for a quantum critical system across a boundary with a corner exhibits a sub-leading logarithmic scaling term with a scale-invariant coefficient. Using a Numerical Linked Cluster Expansion, we calculate this…
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford…
We examine the minimization of information entropy for measures on the phase space of bounded domains, subject to constraints that are averages of grand canonical distributions. We describe the set of all such constraints and show that it…
We extend the notion of estimation entropy of autonomous dynamical systems proposed by Liberzon and Mitra [1] to nonlinear dynamical systems with uncertain inputs with bounded variation. We call this new notion the {$\epsilon$}-estimation…
We propose two Clifford+$T$ synthesis algorithms that are optimal with respect to $T$-count. The first algorithm, called deterministic synthesis, approximates any single-qubit unitary by a single-qubit Clifford+$T$ circuit with the minimum…
The probability distribution of a measure of non-stabilizerness, also known as magic, is investigated for Haar-random pure quantum states. Focusing on the stabilizer R\'enyi entropies, the associated probability density functions (PDFs) are…
We show how to simplify the computation of the entanglement of formation and the relative entropy of entanglement for states, which are invariant under a group of local symmetries. For several examples of groups we characterize the state…
This paper is an elaboration of an introductory talk given by the author at a workshop on Clifford algebras at Tennessee Technical University, in May 2002. We give an introduction to the basic concepts of Clifford analysis, including links…
In this paper relations among some kinds of cumulative entropies and moments of order statistics are presented. By using some characterizations and the symmetry of a non negative and absolutely continuous random variable X, lower and upper…
We investigate how non-stabilizer resources enable the emergence of quantum state designs within the projected ensemble. Starting from initial states with finite magic and applying resource-free Clifford circuits to scramble them, we…