Pith. sign in

REVIEW 4 cited by

Paulihedral: A Generalized Block-Wise Compiler Optimization Framework For Quantum Simulation Kernels

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.03371 v1 pith:JPL4X3PW submitted 2021-09-07 quant-ph

classification quant-ph
keywords quantumcompilerpaulihedraloptimizationsimulationblock-wiseframeworkgate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by exploiting high-level program structure and optimization opportunities. Paulihedral first employs a new Pauli intermediate representation that can maintain the high-level semantics and constraints in quantum simulation kernels. This naturally enables new large-scale optimizations that are hard to implement at the low gate-level. In particular, we propose two technology-independent instruction scheduling passes, and two technology-dependent code optimization passes which reconcile the circuit synthesis, gate cancellation, and qubit mapping stages of the compiler. Experimental results show that Paulihedral can outperform state-of-the-art compiler infrastructures in a wide-range of applications on both near-term superconducting quantum processors and future fault-tolerant quantum computers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm

    quant-ph 2025-04 unverdicted novelty 7.0 of 10

    Co-optimization of flexible Iceberg error-detection gadgets with QAOA via tree search improves success probability and post-selection on Quantinuum H2-1 hardware up to 34 algorithmic qubits.

  2. Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.

  3. Collective neutrino oscillations: Many-body non-forward effects and non-classicality

    hep-ph 2026-06 unverdicted novelty 5.0 of 10

    In a neutrino-gas model, the many-body Hamiltonian yields different evolution timescales and asymptotics than the quantum kinetic approach with collisions, while quantum resources for the full case sit at the low end ...

  4. Quantum Gates via Dynamical Decoupling of Central Qubit on IBMQ and 15NV Center in Diamond

    quant-ph 2025-09 unverdicted novelty 5.0 of 10

    A dynamical decoupling protocol enables fast high-fidelity gates on a central qubit coupled to targets, demonstrated via IBMQ simulation and adapted for 15NV centers in diamond.

Pith tools