Pith. sign in

REVIEW

Compiling quantum algorithms for architectures with multi-qubit 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

arxiv 1601.06819 v2 pith:NIU4J7AN submitted 2016-01-25 quant-ph

Compiling quantum algorithms for architectures with multi-qubit gates

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

Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.