Best Approximate Quantum Compiling Problems - Archive ouverte HAL Access content directly
Journal Articles ACM Trans.Quant.Comput. Year : 2022

Best Approximate Quantum Compiling Problems

(1) , (2)


We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the problem in the CNOT+rotation gate set from a mathematical programming standpoint, offering contributions both in terms of understanding the mathematics of the problem and its efficient solution. Among the results that we present, we are able to derive a 14-CNOT 4-qubit Toffoli decomposition from scratch, and show that the Quantum Shannon Decomposition can be compressed by a factor of two without practical loss of fidelity.

Dates and versions

hal-03476912 , version 1 (13-12-2021)



Liam Madden, Andrea Simonetto. Best Approximate Quantum Compiling Problems. ACM Trans.Quant.Comput., 2022, 3 (2), pp.7. ⟨10.1145/3505181⟩. ⟨hal-03476912⟩
42 View
0 Download



Gmail Facebook Twitter LinkedIn More