Exponential quantum-classical query separations for cyclic Forrelation
quant-ph, cs.CC
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- One Clean Qubit Suffices for Quantum Communication Advantage
- Classical algorithms for Forrelation
- $k$-Forrelation Optimally Separates Quantum and Classical Query Complexity
- Dequantization and Hardness of Spectral Sum Estimation
- Fourier Spectrum of Noisy Quantum Algorithms
- DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
- Computation with Unitaries and One Pure Qubit
- Quantum Complexity: restrictions on algorithms and architectures
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements