Skip to main content
SpringerLink
Log in

Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Abstract

With the development of reversible and quantum computing, study of reversible and quantum circuits has also developed rapidly. Due to physical constraints, most quantum circuits require quantum gates to interact on adjacent quantum bits. However, many existing quantum circuits nearest-neighbor have large quantum cost. Therefore, how to effectively reduce quantum cost is becoming a popular research topic. In this paper, we proposed multiple optimization strategies to reduce the quantum cost of the circuit, that is, we reduce quantum cost from MCT gates decomposition, nearest neighbor and circuit simplification, respectively. The experimental results show that the proposed strategies can effectively reduce the quantum cost, and the maximum optimization rate is 30.61% compared to the corresponding results.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 44(12), 261–269 (2000)

    Article  Google Scholar 

  2. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  3. Golubitsky, O., Maslov, D.: A study of optimal 4-bit reversible Toffoli circuits and their synthesis. IEEE Trans. Comput. 61(9), 1341–1353 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Wan, S., Chen, H., Cao, R.: A novel transformation-based algorithm for reversible logic synthesis. In: Proceedings of the 4th International Symposium on Intelligence Computation and Applications (ISICA), vol. 5821, pp. 70–81 (2009)

  5. Cheng, X., Guan, Z.: Linear nearest neighbor quantum circuit synthesis based on valid Boolean matrix. Chin. J. Quantum Electron.( ) 33(6), 743–750 (2016) (in Chinese)

  6. Cirac, J.I., Zoller, P.: Quantum computations with cold trapped ions. Phys. Rev. Lett. 74(20), 4091–4094 (1995)

    Article  ADS  Google Scholar 

  7. Wille, R., Quetschlich, N., Inoue, Y., Yasuda, N., Minato, S.I.: Using \(\uppi \) DDs for Nearest Neighbor Optimization of Quantum Circuits. Reversible Computation. Springer International Publishing, New York (2016)

    MATH  Google Scholar 

  8. Alfailakawi, M., Alterkawi, L., Ahmad, I., et al.: Line ordering of reversible circuits for linear nearest neighbor realization. Quantum Inf. Process. 12(10), 3319–3339 (2013)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  9. Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf. Process. 10(3), 355–377 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rahman, M.M., Dueck, G.W., Chattopadhyay, A., Wille, R.: Integrated synthesis of linear nearest neighbor Ancilla-free MCT circuits. In: IEEE, International Symposium on Multiple-Valued Logic, pp. 144–149. IEEE (2016)

  11. Wille, R., Lye, A., Drechsler, R.: Exact reordering of circuit lines for nearest neighbor quantum architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(12), 1818–1831 (2014)

    Article  Google Scholar 

  12. Kole, A., Datta, K., Sengupta, I.: A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using N-gate lookahead. IEEE J. Emerg. Sel. Top. Circuits Syst. 6(1), 62–72 (2016)

    Article  Google Scholar 

  13. Deb, A., Wille, R., Drechsler, R., Das, D.K.: An efficient reduction of common control lines for reversible circuit optimization. In: IEEE International Symposium on Multiple-Valued Logic, pp. 14–19. IEEE (2015)

  14. Ali, M.B., Hirayama, T., Yamanaka, K., Nishitani, Y.: Quantum cost reduction of reversible circuits using new Toffoli decomposition techniques. In: International Conference on Computational Science and Computational Intelligence, pp. 59–64. IEEE (2016)

  15. Miller, D.M., Sasanian, Z.: Lowering the quantum gate cost of reversible circuits. In: IEEE International Midwest Symposium on Circuits and Systems, pp. 260–263. IEEE (2010)

  16. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2011)

    MATH  Google Scholar 

  17. Hung, W.N.N., Song, X., Yang, G., et al.: Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(9), 1652–1663 (2006)

    Article  Google Scholar 

  18. Drechsler, R., Wille, R.: From Truth Tables to Programming Languages: Progress in the Design of Reversible Circuits. 4(10):78-85 (2011)

  19. Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457–3467 (1995)

    Article  ADS  Google Scholar 

  20. Miller, D.M., Wille, R., Sasanian, Z.: Elementary quantum gate realizations for multiple-control Toffoli gates. IEEE International Symposium on Multiple-Valued Logic, vol. 47, pp. 288–293. IEEE (2011)

  21. Wille, R., Keszocze, O., Walter M., et al.: Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Asia and South Pacific Design Automation Conference. IEEE, vol. 2001, pp. 292–297

Download references

Acknowledgements

The authors thank the financial supports from the National Nature Science Foundation of China (60873069), General Project of Natural Science Research of Colleges and Universities of Jiangsu Province, China (14KJB520033), Natural Science Foundation of Jiangsu Province, China (BK20151274) and Postgraduate Research & Practice Innovation Program of Jiangsu Province (KYCX17_1916).

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Nantong University, Nantong, 226019, China

    Ying-ying Tan, Xue-yun Cheng, Zhi-jin Guan, Yang Liu & Haiying Ma

  2. College of Electronic Information, Nantong University, Nantong, 226019, China

    Xue-yun Cheng

Authors
  1. Ying-ying Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xue-yun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhi-jin Guan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Haiying Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-jin Guan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tan, Yy., Cheng, Xy., Guan, Zj. et al. Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit. Quantum Inf Process 17, 61 (2018). https://doi.org/10.1007/s11128-018-1832-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11128-018-1832-y

Keywords

Search

Navigation