Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
arXiv:2303.07911 · doi:10.22331/q-2024-06-11-1366
Abstract
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect, the latter initially discovered by Schrödinger. Our separability test consists of a distributed quantum computation involving two parties: a computationally limited client, who prepares a purification of the state of interest, and a computationally unbounded server, who tries to steer the reduced systems to a probabilistic ensemble of pure product states. To design a practical algorithm, we replace the role of the server with a combination of parameterized unitary circuits and classical optimization techniques to perform the necessary computation. The result is a variational quantum steering algorithm (VQSA), a modified separability test that is implementable on quantum computers that are available today. We then simulate our VQSA on noisy quantum simulators and find favorable convergence properties on the examples tested. We also develop semidefinite programs, executable on classical computers, that benchmark the results obtained from our VQSA. Thus, our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory. They also demonstrate the value of a parameterized mid-circuit measurement in a VQSA.
arXiv commentv4: 33 pages, 12 figures, all source code available as arXiv ancillary files, update to complexity theoretic results for QIP, accepted to Quantum
References in corpus (54)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantifying Coherence
- Barren plateaus in quantum neural network training landscapes
- Quantifying Entanglement
- Entanglement Measures and Purification Procedures
- Quantum fingerprinting
- Suppressing quantum errors by scaling a surface code logical qubit
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- A Spin Entanglement Witness for Quantum Gravity
- Quantum entanglement in condensed matter systems
- Gravitationally-induced entanglement between two massive particles is sufficient evidence of quantum effects in gravity
- Quantum cloning
- General Entanglement Breaking Channels
- Quantum Steering
- Fully device independent quantum key distribution
- Quantum steering: a review with focus on semidefinite programming
- A complete family of separability criteria
- Quantum-assisted quantum compiling
- An improved bound on distillable entanglement
- Modes and states in Quantum Optics
- Loophole-free Einstein-Podolsky-Rosen experiment via quantum steering
- Repeated quantum error correction on a continuously encoded qubit by real-time feedback
- One-and-a-half quantum de Finetti theorems
- Entanglement Entropy from a Holographic Viewpoint
- Randomized Benchmarking with Confidence
- Linking a distance measure of entanglement to its convex roof
- Deterministic entanglement and tomography of ion spin qubits
- Measuring entanglement in condensed matter systems
- Mid-circuit measurements on a single species neutral alkali atom quantum processor
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- Experimental demonstration of remotely creating Wigner negativity via quantum steering
- Non-asymptotic assisted distillation of quantum coherence
- Detecting and quantifying entanglement on near-term quantum devices
- Extendibility limits the performance of quantum processors
- Testing product states, quantum Merlin-Arthur games and tensor optimisation
- Estimating distinguishability measures on quantum computers
- Semidefinite programming hierarchies for constrained bilinear optimization
- Efficient Online Quantum Generative Adversarial Learning Algorithms with Applications
- Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver
- Resource theory of unextendibility and non-asymptotic quantum capacity
- Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks
- A Variational Approach to the Quantum Separability Problem
- Quantum interactive proofs and the complexity of separability testing
- Testing symmetry on quantum computers
- Variational determination of multi-qubit geometrical entanglement in NISQ computers
- Steering-based randomness certification with squeezed states and homodyne measurements
- Two-message quantum interactive proofs and the quantum separability problem
- Parameter-Parallel Distributed Variational Quantum Algorithm
- A Variational Quantum Algorithm For Approximating Convex Roofs