اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEquivalence of approximate Gottesman-Kitaev-Preskill codes
104
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Gottesman-Kitaev-Preskill (GKP) quantum error correcting code attracts much attention in continuous variable (CV) quantum computation and CV quantum communication due to the simplicity of error correcting routines and the high tolerance against Gaussian errors. Since the GKP code state should be regarded as a limit of physically meaningful approximate ones, various approximations have been developed until today, but explicit relations among them are still unclear. In this paper, we rigorously prove the equivalence of these approximate GKP codes with an explicit correspondence of the parameters. We also propose a standard form of the approximate code states in the position representation, which enables us to derive closed-from expressions for the Wigner functions, the inner products, and the average photon numbers in terms of the theta functions. Our results serve as fundamental tools for further analyses of fault-tolerant quantum computation and channel coding using approximate GKP codes.
قيم البحث
اقرأ أيضاً
Continuous-variable quantum-computing (CVQC) is the most scalable implementation of QC to date but requires non-Gaussian resources to allow exponential speedup and quantum correction, using error encoding such as Gottesman-Kitaev-Preskill (GKP) state
s. However, GKP state generation is still an experimental challenge. We show theoretically that photon catalysis, the interference of coherent states with single-photon states followed by photon-number-resolved detection, is a powerful enabler for non-Gaussian quantum state engineering such as exactly displaced single-photon states and $M$-symmetric superpositions of squeezed vacuum (SSV), including squeezed cat states ($M=2$). By including photon-counting based state breeding, we demonstrate the potential to enlarge SSV states and produce GKP states.
Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode
information in single- or multi-photon states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for deterministic Gaussian entangling operations and Bell measurements, which can be implemented at room temperature. The GKP encoding is also capable of correcting small displacement errors. At the cost of additional Gaussian noise, photon loss can be converted into a random displacement error channel by applying a phase-insensitive amplifier. Here we show that a similar conversion can be achieved in two-way repeater protocols by using phase-sensitive amplification applied in the post-processing of the measurement data, resulting in less overall Gaussian noise per (sufficiently short) repeater segment. We also investigate concatenating the GKP code with higher level qubit codes while leveraging analog syndrome data, post-selection, and path-selection techniques to boost the rate of communication. We compute the secure key rates and find that GKP repeaters can achieve a comparative performance relative to methods based on photonic qubits while using orders-of-magnitude fewer qubits.
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulatio
n of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.
Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-
energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. We determine the transformation rules for the covariance matrix and the mean displacement vector of the Gaussian distribution of the ensemble under tools such as GKP-Steane error correction and fusion operations that can be used to grow large, high-fidelity GKP-qubit graph states. The former captures the noise in the graph state due to the finite-energy approximation of GKP qubits, while the latter relates to the possible absolute displacement errors on the individual qubits due to the homodyne measurements that are a part of these tools. The rules thus help in pinning down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error correction properties.
In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman-Kitaev-Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum computati
on in discrete-variable (DV) systems, i.e. non-stabilizer states, and negativity of the Wigner function in CV architectures, which is a necessary requirement for quantum advantage. In particular, we show that the lowest Wigner logarithmic negativity of qubit states encoded in CV with the GKP mapping corresponds to encoded stabilizer states, while the maximum negativity is associated with the most non-stabilizer states, H-type and T-type quantum states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
