ترغب بنشر مسار تعليمي؟ اضغط هنا

Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements

68   0   0.0 ( 0 )
 نشر من قبل Timo Hillmann
 تاريخ النشر 2021
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing. A broad class of bosonic codes, namely rotation-symmetric codes, can be characterized by their phase-space rotation symmetry. However, their performance has been examined to date only within an idealistic noise model. Here, we further analyze the error correction capabilities of rotation-symmetric codes using a teleportation-based error correction circuit. To this end, we numerically compute the average gate fidelity including measurement errors into the noise model of the data qubit. Focusing on physical measurements models, we assess the performance of heterodyne and adaptive homodyne detection in comparison to the previously studied canonical phase measurement. This setting allows us to shed light on the role of different currently available measurement schemes when decoding the encoded information. We find that with the currently achievable measurement efficiencies in microwave optics bosonic rotation codes undergo a substantial decrease in their break-even potential. The results are compared to Gottesman-Kitaev-Preskill codes using a similar error correction circuit which show a greater reduction in performance together with a vulnerability to photon number dephasing. Our results show that highly efficient measurement protocols constitute a crucial building block towards error-corrected quantum information processing with bosonic continuous-variable systems.



قيم البحث

اقرأ أيضاً

Quantum repeaters are essential ingredients for quantum networks that link distant quantum modules such as quantum computers and sensors. Motivated by distributed quantum computing and communication, quantum repeaters that relay discrete-variable qua ntum information have been extensively studied; while continuous-variable (CV) quantum information underpins a variety of quantum sensing and communication application, a quantum-repeater architecture for genuine CV quantum information remains largely unexplored. This paper reports a CV quantum-repeater architecture based on CV quantum teleportation assisted by the Gottesman-Kitaev-Preskill (GKP) code to significantly suppress the physical noise. The designed CV quantum-repeater architecture is shown to significantly improve the performance of CV quantum key distribution, entanglement-assisted communication, and target detection based on quantum illumination, as three representative use cases for quantum communication and sensing.
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of error-correction dis tinguished by different orthogonal vector subspaces, the coset subspaces. Moreover, the generated codes can be classified into four types with respect to the spinors in the unitary Lie algebra and a chosen initial quantum state.
Quantum error correction is widely thought to be the key to fault-tolerant quantum computation. However, determining the most suited encoding for unknown error channels or specific laboratory setups is highly challenging. Here, we present a reinforce ment learning framework for optimizing and fault-tolerantly adapting quantum error correction codes. We consider a reinforcement learning agent tasked with modifying a family of surface code quantum memories until a desired logical error rate is reached. Using efficient simulations with about 70 data qubits with arbitrary connectivity, we demonstrate that such a reinforcement learning agent can determine near-optimal solutions, in terms of the number of data qubits, for various error models of interest. Moreover, we show that agents trained on one setting are able to successfully transfer their experience to different settings. This ability for transfer learning showcases the inherent strengths of reinforcement learning and the applicability of our approach for optimization from off-line simulations to on-line laboratory settings.
Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to design dec oding algorithms. Here we propose and implement decoding algorithms for the three-dimensional X-cube model. In our example, decoding is parallelized into a series of two-dimensional matching problems, thus significantly simplifying the most time consuming component of the decoder. We also find that the rigid structure of its point excitations enable us to obtain high threshold error rates. Our decoding algorithms bring to light some key ideas that we expect to be useful in the design of decoders for general topological stabilizer codes. Moreover, the notion of parallelization unifies several concepts in quantum error correction. We conclude by discussing the broad applicability of our methods, and we explain the connection between parallelizable codes and other methods of quantum error correction. In particular we propose that the new concept represents a generalization of single-shot error correction.
Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct errors with out destroying coherence by using quantum error correcting codes [1]. The simplest of these are the three-qubit codes, which map a one-qubit state to an entangled three-qubit state and can correct any single phase-flip or bit-flip error of one of the three qubits, depending on the code used [2]. Here we demonstrate both codes in a superconducting circuit by encoding a quantum state as previously shown [3,4], inducing errors on all three qubits with some probability, and decoding the error syndrome by reversing the encoding process. This syndrome is then used as the input to a three-qubit gate which corrects the primary qubit if it was flipped. As the code can recover from a single error on any qubit, the fidelity of this process should decrease only quadratically with error probability. We implement the correcting three-qubit gate, known as a conditional-conditional NOT (CCNot) or Toffoli gate, using an interaction with the third excited state of a single qubit, in 63 ns. We find 85pm1% fidelity to the expected classical action of this gate and 78pm1% fidelity to the ideal quantum process matrix. Using it, we perform a single pass of both quantum bit- and phase-flip error correction with 76pm0.5% process fidelity and demonstrate the predicted first-order insensitivity to errors. Concatenating these two codes and performing them on a nine-qubit device would correct arbitrary single-qubit errors. When combined with recent advances in superconducting qubit coherence times [5,6], this may lead to scalable quantum technology.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا