2022
DOI: 10.1016/j.ijleo.2021.168543
|View full text |Cite
|
Sign up to set email alerts
|

Fault-tolerant quantum reversible full adder/subtractor: Design and implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Feynman gate (Hadamard gate): Feynman gates, or Hadamard gates, create superposition and are employed in a wide range of quantum algorithms, including quantum search algorithms like Grover's algorithm [94][95][96][97].…”
Section: Applications Of Reversible Logic Gatesmentioning
confidence: 99%
“…Feynman gate (Hadamard gate): Feynman gates, or Hadamard gates, create superposition and are employed in a wide range of quantum algorithms, including quantum search algorithms like Grover's algorithm [94][95][96][97].…”
Section: Applications Of Reversible Logic Gatesmentioning
confidence: 99%
“…A widespread technique for building fault-tolerant quantum circuits is to design them using only Clifford+T gates [30,32,33]. A circuit built exclusively with these gates will allow the use of error correction codes [34][35][36], which together with the aforementioned strategies will improve its error tolerance.…”
Section: Fault-tolerancementioning
confidence: 99%
“…The digital chips density is naturally raised as nano devices are produced in an effort to reduce power consumption and heat dissipation by this use. A number of methods were presented previously for improving the hardware capacity of the multipliers, but no one method provided sufficient results, because of lesser speed, power consumption, count of gates, garbage output, number of quantum costs are increased [18]. To overcome these issues, this work is proposed.…”
Section: Introductionmentioning
confidence: 99%