REVIEW 1 cited by
Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
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
read the original abstract
We show how to efficiently decompose a parameterized multi-qubit Pauli (PMQP) gate into native parameterized two-qubit Pauli (P2QP) gates minimizing both the circuit depth and the number of P2QP gates. Given a realistic quantum computational model, we argue that the technique is optimal in terms of the number of hardware native gates and the overall depth of the decomposition. Starting from PMQP gate decompositions for the path and star hardware graph, we generalize the procedure to any generic hardware graph and provide exact expressions for the depth and number of P2QP gates of the decomposition. Furthermore, we show how to efficiently combine the decomposition of multiple PMQP gates to further reduce the depth as well as the number of P2QP gates for a combinatorial optimization problem using the Lechner-Hauke-Zoller (LHZ) mapping.
Forward citations
Cited by 1 Pith paper
-
$p$-Body $\simeq$ Range $p-1$: Exact Order-Range Mapping and Dual-Unitarity
A kicked p-body Ising chain at interaction strength pi/4 is exactly equivalent, up to a global phase, to a two-body Ising chain with range p-1 couplings, giving new p-body dual-unitary Floquet models.
Discussion (0). Continue with ORCID to comment.