activity
20232026
most citedSufficient condition for universal quantum computation using bosonic circuits

10 citations · 12 across the 5 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2026

Bosonic quantum error-correcting codes with finite stellar rank

Rui Wang, Adithi Udupa, Timo Hillmann +3

Bosonic quantum error correction (QEC) relies on non-Gaussian bosonic encodings whose preparation cost is a central practical constraint. In this work, we use stellar rank as a res…

quant-ph2025

Towards fault-tolerant quantum computation with universal continuous-variable gates

Sheron Blair, Francesco Arzani, Giulia Ferrini +1

Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Withi…

quant-ph2024★ 1 cited

Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states

Cameron Calcluth, Oliver Hahn, Juani Bermejo-Vega +2

Classically simulating circuits with bosonic codes is challenging due to the prohibitive cost of simulating quantum systems with many, possibly infinite, energy levels. We propose…

quant-ph2024★ 1 cited

Assessing non-Gaussian quantum state conversion with the stellar rank

Oliver Hahn, Maxime Garnier, Giulia Ferrini +2

State conversion is a fundamental task in quantum information processing. Quantum resource theories allow for analyzing and bounding conversions that use restricted sets of operati…

quant-ph2023★ 10 cited

Sufficient condition for universal quantum computation using bosonic circuits

Cameron Calcluth, Nicolas Reichel, Alessandro Ferraro +1

Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess the…