Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.
Architecture-aware syn- thesis of phase polynomials for NISQ devices
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2representative citing papers
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.
citing papers explorer
-
Qubit Routing for (Almost) Free
Restricting phase-polynomial synthesis to allowed CNOTs on a given architecture reduces routing overhead from O(log n) or worse to a constant factor of at most 4.
-
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.