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

Overcoming erasure errors with multilevel systems

38   0   0.0 ( 0 )
 نشر من قبل Sreraman Muralidharan
 تاريخ النشر 2015
  مجال البحث فيزياء
والبحث باللغة English




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

We investigate the usage of highly efficient error correcting codes of multilevel systems to protect encoded quantum information from erasure errors and implementation to repetitively correct these errors. Our scheme makes use of quantum polynomial codes to encode quantum information and generalizes teleportation based error correction for multilevel systems to correct photon losses and operation errors in a fault-tolerant manner. We discuss the application of quantum polynomial codes to one-way quantum repeaters. For various types of operation errors, we identify different parameter regions where quantum polynomial codes can achieve a superior performance compared to qubit based quantum parity codes.

قيم البحث

اقرأ أيضاً

The counterintuitive features of quantum physics challenge many common-sense assumptions. In an interferometric quantum eraser experiment, one can actively choose whether or not to erase which-path information, a particle feature, of one quantum syst em and thus observe its wave feature via interference or not by performing a suitable measurement on a distant quantum system entangled with it. In all experiments performed to date, this choice took place either in the past or, in some delayed-choice arrangements, in the future of the interference. Thus in principle, physical communications between choice and interference were not excluded. Here we report a quantum eraser experiment, in which by enforcing Einstein locality no such communication is possible. This is achieved by independent active choices, which are space-like separated from the interference. Our setup employs hybrid path-polarization entangled photon pairs which are distributed over an optical fiber link of 55 m in one experiment, or over a free-space link of 144 km in another. No naive realistic picture is compatible with our results because whether a quantum could be seen as showing particle- or wave-like behavior would depend on a causally disconnected choice. It is therefore suggestive to abandon such pictures altogether.
Quantum back action (QBA) of a measurement limits the precision of observation of the motion of a free mass. This profound effect dabbed the Heisenberg microscope in the early days of quantum mechanics, leads to the standard quantum limit (SQL) stemm ing from the balance between the measurement sensitivity and the QBA. Here we consider the measurement of motion of a free mass performed in a quantum reference frame with an effective negative mass which is not limited by QBA. As a result, the disturbance on the motion of a free mass can be measured beyond SQL. QBA-limited detection of motion for a free mass is extremely challenging, but there are devices where this effect is expected to play an essential role, namely, gravitational wave detectors (GWD) such as LIGO and VIRGO. Recent reports on observation of gravitational waves have opened new horizons in cosmology and astrophysics. Here we present a general idea and a detailed numerical analysis for QBA-evading measurement of the gravitational wave effect on the GWD mirrors which can be considered free masses under relevant conditions. The measurement is performed by two entangled beams of light probing the GWD and an auxiliary atomic spin ensemble, respectively. The latter plays a role of a free negative mass. We show that under realistic conditions the sensitivity of the GWD can be significantly increased over the entire frequency band of interest.
173 - Hatim Salih 2015
The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose an erasure-based protocol for quantum key distribution (QKD) that promises inherent security against detector attacks.
We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error co rrecting codes, thus allowing us to ``quantize all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.
With the rapid developments in quantum hardware comes a push towards the first practical applications on these devices. While fully fault-tolerant quantum computers may still be years away, one may ask if there exist intermediate forms of error corre ction or mitigation that might enable practical applications before then. In this work, we consider the idea of post-processing error decoders using existing quantum codes, which are capable of mitigating errors on encoded logical qubits using classical post-processing with no complicated syndrome measurements or additional qubits beyond those used for the logical qubits. This greatly simplifies the experimental exploration of quantum codes on near-term devices, removing the need for locality of syndromes or fast feed-forward, allowing one to study performance aspects of codes on real devices. We provide a general construction equipped with a simple stochastic sampling scheme that does not depend explicitly on a number of terms that we extend to approximate projectors within a subspace. This theory then allows one to generalize to the correction of some logical errors in the code space, correction of some physical unencoded Hamiltonians without engineered symmetries, and corrections derived from approximate symmetries. In this work, we develop the theory of the method and demonstrate it on a simple example with the perfect $[[5,1,3]]$ code, which exhibits a pseudo-threshold of $p approx 0.50$ under a single qubit depolarizing channel applied to all qubits. We also provide a demonstration under the application of a logical operation and performance on an unencoded hydrogen molecule, which exhibits a significant improvement over the entire range of possible errors incurred under a depolarizing channel.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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