Bounds for Quantum Circuits using Logic-Based Analysis

Benedikt Fauseweh; Ben Hermann; Falk Howar

REVIEW

Bounds for Quantum Circuits using Logic-Based Analysis

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 2411.19177 v1 pith:4SL4U6LP submitted 2024-11-28 cs.LO cs.SE

Bounds for Quantum Circuits using Logic-Based Analysis

Benedikt Fauseweh , Ben Hermann , Falk Howar This is my paper

classification cs.LO cs.SE

keywords circuitsideasproofquantumverificationanalysisapplicationbounds

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We explore ideas for scaling verification methods for quantum circuits using SMT (Satisfiability Modulo Theories) solvers. We propose two primary strategies: (1) decomposing proof obligations via compositional verification and (2) leveraging linear over-approximation techniques for gate effects. We present two examples and demonstrate the application of these ideas to proof Hamming weight preservation.

Bounds for Quantum Circuits using Logic-Based Analysis

discussion (0)