Related papers: Bridging magic and non-Gaussian resources via Gott…
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity…
The Gottesman-Kitaev-Preskill (GKP) coding is proven to be a good candidate for encoding a qubit on continuous variables (CV) since it is robust under random-shift disturbance. Its preparation in optical systems, however, is challenging to…
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 operations include Gaussian one- and two-mode operations, single-…
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-behaved magic monotone that operationally quantifies the…
A quantum computer with low-error, high-speed quantum operations and capability for interconnections is required for useful quantum computations. A logical qubit called Gottesman-Kitaev-Preskill (GKP) qubit in a single Bosonic harmonic…
We introduce a novel formulation of a Generalized Gottesman-Kitaev-Preskill (GKP) state that resolves all of its foundational pathologies, such as infinite energy, non-normalizability, and orthogonality. We demonstrate that these issues are…
We demonstrate how recent protocols developed for the stabilization of Gottesman-Kitaev-Preskill (GKP) states can be used for the estimation of two-quadrature displacement sensing, with sensitivities approaching the multivariate quantum…
The main bottleneck for universal quantum computation with traveling light is the preparation of Gottesman-Kitaev-Preskill states of sufficient quality. This is an extremely challenging task, experimental as well as theoretical, also…
To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum…
Continuous-variable (CV) systems have shown remarkable potential for quantum computation, particularly excelling in scalability and error correction through bosonic encoding. Within this framework, the foundational notion of computational…
Classically hard to simulate quantum states, or "magic states", are prerequisites to quantum advantage, highlighting an apparent separation between classically and quantumly tractable problems. Classically simulable states such as Clifford…
We propose a quantum error correction protocol for continuous-variable finite-energy, approximate Gottesman-Kitaev-Preskill (GKP) states undergoing small Gaussian random displacement errors, based on the scheme of Glancy and Knill [Phys.…
Practical utilization of Gottesman-Kitaev-Preskill (GKP) qubits requires not only the preparation of logical basis states, but also the ability to prepare and evaluate arbitrary logical qubit superpositions. Currently, this is typically…
In continuous-variable quantum information processing, quantum error correction of Gaussian errors requires simultaneous estimation of both quadrature components of displacements on phase space. However, quadrature operators $x$ and $p$ are…
The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\hat{p}$ and $\hat{q}$ quadratures, it is necessary to concatenate the…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…
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…
Decoherence errors arising from noisy environments remain a central obstacle to progress in quantum computation and information processing. Quantum error correction (QEC) based on the Gottesman-Kitaev-Preskill (GKP) protocol offers a…
The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill as a way to encode a qubit in an oscillator. The GKP codewords are coherent superpositions of periodically displaced…