Quantum Complexity of Solving Linear Equations on Higher-Order Networks
quant-ph
Submitted: 2026-10-05
Updated: 2026-10-05
Sources
- Discrete Exterior Calculus
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
- Quantum Computational Complexity
- Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets
- Breaking the cubic barrier in the Solovay-Kitaev algorithm
- On the power quantum computation over real Hilbert spaces
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians