Factoring an integer with three oscillators and a qubit
Lukas Brenner, Libor Caha, Xavier Coiteux-Roy, Robert Koenig

TL;DR
This paper presents a novel quantum algorithm for integer factorization using a hybrid qubit-oscillator system, leveraging continuous-variable Fourier transforms instead of traditional qubit-based methods.
Contribution
It introduces a new approach to quantum algorithms that exploits native continuous-variable operations, enabling factorization with minimal physical resources.
Findings
The algorithm runs in polynomial time for factoring integers.
It uses only a single qubit and three oscillators, independent of the integer size.
The approach relies on the continuous-variable Fourier transform rather than discrete Fourier transforms.
Abstract
A common starting point of traditional quantum algorithm design is the notion of a universal quantum computer with a scalable number of qubits. This convenient abstraction mirrors classical computations manipulating finite sets of symbols, and allows for a device-independent development of algorithmic primitives. Here we advocate an alternative approach centered on the physical setup and the associated set of natively available operations. We show that these can be leveraged to great benefit by sidestepping the standard approach of reasoning about computation in terms of individual qubits. As an example, we consider hybrid qubit-oscillator systems with linear optics operations augmented by certain qubit-controlled Gaussian unitaries. The continuous-variable (CV) Fourier transform has a native realization in such systems in the form of homodyne momentum measurements. We show that this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
