Near-term Efficient Quantum Algorithms for Entanglement Analysis
arXiv:2109.10785 · doi:10.1103/PhysRevApplied.20.024071
Abstract
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing methods. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty. The first algorithm finds the Schmidt decomposition--a powerful tool to analyze the properties and structure of entanglement--for bipartite pure states. While the logarithm negativity can be calculated from the Schmidt decomposition, we propose the second algorithm to estimate the logarithm negativity for bipartite pure states, where the width of the parameterized quantum circuits is further reduced. Finally, we generalize our framework for mixed states, leading to our third algorithm which detects entanglement on specific families of states, and determines disdillability in general. All three algorithms share a similar framework where the optimizations are accomplished by maximizing a cost function utilizing local parameterized quantum circuits, with better hardware efficiency and practicality compared to existing methods. The experimental implementation on Quantum Leaf using the IoP CAS superconducting quantum processor exhibits the validity and practicality of our methods for analyzing and quantifying entanglement on near-term quantum devices.
arXiv comment16 pages, 9 figures, v3 is close to the published version
References in corpus (46)
- Quantum entanglement
- Experimental quantum teleportation
- A computable measure of entanglement
- Quantum Machine Learning
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- Peres-Horodecki separability criterion for continuous variable systems
- Quantum Communication
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Quantum Circuit Learning
- Quantum Chemistry in the Age of Quantum Computing
- Superconducting Qubits: Current State of Play
- Trapped-Ion Quantum Computing: Progress and Challenges
- Parameterized quantum circuits as machine learning models
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Evaluating analytic gradients on quantum hardware
- Circuit-centric quantum classifiers
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum autoencoders for efficient compression of quantum data
- Quantum Natural Gradient
- Variational Quantum Computation of Excited States
- Entangled state quantum cryptography: Eavesdropping on the Ekert protocol
- Quantum-state preparation with universal gate decompositions
- Layerwise learning for quantum neural networks
- Subspace-search variational quantum eigensolver for excited states
- Structure optimization for parameterized quantum circuits
- Variational Quantum State Diagonalization
- Sequential minimal optimization for quantum-classical hybrid algorithms
- Local environment can enhance fidelity of quantum teleportation
- Large gradients via correlation in random parameterized quantum circuits
- Approximate transformations and robust manipulation of bipartite pure state entanglement
- Quantum conditional operator and a criterion for separability
- A variational toolbox for quantum multi-parameter estimation
- Identifying optimal cycles in quantum thermal machines with reinforcement-learning
- On the fidelity of mixed states of two qubits
- Variational-State Quantum Metrology
- Variational Quantum Singular Value Decomposition
- Quantum Singular Value Decomposer
- Entanglement witness operator for quantum teleportation
- Noise-Assisted Quantum Autoencoder
- A Note on Fully Entangled Fraction
- Existence of the Schmidt decomposition for tripartite systems
- Evaluation of entanglement measures by a single observable
- Lower bounds on concurrence and negativity from a trace inequality