DeepAI AI Chat
Log In Sign Up

Quantum Steering Algorithm for Estimating Fidelity of Separability

by   Aby Philip, et al.

Quantifying entanglement is an important task by which the resourcefulness of a state can be measured. Here we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state, by making use of the quantum steering effect. Our first 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 by a combination of parameterized unitary circuits and classical optimization techniques to perform the necessary computation. The result is a variational quantum steering algorithm (VQSA), which is our second separability test that is better suited for the capabilities of quantum computers available today. This VQSA has an additional interpretation as a distributed variational quantum algorithm (VQA) that can be executed over a quantum network, in which each node is equipped with classical and quantum computers capable of executing VQA. 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. Our findings here thus 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 and represent a first-of-its-kind application for a distributed VQA. Finally, the whole framework generalizes to the case of multipartite states and entanglement.


page 1

page 2

page 3

page 4


Optimal training of variational quantum algorithms without barren plateaus

Variational quantum algorithms (VQAs) promise efficient use of near-term...

On Vague Computers

Vagueness is something everyone is familiar with. In fact, most people t...

Variational quantum Gibbs state preparation with a truncated Taylor series

The preparation of quantum Gibbs state is an essential part of quantum c...

Adversarial quantum circuit learning for pure state approximation

Adversarial learning is one of the most successful approaches to modelli...

Exploring entanglement and optimization within the Hamiltonian Variational Ansatz

Quantum variational algorithms are one of the most promising application...

Mitigating barren plateaus of variational quantum eigensolvers

Variational quantum algorithms (VQAs) are expected to establish valuable...