[1] Li Z Q, Dai J, Pan S H et al. Synthesis of Deutsch-Jozsa circuits and verification by IBM Q[J]. International Journal of Theoretical Physics, 59, 1668-1678(2020).
[2] Figgatt C, Maslov D, Landsman K A et al. Complete 3-Qubit Grover search on a programmable quantum computer[J]. Nature Communications, 8, 1918(2017).
[3] Gheorghe-Pop I D, Tcholtchev N, Ritter T et al[M]. Computer Scientist's and Programmer's View on Quantum Algorithms: Mapping Functions' APIs and Inputs to Oracles, 188-203(2021).
[4] Google. A python library for NISQ circuits[OL]. https://quantumai.google/cirq
[5] Qiu D W, Zheng S G. Revisiting Deutsch-Jozsa algorithm[J]. Information and Computation, 275, 104605(2020).
[6] Gilliam A, Pistoia M, Gonciulea C. Optimizing quantum search using a generalized version of Grover's algorithm[J]. Quantum Physics, 1, 1-7(2020).
[7] Datta K, Sengupta I, Rahaman H. A post-synthesis optimization technique for reversible circuits exploiting negative control lines[J]. IEEE Transactions on Computers, 64, 1208-1214(2015).
[8] Bandyopadhyay C, Parekh S, Rahaman H. Improved circuit synthesis approach for exclusive-sum-of-product-based reversible circuits[J]. IET Computers & Digital Techniques, 12, 167-175(2018).
[9] Shoemaker A, Vare S. Edmonds' blossom algorithm[J]. CME, 1, 1-27(2016).
