Phys.org May 4, 2023
If two integers are entered as the input value, the computer circuit returns their product. Researchers in Austria developed inversion of algorithms with the help of quantum computers. The logic of the circuit was encoded within ground states of a quantum system. Both multiplication and factorization could be understood as ground-state problems and solved using quantum optimization methods. The core of their work was the encoding of the basic building blocks of the multiplier circuit, specifically AND gates, half, and full adders with the parity architecture as the ground state problem on an ensemble of interacting spins. The coding allowed the entire circuit to be built from repeating subsystems that was arranged on a two-dimensional grid. By stringing several of these subsystems together, larger problem instances were realized. Unlike the classical brute force method, where all possible factors are tested, quantum methods can speed up the search process. According to the researchers their work provides a blueprint for a new type of quantum computer to solve the factorization problem, a cornerstone of modern cryptography. It can be implemented on all current quantum computing platforms… read more. Open Access TECHNICAL ARTICLE
Blueprint for parity factorization – Three-dimensional layout. Credit:Â Communications Physics volume 6, Article number: 73 (2023)Â