Complexity of quantum circuits via sensitivity, magic, and coherence

Abstract

Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time of quantum algorithms to understanding the physics of black holes. In this work, we study the complexity of quantum circuits using the notions of sensitivity, average sensitivity (also called influence), magic, and coherence. We characterize the set of unitaries with vanishing sensitivity and show that it coincides with the family of matchgates. Since matchgates are tractable quantum circuits, we have proved that sensitivity is necessary for a quantum speedup. As magic is another measure to quantify quantum advantage, it is interesting to understand the relation between magic and sensitivity. We do this by introducing a quantum version of the Fourier entropy-influence relation. Our results are pivotal for understanding the role of sensitivity, magic, and coherence in quantum computation.

arXiv comment42 pages

References in corpus (38)

• Quantifying Coherence
• Quantum Coherence as a Resource
• Improved Simulation of Stabilizer Circuits
• Operational Resource Theory of Coherence
• Complexity Equals Action
• Description of quantum coherence in thermodynamic processes requires constraints beyond free energy
• Quantum Computation as Geometry
• Generalization in quantum machine learning from few training data
• Circuit complexity in quantum field theory
• Towards Complexity for Quantum Field Theory States
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Hudson's Theorem for finite-dimensional quantum systems
• Classical simulation of noninteracting-fermion quantum circuits
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Circuit complexity in interacting QFTs and RG flows
• Generalization in Quantum Machine Learning: a Quantum Information Perspective
• Optimal control, geometry, and quantum computing
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Models of quantum complexity growth
• Quantifying magic for multi-qubit operations
• The Typical-State Paradox: Diagnosing Horizons with Complexity
• Optimal Hypercontractivity for Fermi Fields and Related Non-Commutative Integration
• Resource theory of coherence based on positive-operator-valued measures
• Holographic Spacetimes as Quantum Circuits of Path-Integrations
• Complexity for Conformal Field Theories in General Dimensions
• Out-of-distribution generalization for learning quantum dynamics
• Quantum Skew Divergence
• Entangling power and quantum circuit complexity
• Resource theory of quantum scrambling
• Tight bound on relative entropy by entropy difference
• Quantum advantage of unitary Clifford circuits with magic state inputs
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Fermionic Linear Optics Revisited
• Quantum Entropy and Central Limit Theorem
• Dynamical simulation via quantum machine learning with provable generalization
• Complexity of warped conformal field theory
• Circuit Complexity in Topological Quantum Field Theory
• Classical simulation of quantum circuits by half Gauss sums

Cited by in corpus (14)

• Phase transition in magic with random quantum circuits
• Entanglement-magic separation in hybrid quantum circuits
• Quantum complexity in gravity, quantum field theory, and quantum information science
• Magic Resources of the Heisenberg Picture
• Pseudorandom unitaries are neither real nor sparse nor noise-robust
• Magic Resource Can Enhance the Quantum Capacity of Channels
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• Bridging Entanglement and Magic Resources within Operator Space
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
• Coherence and Imaginarity as Resources in Quantum Circuit Complexity
• Wasserstein Complexity of Quantum Circuits
• Resource-Dependent Complexity of Quantum Channels
• On the Hardness of Measuring Magic
• Decoded Quantum Interferometry Under Noise