Bounds for Quantum Circuits using Logic-Based Analysis

November 28, 2024 · The Ethereal · 🏛 Software Engineering Companion

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Benedikt Fauseweh, Ben Hermann, Falk Howar arXiv ID 2411.19177 Category cs.LO: Logic in CS Cross-listed cs.SE Citations 0 Venue Software Engineering Companion Last Checked 5 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS