Scalable set of reversible parity gates for integer factorization
Abstract Classical microprocessors operate on irreversible gates, that, when combined with AND, half-adder and full-adder operations, execute complex tasks such as multiplication of integers. We introduce parity versions of all components of a multiplication circuit. The parity gates are reversible...
Main Authors: | Martin Lanthaler, Benjamin E. Niehoff, Wolfgang Lechner |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2023-04-01
|
Series: | Communications Physics |
Online Access: | https://doi.org/10.1038/s42005-023-01191-3 |
Similar Items
-
Minimal constraints in the parity formulation of optimization problems
by: Martin Lanthaler, et al.
Published: (2021-01-01) -
Parity Quantum Optimization: Compiler
by: Kilian Ender, et al.
Published: (2023-03-01) -
Parity alternating permutations starting with an odd integer
by: Frether Getachew Kebede, et al.
Published: (2021-03-01) -
Design and evaluation of an efficient parity-preserving reversible QCA gate with online testability
by: Bandan Bhoi, et al.
Published: (2017-01-01) -
Demonstrating Scalable Randomized Benchmarking of Universal Gate Sets
by: Jordan Hines, et al.
Published: (2023-11-01)