Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2209.01430 · Physical Review A

Variational approach to the quantum separability problem

Mirko Consiglio, Tony J. G. Apollaro, Marcin Wieśniak

Published Dec 13, 2022• 19 citations
arXivHTMLPDF

Abstract

We present the variational separability verifier (VSV), which is a variational quantum algorithm that determines the closest separable state (CSS) of an arbitrary quantum state with respect to the Hilbert-Schmidt distance (HSD). We first assess the performance of the VSV by investigating the convergence of the optimization procedure for Greenberger-Horne-Zeilinger states of up to seven qubits, using both state-vector and shot-based simulations. We also numerically determine the CSS of maximally entangled mixed $X$ states, and subsequently use the results of the algorithm to surmise the analytical form of the aforementioned CSS. Our results indicate that current noisy intermediate-scale quantum devices may be useful in addressing the NP-hard full separability problem using the VSV, due to the shallow quantum circuit imposed by employing the destructive swap test to evaluate the HSD. The VSV may also possibly lead to the characterization of multipartite quantum states, once the algorithm is adapted and improved to obtain the closest $k$-separable state of a multipartite entangled state.

DOI
10.1103/physreva.106.062413

Related papers

Variational Determination of Multiqubit Geometrical Entanglement in Noisy Intermediate-Scale Quantum Computers

Andrés D. Muñoz-Moller, Luciano Pereira, Leonardo Zambrano +2 more

Current noise levels in physical realizations of qubits and quantum operations limit the applicability of conventional methods to characterize entanglement. In this adverse scenario, we follow a quantum variational approach to estimate the geometric measure of entanglement of multiqubit pure states. The algorithm requires only single-qubit gates and measurements, so it is well suited for noisy intermediate-scale quantum devices. This is demonstrated by successfully implementing the method on IBM Quantum devices for Greenberger-Horne-Zeilinger states of three, four, and five qubits. Numerical simulations with random states show the robustness and accuracy of the method. The scalability of the protocol is numerically demonstrated via matrix-product-state techniques up to $25$ qubits.

arXiv:2110.03709•Physical Review Applied•Aug 17, 2022•16 citations

Variational M-Partite Geometric Entanglement Algorithm

Vahid Azimi Mousolou, Prashant Singh

Variational quantum algorithms have emerged as a powerful tool for harnessing the potential of near-term quantum devices to address complex challenges across quantum science and technology. Yet, the robust and scalable quantification of entanglement in many-body quantum systems remains a significant challenge, crucial for both advancing theoretical understanding and enabling practical applications. In this work, we propose a variational quantum algorithm to evaluate the $M$-partite geometric entanglement across arbitrary partitions of an $N$-qubit system into $M$ parties. By constructing tailored variational ansatz circuits for both single- and multi-qubit parties, we optimize the overlap between a target quantum state and an $M$-partite variational separable state. This method provides a flexible and scalable approach for characterizing arbitrary $M$-partite entanglement in complex quantum systems of a given dimension. The accuracy of the proposed method is assessed by reproducing known analytical results. We further demonstrate its capability to evaluate entanglement among $M$ parties for any given conventional or unconventional partitions of one- and two-dimensional spin systems, both near and at a quantum critical point. Our results establish the versatility of the variational approach in capturing different types of entanglement in various quantum systems, surpassing the capabilities of existing methods. Our approach offers a powerful methodology for advancing research in quantum information science, condensed matter physics, and quantum field theory. Additionally, we discuss its advantages, highlighting its adaptability to diverse system architectures in the context of near-term quantum devices.

arXiv:2503.20056•Mar 25, 2025•1 citation

Building separable approximations for quantum states via neural networks

Antoine Girardin, Nicolas Brunner, Tamás Kriváchy

Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the method on a variety of well-known classes of bipartite states and find excellent agreement, even up to local dimension of $d=10$, while providing conjectures and analytic insight for isotropic and Werner states. Moreover, we show our method to be efficient in the multipartite case, considering different notions of separability. Examining three- and four-party GHZ and W states, we recover known bounds and obtain additional ones, for instance, for triseparability.

arXiv:2112.08055•Physical Review Research•Jun 24, 2022•31 citations

Efficient Variational Quantum Algorithms for the Generalized Assignment Problem

Carlo Mastroianni, Francesco Plastina, Jacopo Settino +1 more

Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale Quantum (NISQ) devices, hybrid quantum-classical approaches, specifically Variational Quantum Algorithms (VQAs) like the Variational Quantum Eigensolver (VQE), promises to be effective approaches to solve real-world optimization problems. This paper proposes an approach, named VQGAP, designed to efficiently solve the GAP by optimizing quantum resources and reducing the required parametrized quantum circuit width with respect to standard VQE. The main idea driving our proposal is to decouple the qubits of ansatz circuits from the binary variables of the General Assignment Problem, by providing encoding/decoding functions transforming the solutions generated by ansatze in the limited quantum space in feasible solutions in the problem variables space, by exploiting the constraints of the problem. Preliminary results, obtained through both noiseless and noisy simulations, indicate that VQGAP exhibits performance and behavior very similar to VQE, while effectively reducing the number of qubits and circuit depth.

quant-pharXiv:2511.02739•Nov 5, 2025•0 citations

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations

Variational quantum algorithms for trace distance and fidelity estimation

Ranyiliu Chen, Zhixin Song, Xuanqiang Zhao +1 more

Abstract Estimating the difference between quantum data is crucial in quantum computing. However, as typical characterizations of quantum data similarity, the trace distance and quantum fidelity are believed to be exponentially-hard to evaluate in general. In this work, we introduce hybrid quantum–classical algorithms for these two distance measures on near-term quantum devices where no assumption of input state is required. First, we introduce the variational trace distance estimation (VTDE) algorithm. We in particular provide the technique to extract the desired spectrum information of any Hermitian matrix by local measurement. A novel variational algorithm for trace distance estimation is then derived from this technique, with the assistance of a single ancillary qubit. Notably, VTDE could avoid the barren plateau issue with logarithmic depth circuits due to a local cost function. Second, we introduce the variational fidelity estimation algorithm. We combine Uhlmann’s theorem and the freedom in purification to translate the estimation task into an optimization problem over a unitary on an ancillary system with fixed purified inputs. We then provide a purification subroutine to complete the translation. Both algorithms are verified by numerical simulations and experimental implementations, exhibiting high accuracy for randomly generated mixed states.

arXiv:2012.05768•Quantum Science and Technology•Nov 11, 2021•68 citations
We present the variational separability verifier (VSV), which is a variational quantum algorithm that determines the closest separable state (CSS) of an arbitrary quantum state with respect to the Hilbert-Schmidt distance (HSD). We first assess the performance of the VSV by investigating the convergence of the optimization procedure for Greenberger-Horne-Zeilinger states of up to seven qubits, using both state-vector and shot-based simulations. We also numerically determine the CSS of maximally entangled mixed XXX states, and subsequently use the results of the algorithm to surmise the analytical form of the aforementioned CSS. Our results indicate that current noisy intermediate-scale quantum devices may be useful in addressing the NP-hard full separability problem using the VSV, due to the shallow quantum circuit imposed by employing the destructive swap test to evaluate the HSD. The VSV may also possibly lead to the characterization of multipartite quantum states, once the algorithm is adapted and improved to obtain the closest kkk-separable state of a multipartite entangled state.
Current noise levels in physical realizations of qubits and quantum operations limit the applicability of conventional methods to characterize entanglement. In this adverse scenario, we follow a quantum variational approach to estimate the geometric measure of entanglement of multiqubit pure states. The algorithm requires only single-qubit gates and measurements, so it is well suited for noisy intermediate-scale quantum devices. This is demonstrated by successfully implementing the method on IBM Quantum devices for Greenberger-Horne-Zeilinger states of three, four, and five qubits. Numerical simulations with random states show the robustness and accuracy of the method. The scalability of the protocol is numerically demonstrated via matrix-product-state techniques up to 252525 qubits.
Variational quantum algorithms have emerged as a powerful tool for harnessing the potential of near-term quantum devices to address complex challenges across quantum science and technology. Yet, the robust and scalable quantification of entanglement in many-body quantum systems remains a significant challenge, crucial for both advancing theoretical understanding and enabling practical applications. In this work, we propose a variational quantum algorithm to evaluate the MMM-partite geometric entanglement across arbitrary partitions of an NNN-qubit system into MMM parties. By constructing tailored variational ansatz circuits for both single- and multi-qubit parties, we optimize the overlap between a target quantum state and an MMM-partite variational separable state. This method provides a flexible and scalable approach for characterizing arbitrary MMM-partite entanglement in complex quantum systems of a given dimension. The accuracy of the proposed method is assessed by reproducing known analytical results. We further demonstrate its capability to evaluate entanglement among MMM parties for any given conventional or unconventional partitions of one- and two-dimensional spin systems, both near and at a quantum critical point. Our results establish the versatility of the variational approach in capturing different types of entanglement in various quantum systems, surpassing the capabilities of existing methods. Our approach offers a powerful methodology for advancing research in quantum information science, condensed matter physics, and quantum field theory. Additionally, we discuss its advantages, highlighting its adaptability to diverse system architectures in the context of near-term quantum devices.
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural network and train it to minimize the distance to a given target state with respect to a differentiable distance, such as the trace distance or Hilbert--Schmidt distance. By examining the output of the algorithm, we obtain an upper bound on the entanglement of the target state, and construct an approximation for its closest separable state. We benchmark the method on a variety of well-known classes of bipartite states and find excellent agreement, even up to local dimension of d=10d=10d=10, while providing conjectures and analytic insight for isotropic and Werner states. Moreover, we show our method to be efficient in the multipartite case, considering different notions of separability. Examining three- and four-party GHZ and W states, we recover known bounds and obtain additional ones, for instance, for triseparability.
Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale Quantum (NISQ) devices, hybrid quantum-classical approaches, specifically Variational Quantum Algorithms (VQAs) like the Variational Quantum Eigensolver (VQE), promises to be effective approaches to solve real-world optimization problems. This paper proposes an approach, named VQGAP, designed to efficiently solve the GAP by optimizing quantum resources and reducing the required parametrized quantum circuit width with respect to standard VQE. The main idea driving our proposal is to decouple the qubits of ansatz circuits from the binary variables of the General Assignment Problem, by providing encoding/decoding functions transforming the solutions generated by ansatze in the limited quantum space in feasible solutions in the problem variables space, by exploiting the constraints of the problem. Preliminary results, obtained through both noiseless and noisy simulations, indicate that VQGAP exhibits performance and behavior very similar to VQE, while effectively reducing the number of qubits and circuit depth.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
Abstract Estimating the difference between quantum data is crucial in quantum computing. However, as typical characterizations of quantum data similarity, the trace distance and quantum fidelity are believed to be exponentially-hard to evaluate in general. In this work, we introduce hybrid quantum–classical algorithms for these two distance measures on near-term quantum devices where no assumption of input state is required. First, we introduce the variational trace distance estimation (VTDE) algorithm. We in particular provide the technique to extract the desired spectrum information of any Hermitian matrix by local measurement. A novel variational algorithm for trace distance estimation is then derived from this technique, with the assistance of a single ancillary qubit. Notably, VTDE could avoid the barren plateau issue with logarithmic depth circuits due to a local cost function. Second, we introduce the variational fidelity estimation algorithm. We combine Uhlmann’s theorem and the freedom in purification to translate the estimation task into an optimization problem over a unitary on an ancillary system with fixed purified inputs. We then provide a purification subroutine to complete the translation. Both algorithms are verified by numerical simulations and experimental implementations, exhibiting high accuracy for randomly generated mixed states.