Yao-Hsin Chou
ABSTRACT
The quantum circuit is the prime factor to realize quantum computation. This paper proposes a novel quantum-inspired evolutionary computation method to synthesize quantum circuits effectively and efficiently. Recently, the Clifford+T gate library has become popular, as the T gate has a better fault-tolerant and error correction efficacy, which is essential to near-term quantum computation. The proposed quantum-inspired evolutionary computation is more flexible in constructing diverse solutions than the classical synthesis method. The entangled local search mechanism further enhances the ability to discover the optimal solutions on an efficient frontier. The encoding can be slightly changed to achieve various gate libraries circuit synthesis in the quantum or reversible Boolean circuits. The experiments demonstrate that our proposed method can be more effective in composing a compact quantum circuit than the state-of-the-art method. Meanwhile, the T-depth can attain an optimal value without ancilla bits. Furthermore, we provide an illustration to construct the function equivalent quantum circuit with the NOT, CNOT, Controlled-Square-Root-of-NOT quantum gate library (NCV). We also conduct exhaustion to prove that our synthesized circuit is an optimal solution, requiring far fewer resources in time and evaluation than exhaustion.
- Nabila Abdessaied, Matthew Amy, Mathias Soeken, and Rolf Drechsler. 2016. Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits. In Proceedings of the International Symposium on Multiple-Valued Logic. IEEE, 150--155.Google Scholar
Cross Ref
- Nabila Abdessaied and Rolf Drechsler. 2016. Reversible and Quantum Circuits: Optimization and Complexity Analysis. Springer.Google Scholar
- Matthew Amy, Dmitri Maslov, and Michele Mosca. 2014. Polynomial-Time T-Depth Optimization of Clifford+T Circuits via Matroid Partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33, 10 (2014), 1476--1489.Google ScholarCross Ref
- Matthew Amy, Dmitri Maslov, Michele Mosca, and Martin Roetteler. 2013. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 32, 6 (2013), 818--830.Google ScholarDigital Library
- Laxmidhar Biswal, Rakesh Das, Chandan Bandyopadhyay, Anupam Chattopadhyay, and Hafizur Rahaman. 2018. A Template-Based Technique for Efficient Clifford+T-Based Quantum Circuit Implementation. Microelectronics Journal 81 (2018), 58--68.Google ScholarCross Ref
- Alex Bocharov, Martin Roetteler, and Krysta Marie Svore. 2015. Efficient Synthesis of Probabilistic Quantum Circuits with Fallback. Physical Review A 91, 5 (2015), 052317.Google ScholarCross Ref
- Yao-Hsin Chou, Shu-Yu Kuo, and Yu-Chi Jiang. 2019. A Novel Portfolio Optimization Model Based on Trend Ratio and Evolutionary Computation. IEEE Transactions on Emerging Topics in Computational Intelligence 3, 4 (2019), 337--350.Google ScholarCross Ref
- Shin Cheng Chua and Ashutosh Kumar Singh. 2020. Search-Based Reversible Logic Synthesis Using Mixed-Polarity Gates. Design and Testing of Reversible Logic 577 (2020), 93--113.Google ScholarCross Ref
- Austin Fowler. 2012. Time-Optimal Quantum Computation. arXiv preprint arXiv:1210.4626 (2012).Google Scholar
- Edward Fredkin and Tommaso Toffoli. 1982. Conservative Logic. International Journal of Theoretical Physics 21, 3 (1982), 219--253.Google ScholarCross Ref
- Lov Kumar Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. In Proceedings of the Annual Symposium on Theory of Computing. ACM, 212--219.Google ScholarDigital Library
- Kuk-Hyun Han and Jong-Hwan Kim. 2002. Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization. IEEE Transactions on Evolutionary Computation 6, 6 (2002), 580--593.Google ScholarDigital Library
- Mousum Handique and Aayush Sonkar. 2018. An Extended Approach for Mapping Reversible Circuits to Quantum Circuits Using NCV-|υ1⟩ Library. Procedia Computer Science 125 (2018), 832--839.Google ScholarCross Ref
- Shu-Yu Kuo and Yao-Hsin Chou. 2017. Entanglement-Enhanced Quantum-inspired Tabu Search Algorithm for Function Optimization. IEEE Access 5 (2017), 13236--13252.Google ScholarCross Ref
- Min Li, Yexin Zheng, Michael Hsiao, and Chao Huang. 2010. Reversible Logic Synthesis Through Ant Colony Optimization. In Proceedings of the Conference & Exhibition on Design, Automation & Test. IEEE, 307--310.Google Scholar
- Giulia Meuli, Bruno Schmitt, Rüdiger Ehlers, Heinz Riener, and Giovanni De Micheli. 2019. Evaluating ESOP Optimization Methods in Quantum Compilation Flows. In Proceedings of the International Conference on Reversible Computation. Springer, 191--206.Google ScholarCross Ref
- Luca Mondada. 2021. Quantum Circuits in Additive Hilbert Space. arXiv preprint arXiv:2111.01211 (2021).Google Scholar
- Michele Mosca and Priyanka Mukhopadhyay. 2021. A Polynomial Time and Space Heuristic Algorithm for T-Count. Quantum Science and Technology 7, 1 (2021), 015003.Google ScholarCross Ref
- Michael Aaron Nielsen and Isaac Chuang. 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press.Google Scholar
- Mohamed Osman, Ahmed Younes, and Moustafa Fahmy. 2013. Integration of Irreversible Gates in Reversible Circuits Using NCT Library. IOSR Journal of Computer Engineering 14 (2013), 69--79.Google ScholarCross Ref
- Zahra Sasanian and David Michael Miller. 2011. NCV Realization of MCT Gates with Mixed Controls. In Proceedings of the Pacific Rim Conference on Communications, Computers and Signal Processing. IEEE, 567--571.Google ScholarCross Ref
- Zahra Sasanian, Robert Wille, and David Michael Miller. 2013. Clarification on the Mapping of Reversible Circuits to the NCV-||υ1⟩ Library. arXiv preprint arXiv:1309.1419 (2013).Google Scholar
- Peter Williston Shor. 1994. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of the Annual Symposium on Foundations of Computer Science. IEEE, 124--134.Google ScholarDigital Library
- Mathias Soeken, Gerhard Wilhelm Dueck, Md Mazder Rahman, and David Michael Miller. 2016. An Extension of Transformation-Based Reversible and Quantum Circuit Synthesis. In Proceedings of the International Symposium on Circuits and Systems. IEEE, 2290--2293.Google ScholarDigital Library
- Tommaso Toffoli. 1980. Reversible computing. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 632--644.Google ScholarCross Ref
- I-Ming Tsai and Sy-Yen Kuo. 2006. An Algorithm for Minimum Space Quantum Boolean Circuits Construction. Journal of Circuits, Systems, and Computers 15, 5 (2006), 719--738.Google ScholarCross Ref
- Wen-Hsin Wang, Chia-Hui Chiu, Shu-Yu Kuo, Sheng-Fei Huang, and Yao-Hsin Chou. 2012. Quantum-inspired Tabu Search Algorithm for Reversible Logic Circuit Synthesis. In Proceedings of the International Conference on Systems, Man, and Cybernetics. IEEE, 709--714.Google ScholarCross Ref
- Robert Wille and Rolf Drechsler. 2009. BDD-Based Synthesis of Reversible Logic for Large Functions. In Proceedings of the Annual Design Automation Conference. IEEE, 270--275.Google ScholarDigital Library
- Robert Wille, Mathias Soeken, Christian Otterstedt, and Rolf Drechsler. 2013. Improving the Mapping of Reversible Circuits to Quantum Circuits Using Multiple Target Lines. In Proceedings of the Asia and South Pacific Design Automation Conference. IEEE, 145--150.Google ScholarCross Ref
- Ed Younis, Koushik Sen, Katherine Yelick, and Costin Iancu. 2021. QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis. In Proceedings of the International Conference on Quantum Computing and Engineering. IEEE, 232--243.Google ScholarCross Ref
- Mingming Zhang, Shuguang Zhao, and Xu Wang. 2009. Automatic Synthesis of Reversible Logic Circuit Based on Genetic Algorithm. In Proceedings of the International Conference on Intelligent Computing and Intelligent Systems. IEEE, 542--546.Google ScholarCross Ref
Index Terms
- A novel quantum-inspired evolutionary computation-based quantum circuit synthesis for various universal gate libraries
Recommendations
Modular Component-Based Quantum Circuit Synthesis
In this article, we present a novel method for synthesizing quantum circuits from user-supplied components. Given input-output state vectors and component quantum gates, our synthesizer aims to construct a quantum circuit that implements the provided ...
Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is ...
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy intermediate-scale quantum (...
Comments