A variational quantum algorithm for entanglement quantification

Abstract

Quantum entanglement is a foundational resource in quantum information science, underpinning applications across physics. However, detecting and quantifying entanglement remains a significant challenge. In this article, we introduce a variational quantum algorithm inspired by Uhlmann's theorem to quantify the Bures entanglement of general quantum states, a method that naturally extends to other quantum resources, including genuine multipartite entanglement, quantum discord, quantum coherence, and total correlations, while also enabling reconstruction of the closest free states. The algorithm requires a polynomial number of ancillary qubits and circuit depth relative to the system size, dimensionality, and free state cardinality, making it scalable for practical implementations. Thus, it provides a versatile framework for quantifying quantum resources, demonstrated here through several applications.

References in corpus (38)

• Quantum entanglement
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• Entanglement detection
• Barren plateaus in quantum neural network training landscapes
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum fingerprinting
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Quantum algorithms for quantum chemistry and quantum materials science
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Advances in High Dimensional Quantum Entanglement
• Quantum convolutional neural network for classical data classification
• Measures and applications of quantum correlations
• Effect of barren plateaus on gradient-free optimization
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• A Separability-Entanglement Classifier via Machine Learning
• Witnessing genuine multipartite entanglement with positive maps
• Linking a distance measure of entanglement to its convex roof
• Experimental bound entanglement in a four-photon state
• Unifying approach to the quantification of bipartite correlations by Bures distance
• Hybrid quantum ResNet for car classification and its hyperparameter optimization
• Detecting and quantifying entanglement on near-term quantum devices
• Natural Evolutionary Strategies for Variational Quantum Computation
• Mitigating Barren Plateaus with Transfer-learning-inspired Parameter Initializations
• Quantifying Unknown Quantum Entanglement via a Hybrid Quantum-Classical Machine Learning Framework
• Macroscopic bound entanglement in thermal graph states
• Entanglement detection with classical deep neural networks
• The quantum cost function concentration dependency on the parametrization expressivity
• Variational determination of multi-qubit geometrical entanglement in NISQ computers
• Evolution strategies: Application in hybrid quantum-classical neural networks
• Preparing tunable Bell-diagonal states on a quantum computer
• Linear-optical simulation of the cooling of a cluster-state Hamiltonian system
• Near-term Efficient Quantum Algorithms for Entanglement Analysis
• Swap Test with Quantum-Dot Charge Qubits
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• Learning to learn with an evolutionary strategy applied to variational quantum algorithms
• Barren plateaus are amplified by the dimension of qudits