Related papers: Calculating Entanglement Eigenvalues for Non-Symme…
Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing and underpins numerous quantum algorithms. In this work, we introduce a novel algorithmic framework for quantum amplitude…
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable…
In this paper, we prove an optimal global rigidity estimate for the eigenvalues of the Jacobi unitary ensemble. Our approach begins by constructing a random measure defined through the eigenvalue counting function. We then prove its…
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The…
It has recently been shown that finding the optimal measurement on the environment for stationary Linear Quadratic Gaussian control problems is a semi-definite program. We apply this technique to the control of the EPR-correlations between…
We describe an entanglement purification protocol to generate maximally entangled states with high efficiencies from two-mode squeezed states or from mixed Gaussian continuous entangled states. The protocol relies on a local quantum…
Entanglement of formation is an important measure of quantum entanglement. We present an experimental way to measure the entanglement of formation for arbitrary dimensional pure states. The measurement only evolves local quantum mechanical…
We address the experimental determination of entanglement for systems made of a pair of polarization qubits. We exploit quantum estimation theory to derive optimal estimators, which are then implemented to achieve ultimate bound to…
In this paper for a class of symmetric multiparty pure states we consider a conjecture related to the geometric measure of entanglement: 'for a symmetric pure state, the closest product state in terms of the fidelity can be chosen as a…
We show that the two notions of entanglement: the maximum of the geometric measure of entanglement and the maximum of the nuclear norm is attained for the same states. We affirm the conjecture of Higuchi-Sudberry on the maximum entangled…
Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
In this paper, we consider the problem of how to quantify entanglement for any multipartite quantum states. For bipartite pure states partial entropy is a good entanglement measure. By using partial entropy, we firstly introduce the…
This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…
We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state. The SDP is used to choose the parameters of a variational quantum circuit. The entangled state is then…
We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\frac{1+\sqrt{5}}{4} \approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to…
We study the geometric measure of entanglement (GM) of pure symmetric states related to rank-one positive-operator-valued measures (POVMs) and establish a general connection with quantum state estimation theory, especially the maximum…
We explore quantum search from the geometric viewpoint of a complex projective space $CP$, a space of rays. First, we show that the optimal quantum search can be geometrically identified with the shortest path along the geodesic joining a…
We use a rank one Gaussian perturbation to derive a smooth stochastic approximation of the maximum eigenvalue function. We then combine this smoothing result with an optimal smooth stochastic optimization algorithm to produce an efficient…
We present a multipartite entanglement measure for $N$-qubit pure states, using the norm of the correlation tensor which occurs in the Bloch representation of the state. We compute this measure for several important classes of $N$-qubit…