Schmidt quantum compressor

Abstract

This work introduces the Schmidt quantum compressor, an innovative approach to quantum data compression that leverages the principles of Schmidt decomposition to encode quantum information efficiently. In contrast to traditional variational quantum autoencoders, which depend on stochastic optimization and face challenges such as shot noise, barren plateaus, and non-convex optimization landscapes, our deterministic method substantially reduces the complexity and computational overhead of quantum data compression. We evaluate the performance of the compressor through numerical experiments, demonstrating its ability to achieve high fidelity in quantum state reconstruction compared to variational quantum algorithms. Furthermore, we demonstrate the practical utility of the Schmidt quantum compressor in one-class classification tasks.

References in corpus (50)

• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• Quantum principal component analysis
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Parameterized quantum circuits as machine learning models
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Circuit-centric quantum classifiers
• Quantum random access memory
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Challenges and Opportunities in Quantum Machine Learning
• Synthesis of Quantum Logic Circuits
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Quantum autoencoders for efficient compression of quantum data
• Training variational quantum algorithms is NP-hard
• Quantum Circuits for General Multiqubit Gates
• Quantum-state preparation with universal gate decompositions
• Robust data encodings for quantum classifiers
• Hierarchical quantum classifiers
• Implementing a distance-based classifier with a quantum interference circuit
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Distributed Quantum Computing: a Survey
• A quantum linear system algorithm for dense matrices
• Quantum Circuits for Isometries
• Quantum Entanglement in Deep Learning Architectures
• What limits the simulation of quantum computers?
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• A divide-and-conquer algorithm for quantum state preparation
• Quantum circuits with uniformly controlled one-qubit gates
• Circuit-Based Quantum Random Access Memory for Classical Data
• Quantum singular value decomposition of non-sparse low-rank matrices
• Qibo: a framework for quantum simulation with hardware acceleration
• Probabilistic Quantum Memories
• Quantum autoencoders via quantum adders with genetic algorithms
• Quantum Data Compression of a Qubit Ensemble
• Realization of a quantum autoencoder for lossless compression of quantum data
• Noise-Assisted Quantum Autoencoder
• Efficient compression of quantum information
• Circuit-based quantum random access memory for classical data with continuous amplitudes
• Quantum Circuits for Sparse Isometries
• Configurable sublinear circuits for quantum state preparation
• Quantum autoencoders with enhanced data encoding
• Quantum Mixed State Compiling
• Low-rank quantum state preparation
• Variational quantum one-class classifier
• Hierarchical quantum circuit representations for neural architecture search
• Neural Quantum Embedding: Pushing the Limits of Quantum Supervised Learning
• Implementation of quantum compression on IBM quantum computers
• Quantum support vector data description for anomaly detection