Ghost factors in Gauss-sum factorization with transmon qubits
A challenge in the Gauss sums factorization scheme is the presence of ghost factors - non-factors that behave similarly to actual factors of an integer - which might lead to the misidentification of non-factors as factors or vice versa, especially in the presence of noise. We investigate Type II...
Saved in:
Main Authors: | , , , , , , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/164308 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Summary: | A challenge in the Gauss sums factorization scheme is the presence of ghost
factors - non-factors that behave similarly to actual factors of an integer -
which might lead to the misidentification of non-factors as factors or vice
versa, especially in the presence of noise. We investigate Type II ghost
factors, which are the class of ghost factors that cannot be suppressed with
techniques previously laid out in the literature. The presence of Type II ghost
factors and the coherence time of the qubit set an upper limit for the total
experiment time, and hence the largest factorizable number with this scheme.
Discernability is a figure of merit introduced to characterize this behavior.
We introduce preprocessing as a strategy to increase the discernability of a
system, and demonstrate the technique with a transmon qubit. This can bring the
total experiment time of the system closer to its decoherence limit, and
increase the largest factorizable number. |
---|