| name | quantum-time-lower-bounds |
| description | Quantum Time Lower Bounds by Permutation Invariance. Use when analyzing quantum algorithms, complexity bounds, quantum ML architectures, or quantum error correction involving mathematical analysis and statistical methods. |
| metadata | {"arxiv_id":"2606.05099","published":"2026-06-06","category":"quantum-complexity"} |
Quantum Time Lower Bounds by Permutation Invariance
Core Methodology
Tight bounds on quantum sample complexity and quantum query complexity have been known for various computational problems in the literature, whereas tight bounds on quantum time complexity (i.e., the size of quantum circuits) remain unresolved. This paper provides a framework to establish lower bounds on the quantum time complexity for testing permutation-invariant properties of quantum states, via a reduction from quantum sample complexity. Applications include: SWAP test is time-optimal for purity estimation, Shift test is time-optimal for high-order functionals, LMR protocol is time-optimal for reflection operators, and samplizer is time-optimal for pure states. First method to systematically establish tight lower bounds on quantum time complexity.
Key Mathematical Framework
- Domain: quantum-complexity
- arXiv: 2606.05099
- Date: 2026-06-06
- Math Keywords: permutation invariance, complexity theory, information theory, lower bounds
Application Patterns
Pattern 1: Mathematical Analysis
- Identify core mathematical structures in quantum protocols
- Map to complexity theory bounds or statistical models
- Extract reusable analytical patterns
Pattern 2: Quantum-Classical Comparison
- Compare quantum vs classical performance metrics
- Quantify parameter efficiency gains
- Analyze scaling behavior
Activation Keywords
- 2606.05099
- quantum time complexity, permutation invariance, SWAP test, LMR protocol, quantum sample complexity, circuit lower bounds
