Unknown

Dataset Information

0

Demonstration of Shor's factoring algorithm for N [Formula: see text] 21 on IBM quantum processors.


ABSTRACT: We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration. We go beyond this work by using a configuration of approximate Toffoli gates with residual phase shifts, which preserves the functional correctness and allows us to achieve a complete factoring of [Formula: see text]. We implemented the algorithm on IBM quantum processors using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general. The techniques we employ may be useful in carrying out Shor's algorithm for larger integers, or other algorithms in systems with a limited number of noisy qubits.

SUBMITTER: Skosana U 

PROVIDER: S-EPMC8368060 | biostudies-literature |

REPOSITORIES: biostudies-literature

Similar Datasets

| S-EPMC8494935 | biostudies-literature
| S-EPMC8595440 | biostudies-literature
| S-EPMC4410410 | biostudies-other
| S-EPMC6347626 | biostudies-literature
| S-EPMC8671446 | biostudies-literature
| S-EPMC7498615 | biostudies-literature
| S-EPMC8184963 | biostudies-literature
| S-EPMC8571276 | biostudies-literature
| S-EPMC7462913 | biostudies-literature
| S-EPMC9242999 | biostudies-literature