Pith. sign in

REVIEW 3 cited by

Introduction to UniversalQCompiler

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 1904.01072 v2 pith:KV2XDDZE submitted 2019-04-01 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumallowscircuitsuniversalqcompilerarbitrarygatesmathematicaoperations
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We introduce an open source software package UniversalQCompiler written in Mathematica that allows the decomposition of arbitrary quantum operations into a sequence of single-qubit rotations (with arbitrary rotation angles) and controlled-NOT (C-NOT) gates. Together with the existing package QI, this allows quantum information protocols to be analysed and then compiled to quantum circuits. Our decompositions are based on Phys. Rev. A 93, 032318 (2016), and hence, for generic operations, they are near optimal in terms of the number of gates required. UniversalQCompiler allows the compilation of any isometry (in particular, it can be used for unitaries and state preparation), quantum channel, positive-operator valued measure (POVM) or quantum instrument, although the run time becomes prohibitive for large numbers of qubits. The resulting circuits can be displayed graphically within Mathematica or exported to LaTeX. We also provide functionality to translate the circuits to OpenQASM, the quantum assembly language used, for instance, by the IBM Q Experience.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Optimal Strategies for Multi-parameter Quantum Metrology

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A conic and semidefinite-programming framework computes exact Holevo, Nagaoka-Hayashi, and SLD precision bounds for multiparameter quantum metrology across parallel, sequential, and indefinite-causal-order strategies,...

  2. Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs

    quant-ph 2025-04 conditional novelty 5.0 of 10

    A single-platform benchmark of gate decomposition algorithms yields practical profiles that rank algorithms for compilation-time and execution-time priorities.

  3. Automated Auxiliary Qubit Allocation in High-Level Quantum Programming

    quant-ph 2024-12

Pith tools