Magic of Random Matrix Product States

Abstract

Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the $1$-dimensional Random Matrix Product States (RMPSs) using the $L_1$-norm measure. We firstly relate the $L_1$-norm to the $L_4$-norm. We then employ a unitary $4$-design to map the $L_4$-norm to a $24$-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the $L_1$-norm. This bound grows exponentially with respect to the qudit number $n$, indicating that the $1$D RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case.

7 pages, 1 figure + 7 pages, 1 figure + 10 pages

References in corpus (26)

• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Absence of Barren Plateaus in Quantum Convolutional Neural Networks
• Stabilizer Rényi entropy
• Quantum Complexity and Negative Curvature
• Many-body quantum magic
• Quantifying nonstabilizerness of matrix product states
• Stabilizer entropies and nonstabilizerness monotones
• Scalable measures of magic resource for quantum computers
• Measurement-induced phase transitions in quantum automaton circuits
• Magic-state resource theory for the ground state of the transverse-field Ising model
• The Quantum Transverse Field Ising Model on an Infinite Tree from Matrix Product States
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• On the statistical complexity of quantum circuits
• Resource theory of quantum scrambling
• Quantum scrambling with classical shadows
• The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
• Lower bound for the T count via unitary stabilizer nullity
• Quantum Entropy and Central Limit Theorem
• Classical shadows with Pauli-invariant unitary ensembles
• Measurement induced entanglement transition in two dimensional shallow circuit
• Emergent statistical mechanics from properties of disordered random matrix product states
• Resource theory of quantum uncomplexity
• Effects of quantum resources on the statistical complexity of quantum circuits
• Barren plateaus from learning scramblers with local cost functions

Cited by in corpus (12)

• Efficient quantum algorithms for stabilizer entropies
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Clifford Dressed Time-Dependent Variational Principle
• Magic Resource Can Enhance the Quantum Capacity of Channels
• Non-equilibrium quantum Monte Carlo algorithm for stabilizer Renyi entropy in spin systems
• Disentangling magic states with classically simulable quantum circuits
• Maximal Magic for Two-qubit States
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Nonstabilizerness generation in a multiparticle quantum walk
• On the Hardness of Measuring Magic
• On the stabilizer complexity of Hawking radiation
• High-expressibility Quantum Neural Networks using only classical resources