Pith. sign in

REVIEW

Synthesizing quantum circuits via numerical optimization

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.07714 v1 pith:JQEOOOBH submitted 2020-04-16 cs.ET quant-ph

Timothée Goubault de Brugière , Marc Baboulin , Benoît Valiron , Cyril Allouche This is my paper · ORCID
classification cs.ETquant-ph
keywords quantumalgorithmcircuitsnumericalboundslowernumberoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of quantum gates required to implement any quantum algorithm. Then we present numerical experiments with random quantum operators where we compute the optimal parameters of the circuits and we illustrate the correctness of the theoretical lower bounds. We finally discuss the scalability of the method with the number of qubits.

Discussion (0). Continue with ORCID to comment.

Pith tools