Construction of Boolean Logic Gates Using QFT-Based Adder Architecture
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912343936466944 |
|---|---|
| author | Kaltehei, Ayda Kurt, Murat Gençten, Azmi Çakmak, Selçuk |
| author_facet | Kaltehei, Ayda Kurt, Murat Gençten, Azmi Çakmak, Selçuk |
| contents | In this study, we construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates. We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder, which computes the sum and carry of two input bits using XOR and AND gates, respectively. To realize different logic gate operations, we apply pre- and post-processing to the QFT-adder using quantum gates, leveraging Boolean algebra properties to enable conversions between various logical functions. Although the number of elementary quantum logic gates increases for a small number of inputs-making the approach appear inefficient at first glance-the overall required qubit count is reduced compared to non-QFT-based designs as the number of inputs increases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17090 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Construction of Boolean Logic Gates Using QFT-Based Adder Architecture Kaltehei, Ayda Kurt, Murat Gençten, Azmi Çakmak, Selçuk Quantum Physics In this study, we construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates. We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder, which computes the sum and carry of two input bits using XOR and AND gates, respectively. To realize different logic gate operations, we apply pre- and post-processing to the QFT-adder using quantum gates, leveraging Boolean algebra properties to enable conversions between various logical functions. Although the number of elementary quantum logic gates increases for a small number of inputs-making the approach appear inefficient at first glance-the overall required qubit count is reduced compared to non-QFT-based designs as the number of inputs increases. |
| title | Construction of Boolean Logic Gates Using QFT-Based Adder Architecture |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.17090 |