Related papers: Clifford entropy
Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…
We analyze entropic uncertainty relations in a finite dimensional Hilbert space and derive several strong bounds for the sum of two entropies obtained in projective measurements with respect to any two orthogonal bases. We improve the…
We systematically extend the statement that the configurational entropy provides an alternative approach to studying gravitational stability of compact objects, carried out in the previous work of M. Gleiser and N. Jiang, Phys. Rev. D {\bf…
We introduce a notion of chirality for generic quantum states. A chiral state is defined as a state which cannot be transformed into its complex conjugate in a local product basis using local unitary operations. We introduce a number of…
We study the emergence of complexity in deep random $N$-qubit $T$-gate doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer R\'enyi entropy distribution and the…
We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the…
This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…
A quasi two-dimensional colloidal suspension is studied under the influence of immobilisation (pinning) of a random fraction of its particles. We introduce a novel experimental method to perform random pinning and, with the support of…
Given oracle access to an unknown unitary C from the Clifford group and its conjugate, we give an exact algorithm for identifying C with O(n) queries, which we prove is optimal. We then extend this to all levels of the Gottesman-Chuang…
How much does local and time-periodic dynamics resemble a random unitary? In the present work we address this question by using the Clifford formalism from quantum computation. We analyse a Floquet model with disorder, characterised by a…
We present an algorithm for building a circuit that approximates single qubit unitaries with precision {\epsilon} using O(log(1/{\epsilon})) Clifford and T gates and employing up to two ancillary qubits. The algorithm for computing our…
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and 'nearly diagonal' semi-Clifford gates are particularly important:…
We explore the dynamical phases of unitary Clifford circuits with variable-range interactions, coupled to a monitoring environment. We investigate two classes of models, distinguished by the action of the unitary gates, which either are…
Distinct Clifford orbits of magic states can exhibit different stabilizer ranks at small tensor powers. We establish this for qutrits, where the single-qutrit Clifford group has four inequivalent orbits of magic states: Strange, Norrell,…
We revisit entropic formulations of the uncertainty principle for an arbitrary pair of positive operator-valued measures (POVM) $A$ and $B$, acting on finite dimensional Hilbert space. Salicr\'u generalized $(h,\phi)$-entropies, including…
We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the…
In this article, we give an upper bound estimate for the quantitative loss of the upper semi-continuity of the metric entropy for $C^r\:(r>1)$ diffeomorphisms. Building on earlier entropy estimates and reparametrization methods, we optimize…
Most entropy measures depend on the spread of the probability distribution over the sample space $\mathcal{X}$, and the maximum entropy achievable scales proportionately with the sample space cardinality $|\mathcal{X}|$. For a finite…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…