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:1901.08848 · Physical Review A

Comment on “Optimal convex approximations of quantum states”

Xiao-Bin Liang, Bo Li, Shao-Ming Fei

Published Jan 22, 2019• 5 citations
arXivHTMLPDF

Abstract

In a recent paper, M. F. Sacchi [Phys. Rev. A 96, 042325 (2017)] addressed the general problem of approximating an unavailable quantum state by the convex mixing of different available states. For the case of qubit mixed states, we show that the analytical solutions in some cases are invalid. In this Comment, we present complete analytical solutions for the optimal convex approximation. Our solutions can be viewed as correcting and supplementing the results in the aforementioned paper.

DOI
10.1103/physreva.99.016301

Related papers

Optimal convex approximations of quantum states

Massimiliano Federico Sacchi

We consider the problem of optimally approximating an unavailable quantum state $\ensuremath{\rho}$ by the convex mixing of states drawn from a set of available states ${{\ensuremath{\nu}}_{i}}$. The problem is recast to look for the least distinguishable state from $\ensuremath{\rho}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\ensuremath{\nu}}_{i}$, and the corresponding optimal weights ${{p}_{i}}$ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.

arXiv:1710.01565•Physical Review A•Oct 18, 2017•12 citations

Convex approximations of quantum channels

Massimiliano Federico Sacchi, Tito Sacchi

We address the problem of optimally approximating the action of a desired and unavailable quantum channel $\mathrm{\ensuremath{\Phi}}$ having at our disposal a single use of a given set of other channels ${{\mathrm{\ensuremath{\Psi}}}_{i}}$. The problem is recast to look for the least distinguishable channel from $\mathrm{\ensuremath{\Phi}}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\mathrm{\ensuremath{\Psi}}}_{i}$, and the corresponding optimal weights ${{p}_{i}}$ provide the optimal convex mixing of the available channels ${{\mathrm{\ensuremath{\Psi}}}_{i}}$. For single-qubit channels we study specifically cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.

arXiv:1709.03805•Physical Review A•Sep 8, 2017•15 citations

Best separable approximation of N-qubit symmetric states

Ruben Quesada, Anna Sanpera

The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.

•Jun 26, 2013•0 citations

Comment on ‘‘Optimization of approximate solutions to the time-dependent Schrödinger equation’’

José M. Maidagan, Rubén Darío Piacentini

In a previous work [A. B. Weglein, Phys. Rev. A 17, 1810 (1978)], an optimization method to approximate solutions to the time-dependent Schr\"odinger equation proposed by Chang and Rapp was further developed. We show that, if correct in a mathematical sense, it leads to results which are physically inadequate.

Physical Review A•Jun 1, 1985•3 citations

Comment on “Modified quantum-speed-limit bounds for open quantum dynamics in quantum channels”

Nicolás Mirkin, Fabricio Toscano, Diego A. Wisniacki

In a recent paper [Phys. Rev. A 95, 052118 (2017)], the authors claim that our criticism, in Phys. Rev. A 94, 052125 (2016), to some quantum speed limit bounds for open quantum dynamics that appeared recently in literature are invalid. According to the authors, the problem with our analysis would be generated by an artifact of the finite-precision numerical calculations. We analytically show here that it is not possible to have any inconsistency associated with the numerical precision of calculations. Therefore, our criticism of the quantum speed limit bounds continues to be valid.

Physical Review A•Apr 6, 2018•2 citations

Further comment on ‘‘Optimization of approximate solutions to the time-dependent Schrödinger equation’’

José M. Maidagan, Rubén Darío Piacentini

We show that the Reply of Weglein [Phys. Rev. A 31, 4025 (1985)] to our previous Comment [Phys. Rev. A 31, 4023 (1985)] is not valid.Received 18 September 1985DOI:https://doi.org/10.1103/PhysRevA.35.933©1987 American Physical Society

Physical Review A•Jan 1, 1987•0 citations
In a recent paper, M. F. Sacchi [Phys. Rev. A 96, 042325 (2017)] addressed the general problem of approximating an unavailable quantum state by the convex mixing of different available states. For the case of qubit mixed states, we show that the analytical solutions in some cases are invalid. In this Comment, we present complete analytical solutions for the optimal convex approximation. Our solutions can be viewed as correcting and supplementing the results in the aforementioned paper.
We consider the problem of optimally approximating an unavailable quantum state $\ensuremath{\rho}$ by the convex mixing of states drawn from a set of available states ${{\ensuremath{\nu}}_{i}}$. The problem is recast to look for the least distinguishable state from $\ensuremath{\rho}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\ensuremath{\nu}}_{i}$, and the corresponding optimal weights pi{{p}_{i}}pi​ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.
We address the problem of optimally approximating the action of a desired and unavailable quantum channel $\mathrm{\ensuremath{\Phi}}$ having at our disposal a single use of a given set of other channels ${{\mathrm{\ensuremath{\Psi}}}_{i}}$. The problem is recast to look for the least distinguishable channel from $\mathrm{\ensuremath{\Phi}}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\mathrm{\ensuremath{\Psi}}}_{i}$, and the corresponding optimal weights pi{{p}_{i}}pi​ provide the optimal convex mixing of the available channels ${{\mathrm{\ensuremath{\Psi}}}_{i}}$. For single-qubit channels we study specifically cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.
The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a different route to the study of multipartite entanglement based on the closeness of a multipartite state to the set of separable ones. In particular, we analyze multipartite diagonal symmetric N qubit states and provide the analytical expression for their Best Separable Approximation (BSA [Phys. Rev. Lett. 80, 2261 (1998)]), that is, their unique convex decomposition into a separable part and an entangled one with maximal weight of the separable one.
In a recent paper [Phys. Rev. A 95, 052118 (2017)], the authors claim that our criticism, in Phys. Rev. A 94, 052125 (2016), to some quantum speed limit bounds for open quantum dynamics that appeared recently in literature are invalid. According to the authors, the problem with our analysis would be generated by an artifact of the finite-precision numerical calculations. We analytically show here that it is not possible to have any inconsistency associated with the numerical precision of calculations. Therefore, our criticism of the quantum speed limit bounds continues to be valid.