3 papers
quant-ph2025
From simulatability to universality of continuous-variable quantum computers
Cameron Calcluth
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the m…
quant-ph2024
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-ph2020
Efficient simulatability of continuous-variable circuits with large Wigner negativity
Laura García-Álvarez, Cameron Calcluth, Alessandro Ferraro +1
Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, estab…