Lean-QEC delivers the first end-to-end Lean 4 formalization of stabilizer-code theory with verified distance certificates for large qLDPC codes in the Bivariate Bicycle family.
Efficient quantum algorithms for simulating sparse hamiltonians.Communications in Mathematical Physics, 270(2):359–371
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.
Hybrid algorithm classically diagonalizes Hamiltonian tensor factors to construct block-encodings for quantum simulation via QSVD, with extensions for commuting time-dependent cases.
citing papers explorer
-
End-to-End Formalization of Quantum Error Correction
Lean-QEC delivers the first end-to-end Lean 4 formalization of stabilizer-code theory with verified distance certificates for large qLDPC codes in the Bivariate Bicycle family.
-
Heisenberg-limited Hamiltonian learning without short-time control
Heisenberg-limited Hamiltonian learning is achievable with any constant minimum evolution time T per query, attaining optimal 1/ε total-time scaling for logarithmically sparse Hamiltonians.
-
Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation
Hybrid algorithm classically diagonalizes Hamiltonian tensor factors to construct block-encodings for quantum simulation via QSVD, with extensions for commuting time-dependent cases.