Towards Equivalence Checking of Classical Circuits Using Quantum Computing
<|reference_start|>Towards Equivalence Checking of Classical Circuits Using Quantum Computing: Quantum computers and quantum algorithms have made great strides in the last few years and promise improvements over classical computing for specific tasks. Although the current hardware is not yet ready to make real impacts at the time of writing, this will change over the coming years. To be ready for this, it is important to share knowledge of quantum computing in application domains where it is not yet represented. One such application is the verification of classical circuits, specifically, equivalence checking. Although this problem has been investigated over decades in an effort to overcome the verification gap, how it can potentially be solved using quantum computing has hardly been investigated yet. In this work, we address this question by considering a presumably straightforward approach: Using Grover's algorithm. However, we also show that, although this might be an obvious choice, there are several pitfalls to avoid in order to get meaningful results. This leads to the proposal of a working concept of a quantum computing methodology for equivalent checking providing the foundation for corresponding solutions in the (near) future.<|reference_end|>
@article{quetschlich2024towards,
    title={Towards Equivalence Checking of Classical Circuits Using Quantum
  Computing},
    author={Nils Quetschlich, Tobias Forster, Adrian Osterwind, Domenik Helms,
  Robert Wille},
    journal={arXiv preprint arXiv:2408.14539},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.14539},
    primaryClass={quant-ph cs.ET}
}