Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver

Abstract

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits, where a two-outcome measurement can be used to query a classical binary result about whether the input state is bipartite entangled or not. In principle, for an $N$-qubit quantum state, the runtime complexity of our proposal is $O(\text{poly}(N)T)$ with $T$ being the number of iterations. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states. Our work paves the way for using near-term quantum machines to tackle entanglement detection on multipartite entangled quantum systems.

arXiv comment7 pages, 3 figures

References in corpus (30)

• Quantum Computing in the NISQ era and beyond
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum secret sharing
• On the Measurement of Qubits
• Separability criterion and inseparable mixed states with positive partial transposition
• Parameterized quantum circuits as machine learning models
• 14-qubit entanglement: creation and coherence
• Evaluating analytic gradients on quantum hardware
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Bell Inequalities and the Separability Criterion
• General Entanglement Breaking Channels
• Quantum generative adversarial learning
• 18-qubit entanglement with photon's three degrees of freedom
• A complete family of separability criteria
• 12-photon entanglement and scalable scattershot boson sampling with optimal entangled-photon pairs from parametric down-conversion
• Observation of multi-component atomic Schrödinger cat states of up to 20 qubits
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Entanglement Certification $-$ From Theory to Experiment
• The Expressive Power of Parameterized Quantum Circuits
• Quantum generative adversarial learning in a superconducting quantum circuit
• Experimental Machine Learning of Quantum States
• Quantum Adversarial Machine Learning
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Realizing a quantum generative adversarial network using a programmable superconducting processor
• Experimental Simultaneous Learning of Multiple Non-Classical Correlations
• Entanglement Structure: Entanglement Partitioning in Multipartite Systems and Its Experimental Detection Using Optimizable Witnesses
• Experimentally Robust Self-testing for Bipartite and Tripartite Entangled States
• An improved semidefinite programming hierarchy for testing entanglement
• Experimental hybrid quantum-classical reinforcement learning by boson sampling: how to train a quantum cloner

Cited by in corpus (7)

• Quantum circuit architecture search for variational quantum algorithms
• Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry
• Fundamental Limitation on the Detectability of Entanglement
• Protocols for Trainable and Differentiable Quantum Generative Modelling
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
• Variational-toolbox-based separability detection of multiqubit states
• Contextuality-enhanced quantum state discrimination under fixed failure probability