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 |
id |
sg-ntu-dr.10356-164308 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1643082023-02-28T20:09:26Z Ghost factors in Gauss-sum factorization with transmon qubits Zaw, Lin Htoo Tan, Paul Yuanzheng Nguyen, Long Hoang Budoyo, Rangga P. Park, Kun Hee Koh, Zhi Yang Landra, Alessandro Hufnagel, Christoph Yap, Yung Szen Koh, Teck Seng Dumke, Rainer School of Physical and Mathematical Sciences Science::Physics Coherence Time Decoherence 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. Published version L.H.Z. was supported by the SGUnited program (Program No. CP0002392). Y.P.T. was supported by the SGUnited program (Program No. R00003494). 2023-01-16T02:02:16Z 2023-01-16T02:02:16Z 2021 Journal Article Zaw, L. H., Tan, P. Y., Nguyen, L. H., Budoyo, R. P., Park, K. H., Koh, Z. Y., Landra, A., Hufnagel, C., Yap, Y. S., Koh, T. S. & Dumke, R. (2021). Ghost factors in Gauss-sum factorization with transmon qubits. Physical Review A, 104(6), 062606-1-062606-13. https://dx.doi.org/10.1103/PhysRevA.104.062606 2469-9926 https://hdl.handle.net/10356/164308 10.1103/PhysRevA.104.062606 2-s2.0-85121876240 6 104 062606-1 062606-13 en CP0002392 R00003494 Physical Review A © 2021 American Physical Society. All rights reserved. This paper was published in Physical Review A and is made available with permission of American Physical Society. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Physics Coherence Time Decoherence |
spellingShingle |
Science::Physics Coherence Time Decoherence Zaw, Lin Htoo Tan, Paul Yuanzheng Nguyen, Long Hoang Budoyo, Rangga P. Park, Kun Hee Koh, Zhi Yang Landra, Alessandro Hufnagel, Christoph Yap, Yung Szen Koh, Teck Seng Dumke, Rainer Ghost factors in Gauss-sum factorization with transmon qubits |
description |
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. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Zaw, Lin Htoo Tan, Paul Yuanzheng Nguyen, Long Hoang Budoyo, Rangga P. Park, Kun Hee Koh, Zhi Yang Landra, Alessandro Hufnagel, Christoph Yap, Yung Szen Koh, Teck Seng Dumke, Rainer |
format |
Article |
author |
Zaw, Lin Htoo Tan, Paul Yuanzheng Nguyen, Long Hoang Budoyo, Rangga P. Park, Kun Hee Koh, Zhi Yang Landra, Alessandro Hufnagel, Christoph Yap, Yung Szen Koh, Teck Seng Dumke, Rainer |
author_sort |
Zaw, Lin Htoo |
title |
Ghost factors in Gauss-sum factorization with transmon qubits |
title_short |
Ghost factors in Gauss-sum factorization with transmon qubits |
title_full |
Ghost factors in Gauss-sum factorization with transmon qubits |
title_fullStr |
Ghost factors in Gauss-sum factorization with transmon qubits |
title_full_unstemmed |
Ghost factors in Gauss-sum factorization with transmon qubits |
title_sort |
ghost factors in gauss-sum factorization with transmon qubits |
publishDate |
2023 |
url |
https://hdl.handle.net/10356/164308 |
_version_ |
1759858157395378176 |