Metraipolis › archive › dc_3e4e8058b731

Automated Verification of Hamiltonian Simulation by Quantum Signal Processing — arXiv:2610.39491

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39491
License (as archived)
CC0-1.0
Archived
2026-11-01T02:47:56.530Z
SHA-256 of the archived text
4b7d7dd1a085ce01c793530ed3d9b6d52f777426f674e457fc8c4917fc047792
Stable URL of this page
https://metraipolis.com/documento/dc_3e4e8058b731

How to cite

Automated Verification of Hamiltonian Simulation by Quantum Signal Processing — arXiv:2610.39491 — arXiv (en), https://arxiv.org/abs/2610.39491 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3e4e8058b731 (Metraipolis archive dc_3e4e8058b731, sha256 4b7d7dd1a085ce01c793530ed3d9b6d52f777426f674e457fc8c4917fc047792)
BibTeX
@misc{dc3e4e8058b731,
  title = {Automated Verification of Hamiltonian Simulation by Quantum Signal Processing — arXiv:2610.39491},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39491},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3e4e8058b731; sha256 4b7d7dd1a085ce01c793530ed3d9b6d52f777426f674e457fc8c4917fc047792},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39491. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present, to the best of our knowledge, the first fully automated verification framework for QSP-based Hamiltonian simulation. Our framework exploits the structure of the simulation algorithm: Hamiltonians are given as weighted sums of Pauli strings, embedded into larger unitaries through block encodings, and transformed into time-evolution operators by quantum signal processing (QSP). Using a symbolic Pauli-sum semantics for ancilla-indexed circuit blocks, our verifier proves that the distinguished all-zero ancilla block is proportional to the target Hamiltonian and infers the subnormalization factor automatically. It then verifies the QSP layer by extracting the implemented polynomial transformation and certifying its approximation error. This structure-aware abstraction is essential for scalability. Composing our verified block encoding and QSP wrapper yields an estimated macro-expanded size of about 1.52 million gates. The verifier certifies the block encoding once and checks the QSP layer through its abstract interface, without expanding the oracle calls. Our implementation verifies block encodings of structured Pauli-sum Hamiltonians with up to 256 system qubits and verifies QSP Hamiltonian-simulation instances by extracting their implemented polynomials and checking the resulting approximation bounds. These results show that fully automated verification can handle common Hamiltonian-simulation circuits at substantial scale when it exploits their algorithmic structure.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Programming Languages (cs.PL) ; Logic in Computer Science (cs.LO); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.39491 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:18:13.678Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).