Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNoise-Assisted Quantum Autoencoder
124
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limitations of the standard quantum autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verified the validity of our methods through compressing the thermal states of transverse field Ising model and Werner states. For pure state ensemble compression, we also introduce a projected quantum autoencoder algorithm.
rate research
Read More
We study experimentally the fundamental limits of sensitivity of an atomic radio-frequency magnetometer. First we apply an optimal sequence of state preparation, evolution, and the back-action evading measurement to achieve a nearly projection noise limited sensitivity. We furthermore experimentally demonstrate that Einstein-Podolsky-Rosen (EPR) entanglement of atoms generated by a measurement enhances the sensitivity to pulsed magnetic fields. We demonstrate this quantum limited sensing in a magnetometer utilizing a truly macroscopic ensemble of 1.5*10^12 atoms which allows us to achieve sub-femtoTesla/sqrt(Hz) sensitivity.
In the ideal quantum Zeno effect, repeated quantum projective measurements can freeze the coherent dynamics of a quantum system. However, in the weak quantum Zeno regime, measurement back-actions can allow the sensing of semi-classical field fluctuations. In this regard, we theoretically show how to combine the controlled manipulation of a quantum two-level system, used as a probe, with a sequence of projective measurements to have direct access to the noise correlation function. We experimentally test the effectiveness of the proposed noise sensing method on a properly engineered Bose-Einstein condensate of $^{87}Rb$ atoms realized on an atom chip. We believe that our quantum Zeno-based approach can open a new path towards novel quantum sensing devices.
I analyze a metrological strategy for improving the precision of frequency estimation via Ramsey interferometry with strings of atoms in the presence of correlated dephasing. This strategy does not employ entangled states, but rather a product state which evolves into a stationary state under the influence of correlated dephasing. It is shown that by using this state an improvement in precision compared to standard Ramsey interferometry can be gained. This improvement is not an improvement in scaling, i.e. the estimation precision has the same scaling with the number of atoms as the standard quantum limit, but an improvement proportional to the free evolution time in the Ramsey interferometer. Since a stationary state is used, this evolution time can be substantially larger than in standard Ramsey interferometry which is limited by the coherence time of the atoms.
Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximizing a well-defined loss-function: a quantum lower-bound to a variational approximation of the log-likelihood. We use quantum Monte Carlo (QMC) simulations to train and evaluate the performance of QVAEs. To achieve the best performance, we first create a VAE platform with discrete latent space generated by a restricted Boltzmann machine (RBM). Our model achieves state-of-the-art performance on the MNIST dataset when compared against similar approaches that only involve discrete variables in the generative process. We consider QVAEs with a smaller number of latent units to be able to perform QMC simulations, which are computationally expensive. We show that QVAEs can be trained effectively in regimes where quantum effects are relevant despite training via the quantum bound. Our findings open the way to the use of quantum computers to train QVAEs to achieve competitive performance for generative models. Placing a QBM in the latent space of a VAE leverages the full potential of current and next-generation quantum computers as sampling devices.
Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the Quantum-assisted Variational Autoencoder has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
