Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers
Abstract Quantum computers provide considerable potential to enhance computing technology, anticipated to surpass conventional computers by resolving intricate challenges that existing systems cannot tackle. They use quantum algorithms for improved performance and depend on reversible computations b...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-05-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-00494-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850231349035663360 |
|---|---|
| author | Mojtaba Noorallahzadeh Mohammad Mosleh |
| author_facet | Mojtaba Noorallahzadeh Mohammad Mosleh |
| author_sort | Mojtaba Noorallahzadeh |
| collection | DOAJ |
| description | Abstract Quantum computers provide considerable potential to enhance computing technology, anticipated to surpass conventional computers by resolving intricate challenges that existing systems cannot tackle. They use quantum algorithms for improved performance and depend on reversible computations based on quantum physics and linear algebra. In contrast to traditional computing, which may include irreversible processes, quantum computing relies on unitary operations that are fundamentally reversible. The parity-preserving feature enables the identification of both permanent and transient defects within circuits. The parity-preserving feature ensures that the input and output states are equal in reversible circuits. Vedic multipliers offer a crucial foundation in the design and implementation of digital circuits, recognized for their speed, efficiency, ease of calculations, reduction of errors, and broad applicability. Prior investigations of quantum Vedic multipliers have faced obstacles like elevated Quantum Cost (QC), substantial Garbage Output (GO), Constant Input (CI), augmented Gate Count (GC), and CNOT-V/V+ count, resulting in more resource use and implementation intricacy. These inefficiencies hinder the scalability and feasibility of quantum multipliers in high-performance computing applications. A proposed solution to these issues is to introduce a cost-effective, parity-preserving reversible quantum block synthesized through an established method that produces a network list of multi-controlled Toffoli (MCT) gates. This Toffoli-based network is then optimized using various techniques, ultimately transforming it into a network of fundamental quantum gates. This approach decreases quantum expenses, eliminates unnecessary outputs, and enhances quantum gate efficiency. Integrating this innovative technique into the reversible quantum Vedic multipliers offers a more efficient, cost-effective, and scalable solution than current approaches. All proposed designs, such as a half adder-subtractor, a ripple carry adder (RCA), and two-bit and four-bit Vedic multipliers, are suggested based on functional blocks and pre-existing components. The suggested structures undergo evaluation in comparison to existing state-of-the-art procedures, demonstrating their cost-effectiveness. The observed average savings for two-bit and four-bit Vedic multipliers, with respect to QC, number of CNOT-V/V+ count, GO, CI, and GC, are 20.01%, 19.38%, 37.51%, 37.51%, and 54.89%, and 22.71%, 18.78%, 27.23%, 31.10%, and 42.38%, respectively when compared to previous studies. Furthermore, all suggested circuits are evaluated and confirmed using the IBM quantum laboratory. |
| format | Article |
| id | doaj-art-52b138cb35774038859dfd1a2b45198e |
| institution | OA Journals |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-05-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-52b138cb35774038859dfd1a2b45198e2025-08-20T02:03:34ZengNature PortfolioScientific Reports2045-23222025-05-0115111810.1038/s41598-025-00494-5Synthesis of a reversible quantum Vedic multiplier on IBM quantum computersMojtaba Noorallahzadeh0Mohammad Mosleh1Department of Computer Engineering, Dez.C., Islamic Azad UniversityDepartment of Computer Engineering, Dez.C., Islamic Azad UniversityAbstract Quantum computers provide considerable potential to enhance computing technology, anticipated to surpass conventional computers by resolving intricate challenges that existing systems cannot tackle. They use quantum algorithms for improved performance and depend on reversible computations based on quantum physics and linear algebra. In contrast to traditional computing, which may include irreversible processes, quantum computing relies on unitary operations that are fundamentally reversible. The parity-preserving feature enables the identification of both permanent and transient defects within circuits. The parity-preserving feature ensures that the input and output states are equal in reversible circuits. Vedic multipliers offer a crucial foundation in the design and implementation of digital circuits, recognized for their speed, efficiency, ease of calculations, reduction of errors, and broad applicability. Prior investigations of quantum Vedic multipliers have faced obstacles like elevated Quantum Cost (QC), substantial Garbage Output (GO), Constant Input (CI), augmented Gate Count (GC), and CNOT-V/V+ count, resulting in more resource use and implementation intricacy. These inefficiencies hinder the scalability and feasibility of quantum multipliers in high-performance computing applications. A proposed solution to these issues is to introduce a cost-effective, parity-preserving reversible quantum block synthesized through an established method that produces a network list of multi-controlled Toffoli (MCT) gates. This Toffoli-based network is then optimized using various techniques, ultimately transforming it into a network of fundamental quantum gates. This approach decreases quantum expenses, eliminates unnecessary outputs, and enhances quantum gate efficiency. Integrating this innovative technique into the reversible quantum Vedic multipliers offers a more efficient, cost-effective, and scalable solution than current approaches. All proposed designs, such as a half adder-subtractor, a ripple carry adder (RCA), and two-bit and four-bit Vedic multipliers, are suggested based on functional blocks and pre-existing components. The suggested structures undergo evaluation in comparison to existing state-of-the-art procedures, demonstrating their cost-effectiveness. The observed average savings for two-bit and four-bit Vedic multipliers, with respect to QC, number of CNOT-V/V+ count, GO, CI, and GC, are 20.01%, 19.38%, 37.51%, 37.51%, and 54.89%, and 22.71%, 18.78%, 27.23%, 31.10%, and 42.38%, respectively when compared to previous studies. Furthermore, all suggested circuits are evaluated and confirmed using the IBM quantum laboratory.https://doi.org/10.1038/s41598-025-00494-5Quantum circuitReversible circuitMCT gatesNCV libraryMultiplierIBM |
| spellingShingle | Mojtaba Noorallahzadeh Mohammad Mosleh Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers Scientific Reports Quantum circuit Reversible circuit MCT gates NCV library Multiplier IBM |
| title | Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers |
| title_full | Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers |
| title_fullStr | Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers |
| title_full_unstemmed | Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers |
| title_short | Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers |
| title_sort | synthesis of a reversible quantum vedic multiplier on ibm quantum computers |
| topic | Quantum circuit Reversible circuit MCT gates NCV library Multiplier IBM |
| url | https://doi.org/10.1038/s41598-025-00494-5 |
| work_keys_str_mv | AT mojtabanoorallahzadeh synthesisofareversiblequantumvedicmultiplieronibmquantumcomputers AT mohammadmosleh synthesisofareversiblequantumvedicmultiplieronibmquantumcomputers |