47 citations · 59 across the 3 of their papers we have counts for
3 papers
quant-ph2023★ 2 cited
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers
Tom Peham, Nina Brandl, Richard Kueng +2
Circuit synthesis is the task of decomposing a given logical functionality into a sequence of elementary gates. It is (depth-)optimal if it is impossible to achieve the desired fun…
quant-ph2023★ 10 cited
The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus
Robert Wille, Lukas Burgholzer, Stefan Hillmich +3
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum soft…
quant-ph2022★ 47 cited
Equivalence Checking of Quantum Circuits with the ZX-Calculus
Tom Peham, Lukas Burgholzer, Robert Wille
As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equiva…