اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDenoising quantum states with Quantum Autoencoders -- Theory and Applications
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We implement a Quantum Autoencoder (QAE) as a quantum circuit capable of correcting Greenberger-Horne-Zeilinger (GHZ) states subject to various noisy quantum channels : the bit-flip channel and the more general quantum depolarizing channel. The QAE shows particularly interesting results, as it enables to perform an almost perfect reconstruction of noisy states, but can also, more surprisingly, act as a generative model to create noise-free GHZ states. Finally, we detail a useful application of QAEs : Quantum Secret Sharing (QSS). We analyze how noise corrupts QSS, causing it to fail, and show how the QAE allows the QSS protocol to succeed even in the presence of noise.
قيم البحث
اقرأ أيضاً
This is a pre-publication version of a forthcoming book on quantum atom optics. It is written as a senior undergraduate to junior graduate level textbook, assuming knowledge of basic quantum mechanics, and covers the basic principles of neutral atom
matter wave systems with an emphasis on quantum technology applications. The topics covered include: introduction to second quantization of many-body systems, Bose-Einstein condensation, the order parameter and Gross-Pitaevskii equation, spin dynamics of atoms, spinor Bose-Einstein condensates, atom diffraction, atomic interferometry beyond the standard limit, quantum simulation, squeezing and entanglement with atomic ensembles, quantum information with atomic ensembles. This book would suit students who wish to obtain the necessary skills for working with neutral atom many-body atomic systems, or could be used as a text for an undergraduate or graduate level course (exercises are included throughout). This is a near-final draft of the book, but inevitably errors may be present. If any errors are found, we welcome you to contact us and it will be corrected before publication. (TB: tim.byrnes[at]nyu.edu, EI: ebube[at]nyu.edu)
Entangled states are an important resource for quantum computation, communication, metrology, and the simulation of many-body systems. However, noise limits the experimental preparation of such states. Classical data can be efficiently denoised by au
toencoders---neural networks trained in unsupervised manner. We develop a novel quantum autoencoder that successfully denoises Greenberger-Horne-Zeilinger states subject to spin-flip errors and random unitary noise. Various emergent quantum technologies could benefit from the proposed unsupervised quantum neural networks.
Studying general quantum many-body systems is one of the major challenges in modern physics because it requires an amount of computational resources that scales exponentially with the size of the system.Simulating the evolution of a state, or even st
oring its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a new representation of states based on variational autoencoders. Variational autoencoders are a type of generative model in the form of a neural network. We probe the power of this representation by encoding probability distributions associated with states from different classes. Our simulations show that deep networks give a better representation for states that are hard to sample from, while providing no benefit for random states. This suggests that the probability distributions associated to hard quantum states might have a compositional structure that can be exploited by layered neural networks. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterising states of the size expected in first generation quantum hardware.
Entanglement is a powerful resource for processing quantum information. In this context pure, maximally entangled states have received considerable attention. In the case of bipartite qubit-systems the four orthonormal Bell-states are of this type. O
ne of these Bell states, the singlet Bell-state, has the additional property of being antisymmetric with respect to particle exchange. In this contribution we discuss possible generalizations of this antisymmetric Bell-state to cases with more than two particles and with single-particle Hilbert spaces involving more than two dimensions. We review basic properties of these totally antisymmetric states. Among possible applications of this class of states we analyze a new quantum key sharing protocol and methods for comparing quantum states.
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the
braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al. that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
