Pith. sign in

REVIEW

Optimizing Multiple-Control Toffoli Quantum Circuit Design with Constraint Programming

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 2404.14384 v3 pith:4MET3GPL submitted 2024-04-22 math.OC cs.ETquant-ph

classification math.OCcs.ETquant-ph
keywords quantumcircuitsdesignoptimizationproblemcircuitconstraintconstraints
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As quantum technology advances, the efficient design of quantum circuits has become an important area of research. This paper provides an introduction to the MCT quantum circuit design problem for reversible Boolean functions with the necessary background in quantum computing to comprehend the problem. While this is a well-studied problem, optimization models that minimize the true objective have only been explored recently. This paper introduces a new optimization model and symmetry-breaking constraints that improve solving time by up to two orders of magnitude compared to earlier work when a Constraint Programming solver is used. Experiments with up to seven qubits and using up to 15 quantum gates result in several new best-known circuits, obtained by any method, for well-known benchmarks. Several in-depth analyses are presented to validate the effectiveness of the symmetry-breaking constraints from multiple perspectives. Finally, an extensive comparison with other approaches shows that optimization models may require more time but can provide superior circuits with optimality guarantees.

Discussion (0). Continue with ORCID to comment.

Pith tools