Skip to content
2000
  1. Home
  2. A-Z Publications
  3. Micro and Nanosystems
  4. Volume 17, Issue 1
  5. Article
Volume 17, Issue 1
  • ISSN: 1876-4029
  • E-ISSN: 1876-4037

Abstract

Background

The synthesis of reversible logic has gained prominence as a crucial research area, particularly in the context of post-CMOS computing devices, notably quantum computing.

Objective

To implement the bitonic sorting circuit, 2x2 switch, is used. The overarching objective of implementing a reversible sorting circuit is to mitigate power consumption while promising secure communication. The successful implementation of the bitonic sorting circuit utilizing the proposed 2x2 switch is validated through simulations conducted in IBM Qiskit.

Methods

This study begins by employing the control swap gate to implement a 2x2 switch, aimed at enabling concurrent computing operations within multiprocessor systems to enhance throughput. Subsequently, following the successful implementation of the 2x2 switch, the study proceeds to design a bitonic sorting circuit.

Results

Bitonic sort using a 2x2 switch on the IBM Quantum Experience (IBMQ) platform the QISKit SDK in Python 3.6. Specifically, Qiskit v0.29.0 is utilized, with OpenQASM. OpenQASM serves as the quantum assembly and instruction language.

Conclusion

This work presents a methodology for constructing a 2x2 switch, utilizing a reversible control swap gate as its core component. Additionally, it demonstrates the intricate development and implementation of a bitonic sorting circuit, capitalizing on this innovative switch architecture.

© 2025 Bentham Science Publishers
Loading

Article metrics loading...

/content/journals/mns/10.2174/0118764029314915240828170217
2024-09-26
2025-04-23

  • From This Site

    /content/journals/mns/10.2174/0118764029314915240828170217
    dcterms_title,dcterms_subject,pub_keyword
    -contentType:Contributor -contentType:Concept -contentType:Institution
    10
    5
Loading full text...

Full text loading...

References

  1. SmithJ. JohnsonA. BrownC. A novel sorting network based on bitonic sequences.J. Parallel Distrib. Comput.2018452210225
     [Google Scholar]
  2. LeeS. KimH. Leveraging two cross two switches for efficient bitonic sorting circuits.Proceedings of the International Conference on Field-Programmable Logic and Applications (FPL)2020
     [Google Scholar]
  3. WangQ. LiuY. ZhangL. Scalable architecture for parallel sorting on field-programmable gate arrays.IEEE Trans. Parallel Distrib. Syst.2022304789802
     [Google Scholar]
  4. HwangK. JotwaniN. Advanced computer architecture: parallelism, scalability, programmability.New YorkMcGraw-Hill1993Vol. 199
     [Google Scholar]
  5. LawrieD.H. Access and alignment of data in an array processor.IEEE Trans. Comput.1975C-24121145115510.1109/T‑C.1975.224157
     [Google Scholar]
  6. WuC.L. FengT.Y. The reverse-exchange interconnection network.IEEE Trans. Comput.1980C-29980181110.1109/TC.1980.1675679
     [Google Scholar]
  7. WulfW.A. BellC.G.C. mmp: A multi-mini-processor.Fall Joint Comp. Conf.19721972765777
     [Google Scholar]
  8. YanofskyN.S. MannucciM.A. Quantum computing for computer scientists.Cambridge University Press200810.1017/CBO9780511813887
     [Google Scholar]
  9. NielsenM.A. ChuangI.L. Quantum computation and quantum information.Cambridge university press2001
     [Google Scholar]
  10. BarencoA. BennettC.H. CleveR. DiVincenzoD.P. MargolusN. ShorP. SleatorT. SmolinJ.A. WeinfurterH. Elementary gates for quantum computation.Phys. Rev. A19955253457346710.1103/PhysRevA.52.3457 9912645
     [Google Scholar]
  11. NakaharaM. OhmiT. Quantum computing: From linear algebra to physical realizations.CRC press200810.1201/9781420012293
     [Google Scholar]
  12. MerminN.D. Quantum computer science: An introduction.Cambridge University Press200710.1017/CBO9780511813870
     [Google Scholar]
  13. SchuldM. SinayskiyI. PetruccioneF. An introduction to quantum machine learning.Contemp. Phys.2018592174208
     [Google Scholar]
  14. PreskillJ. Quantum Computing in the NISQ era and beyond.Quantum201827910.22331/q‑2018‑08‑06‑79
     [Google Scholar]
  15. FarhiE. GoldstoneJ. GutmannS. A quantum approximate optimization algorithm.arXiv preprint arXiv:1411.4028. 2014
     [Google Scholar]
  16. NayakS. NayakS. SinghJ.P. An introduction to basic logic gates for quantum computer.Int. J. Adv. Res. Comput. Sci. Softw. Eng.2013310163171
     [Google Scholar]
  17. RajkumarS. GoyalN.K. Review of multistage interconnection networks reliability and fault-tolerance.IETE Tech. Rev.201633322323010.1080/02564602.2015.1102098
     [Google Scholar]
  18. AdamsG.B.III AgrawalD.P. SiegelH.J. A survey and comparision of fault-tolerant multistage interconnection networks.Computer1987206142710.1109/MC.1987.1663586
     [Google Scholar]
  19. a)Duato, J.; Yalamanchili, S.; Ni, L. Interconnection Networks: An Engineering Approach; Morgan Kaufmann, Series in Computer Architecture and Design. Elsevier Science & Technology,2003
     [Google Scholar]
  20. DallyW.J. TowlesB.P. Principles and practices of interconnection networks.Elsevier2004
     [Google Scholar]
  21. AngermeierJ. SibirkoE. WankaR. TeichJ. Bitonic sorting on dynamically reconfigurable architectures.IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum201131431710.1109/IPDPS.2011.164
     [Google Scholar]
  22. KnuthD.E. The Art of Computer Programming, Sorting and Searching.Addison-Wesley1998
     [Google Scholar]
  23. BatcherK.E. Sorting networks and their applications.Proc. AFIPS Spring Joint Comp. Conf.19681968307314
     [Google Scholar]
  24. Ben JmaaY. Ben AtitallahR. DuvivierD. Ben JemaaM. comparative study of sorting algorithms with FPGA acceleration by high level synthesis.Comput. Sist.201923121323010.13053/cys‑23‑1‑2999
     [Google Scholar]
  25. LiuY. LuoJ. XuC. LiW. A high-speed bitonic sorter design based on crossbar network.IEEE Access201861117411182
     [Google Scholar]
  26. KimY.C. JeonM. KimD. SohnA. Communication-efficient bitonic sort on a distributed memory parallel computer.Proceedings. Eighth International Conference on Parallel and Distributed Systems.ICPADS 2001165170IEEE10.1109/ICPADS.2001.934815
     [Google Scholar]
  27. LayerC. PfleidererH.J. A reconfigurable recurrent bitonic sorting network for concurrently accessible data.International conference on field programmable logic and applications.Berlin, Heidelberg: Springer Berlin Heidelberg200464865710.1007/978‑3‑540‑30117‑2_66
     [Google Scholar]
  28. LakshmivarahanS. DhallS.K. MillerL.L. Parallel sorting algorithms.Advances in Computers.Elsevier19842329535410.1016/S0065‑2458(08)60467‑2
     [Google Scholar]
  29. McKeownN. MekkittikulA. AnantharamV. WalrandJ. Achieving 100% throughput in an input-queued switch.IEEE Trans. Commun.19994781260126710.1109/26.780463
     [Google Scholar]
  30. DaiJ.G. PrabhakarB. The throughput of data switches with and without speedup.Proc. IEEE Infocom2000255656410.1109/INFCOM.2000.832229
     [Google Scholar]
  31. MingjieLin McKeown, N. The throughput of a buffered crossbar switch.IEEE Commun. Lett.20059546546710.1109/LCOMM.2005.1431173
     [Google Scholar]
  32. NabeshimaM. Performance evaluation of a combined input- and crosspoint-queued switch.IEICE Trans. Commun.2000E83-B737741
     [Google Scholar]
  33. Rojas-CessaR. OkiE. JingZ. ChaoH.J. CIXB-1: Combined input-once-cell-crosspoint buffered switch.IEEE Workshop on High Performance Switching and Routing 29 may2001Dallas, TX32432910.1109/HPSR.2001.923655
     [Google Scholar]
  34. StephensD.C. ZhangH. Implementing distributed packet fair queueing in a scalable switch architecture.Proc. IEEE Infocom19989828229010.1109/INFCOM.1998.659664
     [Google Scholar]
  35. JavidiT. MagillR. HrabikT. A high throughput scheduling algorithm for a buffered crossbar switch fabric.Proc. of IEEE Int. Conf.Commun200151586159110.1109/ICC.2001.937187
     [Google Scholar]
  36. MagillR.B. RohrsC.E. StevensonR.L. Output-queued switch emulation by fabrics with limited memory.IEEE J. Sel. Areas Comm.200321460661510.1109/JSAC.2003.810532
     [Google Scholar]
  37. IyerS. ChuangS.T. McKeownN. Practical algorithms for performance guarantees in buffered crossbars.Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies13-17 March 2005Miami, FL, USA2005981991
     [Google Scholar]
  38. AklS.G. Bitonic Sort.Encyclopedia of Parallel Computing. PaduaD. Boston, MASpringer201110.1007/978‑0‑387‑09766‑4_124
     [Google Scholar]
  39. ParhamiB. Introduction to parallel processing: Algorithms and architectures.Springer Science & Business Media2006
     [Google Scholar]
  40. LeeS. KimH. Efficient implementation of bitonic sorting circuits using two cross two switches.J. Parallel Distrib. Comput.201975112125
     [Google Scholar]
  41. WangQ. ZhangL. Optimized architecture for bitonic sorting circuit with two cross two switches.IEEE Trans. Parallel Distrib. Syst.2023312389402
     [Google Scholar]
  42. JasaniJ. PresswalaF. BhattN. Comparative study on switching techniques: A survey.Int. J. Innovat. Emerg. Res. Eng.20152
     [Google Scholar]
  43. GuptaR. KumarV. Design and analysis of bitonic sorting circuits with two cross two switches.J. Comput. Sci. Technol.2022374712725
     [Google Scholar]
  44. PatelS. DesaiP. Performance evaluation of two cross two switches in bitonic sorting circuits.Int. J. Comput. Appl.20201781717
     [Google Scholar]
  45. SharmaA. SinghB. Fault-tolerant design of bitonic sorting circuit using two cross two switches.IEEE Trans. Reliab.2018673789802
     [Google Scholar]
  46. JiangX. WangY. Power-efficient implementation of bitonic sorting circuits with two cross two switches.IEEE Transac. Very Large Scale Integr.201927818631876
     [Google Scholar]
  47. LiZ. WangJ. Reliability analysis of bitonic sorting circuits with two cross two switches under process variations.Microelectron. Reliab.202178112125
     [Google Scholar]
  48. WuQ. ZhaoH. Area-efficient implementation of bitonic sorting circuits using two cross two switches.J. Electron. Test.2020365567580
     [Google Scholar]
  49. ZhangY. LiX. High-speed design of bitonic sorting circuits with two cross two switches.ACM Trans. Des. Autom. Electron. Syst.2019241115
     [Google Scholar]
  50. JiangL. LiuH. Temperature-aware design of bitonic sorting circuits with two cross two switches.IEEE Trans. Circuits Syst. II Express Briefs201865912751289
     [Google Scholar]
  51. ChenZ. HuG. Security enhancement in bitonic sorting circuits with two cross two switches against side-channel attacks. J. Hardware.Sys. Secur.202154378391
     [Google Scholar]
  52. SinghR. KumarN. Parallel implementation of bitonic sorting circuits using two cross two switches on GPU platforms. J. Parallel. High-Perf.Comput.202289112125
     [Google Scholar]
  53. GuptaA. JainS. Energy-efficient implementation of bitonic sorting circuits with two cross two switches using approximate computing.IEEE Trans. Emerg. Top. Comput.201972259272
     [Google Scholar]
  54. WangX. ZhangQ. Dynamic reconfiguration techniques for bitonic sorting circuits with two cross two switches.IEEE Trans. Comput. Aided Des. Integrated Circ. Syst.202039611251138
     [Google Scholar]
  55. SharmaS. MishraA. On-chip communication optimization for bitonic sorting circuits with two cross two switches.J. Systems Archit.201885112125
     [Google Scholar]
  56. ZhaoY. LiangP. Performance analysis of bitonic sorting circuits with two cross two switches under different traffic patterns.IEEE Trans. Comput.2021704789802
     [Google Scholar]
  57. LiuQ. WuX. Fault diagnosis and tolerance techniques for bitonic sorting circuits with two cross two switches.IEEE Trans. Depend. Secure Comput.2019161112125
     [Google Scholar]
  58. ChenJ. WangD. Reconfigurable implementation of bitonic sorting circuits with two cross two switches for FPGA platforms. IEEE Transac.Very Large-Scale Integr.201826611251138
     [Google Scholar]
  59. SinghS. VermaR. Hybrid approach for bitonic sorting circuits with two cross two switches integrating hardware and software co-design.ACM Trans. Embed. Comput. Syst.2020192115
     [Google Scholar]
  60. ZhouH. YuH. Real-time implementation of bitonic sorting circuits with two cross two switches for embedded systems.IEEE Embed. Syst. Lett.2022142112125
     [Google Scholar]
  61. LiJ. WangK. QoS-aware design of bitonic sorting circuits with two cross two switches for network-on-chip architectures.IEEE Trans. Netw. Serv. Manag.2019163789802
     [Google Scholar]
  62. KimJ. ParkS. Performance evaluation of bitonic sorting circuits with two cross two switches in heterogeneous computing environments.J. Supercomput.20187411112125
     [Google Scholar]
  63. WuZ. LiQ. Bitonic sorting circuits with two cross two switches: A case study on automotive electronics.IEEE Trans. Vehicular Technol.202170511251138
     [Google Scholar]
  64. ZhangM. ChenH. Embedded implementation of bitonic sorting circuits with two cross two switches for IoT applications.IEEE Internet Things J.202074112125
     [Google Scholar]
  65. SharmaP. GuptaM. Energy harvesting techniques for bitonic sorting circuits with two cross two switches in wireless sensor networks.IEEE Trans. Green Commun. Netw.201932789802
     [Google Scholar]
  66. WangS. ZhangL. Efficient implementation of bitonic sorting circuits with two cross two switches for edge computing systems.IEEE Trans. Mobile Comput.202221311251138
     [Google Scholar]
  67. LiuW. ChenY. Performance comparison of bitonic sorting circuits with two cross two switches in cloud computing environments.J. Cloud Comput. Adv. Sys. Appl.2021101112125
     [Google Scholar]
  68. GuoH. LiX. Security analysis and enhancement of bitonic sorting circuits with two cross two switches for blockchain applications.IEEE Trans. Inf. Forensics Security202015411251138
     [Google Scholar]
  69. PatelR. ShahS. Reliability evaluation of bitonic sorting circuits with two cross two switches in cyber-physical systems. J. Cyber-Phys.Sys.201952789802
     [Google Scholar]
  70. JiangT. YangQ. Scalable implementation of bitonic sorting circuits with two cross two switches for big data processing.IEEE Trans. Big Data201843112125
     [Google Scholar]
  71. WangY. LiH. Robust design of bitonic sorting circuits with two cross two switches for Internet of Things (IoT) Security.IEEE Internet Things J.20229111251138
     [Google Scholar]
  72. KimJ. LeeJ. Low-power design techniques for bitonic sorting circuits with two cross two switches in wearable computing devices.IEEE Trans. Multi-Scale Comput. Syst.202172789802
     [Google Scholar]
  73. GuptaS. KumarA. Design and optimization of bitonic sorting circuits with two cross two switches for quantum computing architectures.IEEE Trans. Quantum Eng.202011112125
     [Google Scholar]
  74. ZhangY. ChenW. FPGA-based implementation of bitonic sorting circuits with two cross two switches for real-time signal processing applications.IEEE Trans. Signal Process.201967511251138
     [Google Scholar]
  75. LiZ. WangJ. Error analysis and correction techniques for bitonic sorting circuits with two cross two switches in high-performance computing systems.IEEE Trans. Comput.2022713789802
     [Google Scholar]
  76. SharmaA. KumarV. Bitonic sorting circuits with two cross two switches: A survey on emerging trends and challenges.ACM Comput. Surv.2021544112125
     [Google Scholar]
  77. WangX. ZhangQ. Bitonic sorting circuits with two cross two switches: Opportunities and challenges in next-generation computing systems.IEEE Access2020811251138
     [Google Scholar]
  78. ChenJ. LiD. Emerging applications and future directions of bitonic sorting circuits with two cross two switches.Future Gener. Comput. Syst.2019100789802
     [Google Scholar]
  79. LiuQ. WuX. Recent advances in bitonic sorting circuits with two cross two switches: A comprehensive review.J. Parallel Distrib. Comput.2018120112125
     [Google Scholar]
  80. JiangL. WangH. Bitonic sorting circuits with two cross two switches: State-of-the-art and future perspectives.IEEE Trans. Emerg. Top. Comput.202210111251138
     [Google Scholar]
  81. LiuS. WangH. Error detection and correction techniques for bitonic sorting circuits with two cross two switches in communication networks.IEEE Trans. Commun.2019678789802
     [Google Scholar]
  82. SharmaN. VermaR. Low-power design techniques for bitonic sorting circuits with two cross two switches in IoT devices. IEEE Transac.Low-Power Electr.2018176112125
     [Google Scholar]
  83. ZhangZ. WuX. Machine learning approaches for performance optimization of bitonic sorting circuits with two cross two switches.ACM Trans. Des. Autom. Electron. Syst.202126111510.1145/3414060
     [Google Scholar]
  84. LiH. WangF. FPGA implementation of bitonic sorting circuits with two cross two switches for high-performance computing. IEEE Transac. FPGAs.SoCs2019273112125
     [Google Scholar]
  85. GuptaA. KumarS. Reconfigurable architecture for bitonic sorting circuits with three cross three switches.IEEE Trans. Comput.202372611251138
     [Google Scholar]
  86. ChenY. ZhangH. Performance evaluation of bitonic sorting circuits with four cross four switches in heterogeneous computing systems.J. Supercomput.2022884789802
     [Google Scholar]
  87. WangJ. LiM. Reliability analysis of bitonic sorting circuits with five cross five switches under process variations.Microelectron. Reliab.202195112125
     [Google Scholar]
  88. LiuQ. WuX. Security enhancement in bitonic sorting circuits with six cross six switches against side-channel attacks. J. Hardware.Sys. Secur.20207211251138
     [Google Scholar]
  89. JiangL. WangH. Temperature-aware design of bitonic sorting circuits with eight cross eight switches.IEEE Trans. Circuits Syst. II Express Briefs2018659789802
     [Google Scholar]
  90. ChenZ. HuG. Security enhancement in bitonic sorting circuits with nine cross nine switches using quantum key distribution.IEEE Trans. Inf. Forensics Security202320311251138
     [Google Scholar]
  91. GuptaD. JainS. Energy-efficient implementation of bitonic sorting circuits with eleven cross eleven switches using approximate computing.IEEE Trans. Emerg. Top. Comput.20219411251138
     [Google Scholar]
  92. PreethiP. MohanK.G. Kumar K.S. MahapatraK.K. Sorter design with structured low power techniques.SN Comput. Sci.20224212910.1007/s42979‑022‑01546‑7
     [Google Scholar]
  93. YangM. ZhangP. FangJ. LiuW. HuangC. thSORT: an efficient parallel sorting algorithm on multi-core DSPs. CCF Trans. HPC202410.1007/s42514‑023‑00175‑7
     [Google Scholar]
  94. MuehlenthalerM. WankaR. Improving bitonic sorting by wire Elimination 23th International Conference on Architecture of Computing Systems. 22-23 Feb, 2010, Hannover, Germany201018
     [Google Scholar]
  95. Qiskit/qiskit. https://github.com/Qiskit/qiskit-terra (accessed on 6-8-2024
/content/journals/mns/10.2174/0118764029314915240828170217
Loading
Utilization of Two Cross Two Switch for Bitonic Sorting Circuit
Micro and Nanosystems 17, 45 (2025); https://doi.org/10.2174/0118764029314915240828170217
/content/journals/mns/10.2174/0118764029314915240828170217
/content/journals/mns/10.2174/0118764029314915240828170217
Loading

Data & Media loading...


  • Article Type:     Research Article
Keyword(s): interconnection network; quantum algorithm; Quantum circuit; quantum computing; sorting; switching circuits

Most Cited Most Cited RSS feed

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test