Factoring an integer with three oscillators and a qubit
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 bits. It allows for a device-independent development of algorithmic primitives. Here we argue that an alternative approach centered on the physical setup can yield great benefits. As an example, we consider hybrid qubit-oscillator systems with linear optics operations augmented by certain qubit-controlled Gaussian unitaries. The continuous variable Fourier transform and certain arithmetic operations have native realizations in such systems. We put this to algorithmic use and give a polynomial-time quantum factoring algorithm which uses only one qubit and three oscillators, independent of the number being factored.
Authors
- Libor Caha (ORCID: https://orcid.org/0000-0001-7401-8076)
- Xavier Coiteux-Roy (ORCID: https://orcid.org/0000-0002-7355-4632)
- Robert Koenig (ORCID: https://orcid.org/0000-0002-0563-1229)
- Lukas Brenner (ORCID: https://orcid.org/0009-0005-2828-365X)
Institutions
- University of Calgary (CA)
- Munich Center for Quantum Science and Technology (DE)
- Technical University of Munich (DE)
Publication Details
- Journal
- Nature Communications
- Published
- 2025-12-26
- DOI
- https://doi.org/10.1038/s41467-025-67694-5
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung