arXiv (All)
open access
qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover's algorithm. The Exclusive-Sum-of-Product base
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AlchemQ: Proof-Carrying Quantum Circuit Optimization with Per-Result Equivalence Certificates#1013761
- Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1130907
- Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1122387
- On the Complexity of Level-Synchronized Tree Automata for Quantum Circuit Verification#1390084
- Fast Template Matching for Quantum Circuits Using Hypergraph#1413336
Record · ID 1456028
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive