Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices

Arianne Meijer-van de Griend (Cambridge Quantum Computing Ltd); Ross Duncan (Cambridge Quantum Computing Ltd; University of Strathclyde)

Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2004.06052 v2 pith:3Z3JT345 submitted 2020-04-13 quant-ph

Arianne Meijer-van de Griend (Cambridge Quantum Computing Ltd) , Ross Duncan (Cambridge Quantum Computing Ltd , University of Strathclyde) This is my paper · ORCID

classification quant-ph

keywords algorithmcircuitscurrentlydevicesnisqphasepolynomialsquantum

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and tket, while improving the runtime with respect the former.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

A generic multi-Pauli compilation framework for limited connectivity
quant-ph 2024-12 conditional novelty 7.0 of 10

A Clifford-tableau-like representation enables simultaneous implementation of multiple non-commuting Pauli exponentials, reducing CNOT counts for VQE circuits on limited-connectivity hardware.

Pith tools