Disentangling quantum autoencoder

Abstract

Entangled quantum states are highly sensitive to noise, which makes it difficult to transfer them over noisy quantum channels or to store them in quantum memory. Here, we propose the disentangling quantum autoencoder (DQAE) to encode entangled states into single-qubit product states. The DQAE provides an exponential improvement in the number of copies needed to transport entangled states across qubit-loss or leakage channels compared to unencoded states. The DQAE can be trained in an unsupervised manner from entangled quantum data. For general states, we train via variational quantum algorithms based on gradient descent with purity-based cost functions, while stabilizer states can be trained via a Metropolis algorithm. For particular classes of states, the number of training data needed to generalize is surprisingly low: For stabilizer states, DQAE generalizes by learning from a number of training data that scales linearly with the number of qubits, while only $1$ training sample is sufficient for states evolved with the transverse-field Ising Hamiltonian. Our work provides practical applications for enhancing near-term quantum computers.

13 pages, 11 figures

References in corpus (44)

• Quantum entanglement
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Circuit Learning
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum autoencoders for efficient compression of quantum data
• Generalization in quantum machine learning from few training data
• Quantum Error Correction: An Introductory Guide
• Quantum generalisation of feedforward neural networks
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• The SWAP test and the Hong-Ou-Mandel effect are equivalent
• Theory of overparametrization in quantum neural networks
• Generalization in Quantum Machine Learning: a Quantum Information Perspective
• Optimal quantum learning of a unitary transformation
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• Quantum autoencoders to denoise quantum data
• Scalable measures of magic resource for quantum computers
• Experimental Realization of a Quantum Autoencoder: The Compression of Qutrits via Machine Learning
• Disentangling Scrambling and Decoherence via Quantum Teleportation
• Emergent irreversibility and entanglement spectrum statistics
• Out-of-distribution generalization for learning quantum dynamics
• Deterministic correction of qubit loss
• Quantum autoencoders via quantum adders with genetic algorithms
• Quantum Data Compression of a Qubit Ensemble
• Noise-Assisted Quantum Autoencoder
• Efficient compression of quantum information
• Augmenting Density Matrix Renormalization Group with Clifford Circuits
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Quantum Error Correction with Quantum Autoencoders
• Dynamical simulation via quantum machine learning with provable generalization
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Retrieving information from a black hole using quantum machine learning
• Hybrid Stabilizer Matrix Product Operator
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Clifford Dressed Time-Dependent Variational Principle
• Stabilizer disentangling of conformal field theories
• Efficient algorithms for quantum information bottleneck
• Implementation of quantum compression on IBM quantum computers
• Quantum transfer of interacting qubits
• Multipartite entanglement measures via Bell basis measurements
• Cross-Platform Verification in Quantum Networks
• Rigorous noise reduction with quantum autoencoders
• Information compression via hidden subgroup quantum autoencoders