4 papers · 1 filter
Layer codes as partially self-correcting quantum memories
Shouzhen Gu, Libor Caha, Shin Ho Choe +3
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for se…
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…
Single-qubit gate teleportation provides a quantum advantage
Libor Caha, Xavier Coiteux-Roy, Robert Koenig
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput.,…
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…