Ghost factors in Gauss-sum factorization with transmon qubits
arXiv:2104.11368 · doi:10.1103/PhysRevA.104.062606
Abstract
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.
arXiv comment14 pages, 8 figures, 2 appendices
References in corpus (25)
- Quantum Computing in the NISQ era and beyond
- A Quantum Engineer's Guide to Superconducting Qubits
- Quantum Algorithms Revisited
- Dynamical decoupling and noise spectroscopy with a superconducting flux qubit
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Decoherence and 1/f noise in Josephson qubits
- Model for l/f Flux Noise in SQUIDs and Qubits
- A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
- Quantum search without entanglement
- Arbitrary quantum control of qubits in the presence of universal noise
- NMR experiment factors numbers with Gauss sums
- Factorization of Numbers with the temporal Talbot effect: Optical implementation by a sequence of shaped ultrashort pulses
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- Gauss sum factorization with cold atoms
- Prime factorization using quantum annealing and computational algebraic geometry
- Demonstration of Shor's factoring algorithm for N=21 on IBM quantum processors
- Quantum interference as a resource for quantum speedup
- Factorizing Numbers with the Gauss Sum Technique: NMR Implementations
- Factoring numbers with a single interferogram
- Prime Number Decomposition using the Talbot Effect
- Factorization of numbers with Gauss sums: I. Mathematical background
- Factorizing numbers with classical interference: several implementations in optics
- Quantum phase measurement and Gauss sum factorization of large integers in a superconducting circuit
- Factorization of numbers with Gauss sums: II. Suggestions for implementations with chirped laser pulses
- Factorization of numbers with Gauss sums: III. Algorithms with Entanglement