Skip to main content
Log in

Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

In recent years, quantum computing research has been attracting more and more attention, but few studies on the limited interaction distance between quantum bits (qubit) are deeply carried out. This paper presents a mapping method for transforming multiple-control Toffoli (MCT) circuits into linear nearest neighbor (LNN) quantum circuits instead of traditional decomposition-based methods. In order to reduce the number of inserted SWAP gates, a novel type of gate with the optimal LNN quantum realization was constructed, namely NNTS gate. The MCT gate with multiple control bits could be better cascaded by the NNTS gates, in which the arrangement of the input lines was LNN arrangement of the MCT gate. Then, the communication overhead measurement model on inserted SWAP gate count from the original arrangement to the new arrangement was put forward, and we selected one of the LNN arrangements with the minimum SWAP gate count. Moreover, the LNN arrangement-based mapping algorithm was given, and it dealt with the MCT gates in turn and mapped each MCT gate into its LNN form by inserting the minimum number of SWAP gates. Finally, some simplification rules were used, which can further reduce the final quantum cost of the LNN quantum circuit. Experiments on some benchmark MCT circuits indicate that the direct mapping algorithm results in fewer additional SWAP gates in about 50%, while the average improvement rate in quantum cost is 16.95% compared to the decomposition-based method. In addition, it has been verified that the proposed method has greater superiority for reversible circuits cascaded by MCT gates with more control bits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28

Similar content being viewed by others

References

  1. Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of 35th Annual IEEE Symposium on FOCS, Santa Fe, NM, USA, pp. 124–134 (1994)

  2. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th ACM Symposium on Theory of Computing, Philadelphia, PA, USA, pp. 212–219 (1996)

  3. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  4. Lin, C., Sur-Kolay, S., Jha, N.K.: PAQCS: physical design-aware fault-tolerant quantum circuit synthesis. IEEE Trans. VLSI Syst. 23(7), 1221–1234 (2015). https://doi.org/10.1109/TVLSI.2014.2337302

    Article  Google Scholar 

  5. Shafaei, A., Saeedi, M., Pedram, M.: Determining the minimal number of swap gates for multidimensional nearest neighbor quantum circuits. In: Proceedings of ASP Design Automation Conference, Chiba, Japan, pp. 495–500 (2014)

  6. Datta, K., Sengupta, I., Rahaman, H.: A post synthesis optimization technique for reversible circuits exploiting negative control lines. IEEE Trans. Comput. 64(4), 1208–1214 (2015). https://doi.org/10.1109/TC.2014.2315641

    Article  MathSciNet  MATH  Google Scholar 

  7. Soeken, M., Wile, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Proceedings of ASP Design Automation Conference, Sydney, Australia, pp. 85–92 (2012)

  8. Maslov, D., Dueck, G.W., Miller, D.M.: Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42 (2007). https://doi.org/10.1145/1278349.1278355

    Article  Google Scholar 

  9. Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Proceedings of Design Automation Conference, San Francisco, CA, USA, pp. 270–275 (2009)

  10. Kole, A., Datta, K.: Improved NCV gate realization of arbitrary size Toffoli gates. In: Proceedings of 2017 30th International Conference on VLSI Design and 2017 16th International Conference on Embedded Systems (VLSID), Hyderabad, India, pp. 289–294 (2017)

  11. Miller, D., Wille, R., Sasanian, Z.: Elementary quantum gate realization for multiple-control Toffoli gates. In: Proceedings of International Symposium on Multiple-Valued Logic, Washington, DC, USA, pp. 288–293 (2011)

  12. Chakrabatri, A., Sur-Kolay, S.: Nearest neighbour based synthesis of quantum Boolean circuits. Eng. Lett. 15(2), 356–361 (2007)

    Google Scholar 

  13. Khan, M.H.A.: Cost reduction in nearest neighbour based synthesis of quantum Boolean circuits. Eng. Lett. 16(1), 1–5 (2008)

    ADS  Google Scholar 

  14. Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf. Process. 10(3), 355–377 (2011). https://doi.org/10.1007/s11128-010-0201-2

    Article  MathSciNet  MATH  Google Scholar 

  15. Pedram, M., Shafaei, A.: Layout optimization for quantum circuits with linear nearest neighbor architectures. IEEE Circuits Syst. Mag. 16(2), 62–74 (2016). https://doi.org/10.1109/MCAS.2016.2549950

    Article  Google Scholar 

  16. Barenco, A., Bennet, C.H., Cleve, R., et al.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457–3467 (1995). https://doi.org/10.1103/PhysRevA.52.3457

    Article  ADS  Google Scholar 

  17. Toffoli, T.: Reversible computing. Lecture Notes Comput. Sci. 85(3), 632–644 (1980)

    Article  Google Scholar 

  18. Fredkinand, E., Toffoli, T.: Conservative logic. Int. J. Theor. Phys. 21(3–4), 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  19. Peres, A.: Reversible logic and quantum computers. Phys. Rev. A 32(6), 3266–3276 (1985)

    Article  MathSciNet  ADS  Google Scholar 

  20. Rahman, M., Dueck, G.: Synthesis of linear nearest neighbor quantum circuits. In: Proceedings of 10th International Workshop on Boolean Problems, Freiberg, Germany (2012)

  21. Wille, R., Große, D., Teuber, L., et al.: RevLib: an online resource for reversible functions and reversible circuits. In: Proceedings of International Symposium on Multiple-Valued Logic, Washington, DC, USA, pp. 220–225 (2008). http://www.revlib.org

Download references

Acknowledgements

This work was supported by the Natural Science Foundation of Jiangsu Province under Grant BK20151274, General Project of Natural Science Research of Jiangsu Higher School under Grant 14KJB520033, and Postgraduate Research and Practice Innovation Program of Jiangsu Province under Grant KYCX17_1916.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xueyun Cheng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheng, X., Guan, Z. & Ding, W. Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits. Quantum Inf Process 17, 169 (2018). https://doi.org/10.1007/s11128-018-1908-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-018-1908-8

Keywords

Navigation