Cameron Calcluth

Cameron Calcluth

Auto-generated profile, based on publicly available information

Cameron Calcluth

Department of Microtechnology and Nanoscience (MC2) Chalmers University of Technology SE-412 96 Göteborg Sweden

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 December 2020 in Physical Review Research
Verified
Journal Article
Open access
PDF file
LGLaura García-Álvarez
Laura García-Álvarez
CCCameron Calcluth
Cameron Calcluth
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, establishing such a boundary is akin to pinpointing the resources for quantum advantage; from the technological point of view, it is essential for the design of nontrivial quantum computing architectures. Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures, including those based on continuous variables (CVs). However, it is not a sufficient resource, and it is an open question under which conditions CV circuits displaying Wigner negativity offer the potential for quantum advantage. In this work we identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable, although they are not recognized as such by previously available theorems. These families of circuits employ bosonic codes based on either translational or rotational symmetries (e.g., Gottesman-Kitaev-Preskill or cat codes) and can include both Gaussian and non-Gaussian gates and measurements. Crucially, within these encodings, the computational basis states are described by intrinsically negative Wigner functions, even though they are stabilizer states if considered as codewords belonging to a finite-dimensional Hilbert space. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.

1 December 2022 in Quantum
Verified
Journal Article
Open access
PDF file
CCCameron Calcluth
Cameron Calcluth
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems such as the Gottesman-Knill theorem can be employed to assess the simulatability. We first develop a method to evaluate the probability density function corresponding to measuring a single GKP state in the position basis following arbitrary squeezing and a large set of rotations. This method involves evaluating a transformed Jacobi theta function using techniques from analytic number theory. We then use this result to identify two large classes of multimode circuits which are classically efficiently simulatable and are not contained by the GKP encoded Clifford group. Our results extend the set of circuits previously known to be classically efficiently simulatable.

17 May 2024 in PRX Quantum
Verified
Journal Article
Open access
PDF file
CCCameron Calcluth
Cameron Calcluth
NRNicolas Reichel
Nicolas Reichel
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest. Published by the American Physical Society 2024

15 June 2023 in Physical Review A
Verified
Journal Article
Open access
PDF file
CCCameron Calcluth
Cameron Calcluth
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states, Gaussian operations including all rational symplectic operations and all real displacements, and homodyne measurement. We prove that such architecture is classically efficiently simulatable by explicitly providing an algorithm to calculate the probability density function of the measurement outcomes of the computation. We also provide a method to sample when the circuits contain conditional operations. This result is based on an extension of the celebrated Gottesman-Knill theorem, via introducing proper stabilizer operators for the code at hand. We conclude that the resource enabling quantum advantage in the universal computational model considered by Baragiola et al. [ Phys. Rev. Lett. 123, 200502 (2019)], composed of a subset of the elements given above augmented with a provision of vacuum states, is indeed the vacuum state.

1 July 2025 in Physical Review Letters
Verified
Journal Article
Open access
CCCameron Calcluth
Cameron Calcluth
OHOliver Hahn
Oliver Hahn
JBJuani Bermejo-Vega
Juani Bermejo-Vega
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
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 an algorithm to simulate circuits with encoded Gottesman-Kitaev-Preskill (GKP) states, specifically for odd-dimensional encoded qudits. Our approach is tailored to be especially effective in the most challenging but practically relevant regime, where the codeword states exhibit high (but finite) squeezing. Our algorithm leverages the Zak-Gross Wigner function introduced by Davis, Fabre, and Chabaud, which represents infinitely squeezed encoded stabilizer states positively. The run-time of the algorithm scales with the negativity of the Wigner function, allowing for efficient simulation of certain large-scale circuits—namely, input stabilizer GKP states undergoing generalized GKP-encoded Clifford operations followed by modular measurement—with a high degree of squeezing. For stabilizer GKP states exhibiting 12 dB of squeezing, our algorithm can simulate circuits with up to 1000 modes with less than double the number of samples required for a single input mode, which is in stark contrast to existing simulators. Therefore, this approach holds significant potential for benchmarking early implementations of quantum computing architectures utilizing bosonic codes.

5 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
CCCameron Calcluth
Cameron Calcluth
NRNicolas Reichel
Nicolas Reichel
AFAlessandro Ferraro
Alessandro Ferraro
GFGiulia Ferrini
Giulia Ferrini
Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest.