activity
20242026
most citedEquivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph2026

Formal Verification of Quantum Ancilla Safety

Jiqi Li, Jingyi Mei, Wang Fang +1

Ensuring ancilla safety is a critical correctness requirement for quantum compilation, since ancilla qubits are routinely introduced to implement complex operations with fewer gate…

quant-ph2026

Quokka#: Quantum Computing with #SAT

Jingyi Mei, Dekel Zak, Muhammad Osama +2

We present Quokka#, a versatile, open-source Python library for quantum circuit analysis. Quokka# reduces various simulation, verification, and synthesis tasks to weighted model co…

quant-ph2025

Reducing Quantum Circuit Synthesis to #SAT

Dekel Zak, Jingyi Mei, Jean-Marie Lagniez +1

Quantum circuit synthesis is the task of decomposing a given quantum operator into a sequence of elementary quantum gates. Since the finite target gate set cannot exactly implement…

quant-ph2024

Advancing Quantum Computing with Formal Methods

Arend-Jan Quist, Jingyi Mei, Tim Coopmans +1

This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understandi…

quant-ph2024

Equivalence Checking of Quantum Circuits by Model Counting

Jingyi Mei, Tim Coopmans, Marcello Bonsangue +1

Verifying equivalence between two quantum circuits is a hard problem, that is nonetheless crucial in compiling and optimizing quantum algorithms for real-world devices. This paper…

quant-ph20241 cited

Simulating Quantum Circuits by Model Counting

Jingyi Mei, Marcello Bonsangue, Alfons Laarman

Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside # and its decision counterpart in . The classic…