7 citations · 9 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024★ 1 cited
Factoring an integer with three oscillators and a qubit
Lukas Brenner, Libor Caha, Xavier Coiteux-Roy +1
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…
quant-ph2024★ 1 cited
The complexity of Gottesman-Kitaev-Preskill states
Lukas Brenner, Libor Caha, Xavier Coiteux-Roy +1
We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operatio…