Related papers: Mana in Haar-random states
Magic states are key ingredients in schemes to realize universal fault-tolerant quantum computation. Theories of magic states attempt to quantify this computational element via monotones and determine how these states may be efficiently…
Non-stabilizerness - commonly known as magic - measures the extent to which a quantum state deviates from stabilizer states and is a fundamental resource for achieving universal quantum computation. In this work, we investigate the behavior…
We study the Mana and Magic for quantum states. They have a standard definition through the Clifford group, which is finite and thus classically computable. We introduce a modified Mana and Magic, which keep their main property of classical…
Any set of pure states living in an given Hilbert space possesses a natural and unique metric --the Haar measure-- on the group $U(N)$ of unitary matrices. However, there is no specific measure induced on the set of eigenvalues $\Delta$ of…
If a quantum system of Hilbert space dimension $mn$ is in a random pure state, the average entropy of a subsystem of dimension $m\leq n$ is conjectured to be $S_{m,n}=\sum_{k=n+1}^{mn}\frac{1}{k}-\frac{m-1}{2n}$ and is shown to be $\simeq…
Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a…
We investigate the generic aspects of quantum coherence guided by the concentration of measure phenomenon. We find the average relative entropy of coherence of pure quantum states sampled randomly from the uniform Haar measure and show that…
There is a property of a quantum state called magic. It measures how difficult for a classical computer to simulate the state. In this paper, we study magic of states in the integrable and chaotic regimes of the higher-spin generalization…
Magic (non-stabilizerness) is a key resource for achieving universal fault-tolerant quantum computation beyond classical computation. While previous studies have primarily focused on magic in single systems, its interactions and…
We introduce an elementary measure of non-commutativity between two algebras of quantum operators acting on the same Hilbert space. This quantity, which we call Mutual Averaged Non-commutativity (MAN), is a simple generalization of a type…
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet…
Magic-state distillation (or non-stabilizer state manipulation) is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum computation. Related to non-stabilizer state manipulation is the…
Nies and Scholz introduced the notion of a state to describe an infinite sequence of qubits and defined quantum-Martin-Lof randomness for states, analogously to the well known concept of Martin-L\"of randomness for elements of Cantor space…
We analyze mean fidelity between random density matrices of size N, generated with respect to various probability measures in the space of mixed quantum states: Hilbert-Schmidt measure, Bures (statistical) measure, the measures induced by…
Compact expressions for the average subentropy and coherence are obtained for random mixed states that are generated via various probability measures. Surprisingly, our results show that the average subentropy of random mixed states…
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most $\epsilon$ scales as $O(\log^{\gamma}(1/\epsilon))$ (Bravyi and Haah, PRA 2012).…
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements…
To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is…
We consider the properties of a specific distribution of mixed quantum states of arbitrary dimension that can be biased towards a specific mean purity. In particular, we analyze mixtures of Haar-random pure states with Dirichlet-distributed…
The initial state creation is a starting point of many quantum algorithms and usually is considered as a separate subroutine not included into the algorithm itself. There are many algorithms aimed on creation of special class of states. Our…