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

Bulletin of the American Physical Society

Robust Decomposition of Quantum States

Jonathan E. Moussa

Published Mar 6, 2020• 0 citations
OpenAlex

Related papers

Uncertainty decomposition of quantum networks in SLH framework

Peyman Azodi, Peyman Setoodeh, Alireza Khayatian +1 more

Summary This paper presents a systematic method to decompose uncertain linear quantum input‐output networks into uncertain and nominal subnetworks, when uncertainties are defined in SLH representation. To this aim, two decomposition theorems are stated, which show how an uncertain quantum network can be decomposed into nominal and uncertain subnetworks in cascaded connection and how uncertainties can be translated from SLH parameters into state‐space parameters. As a potential application of the proposed decomposition scheme, robust stability analysis of uncertain quantum networks is briefly introduced. The proposed uncertainty decomposition theorems take account of uncertainties in all three parameters of a quantum network and bridge the gap between SLH modeling and state‐space robust analysis theory for linear quantum networks.

arXiv:1609.07946•International Journal of Robust and Nonlinear Control•Oct 21, 2019•3 citations

On the Decompositions of a Quantum State

Gianni Cassinelli, Ernesto De Vito, Alberto Levrero

Journal of Mathematical Analysis and Applications•Jun 1, 1997•20 citations

Quantum State Reconstruction

Stefan Weigert

Springer eBooks•Jan 1, 2009•1 citation

Robustness of entanglement for two qubit density matrix

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decomposition we give an explicit parameterization for the decomposition.

arXiv:quant-ph/0211156•Nov 24, 2002•2 citations

Quantum State Reduction

Shan Gao

Cambridge University Press eBooks•Apr 20, 2018•7 citations

Robust decompositions of quantum states

Jonathan E. Moussa

Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy intermediate-scale quantum devices for framing near-term progress towards quantum supremacy. We establish one such equivalence using a noisy quantum circuit model that can be simulated efficiently on classical computers. With respect to its noise model, quantum states have a robust decomposition into a sequence of operations that each extend the state by one qubit without spreading errors between qubits. This enables universal quantum sampling of states with an efficient representation in this robust form and observables with low quantum weight that can be sampled from general measurements on a few qubits and computational basis measurements on the remaining qubits. These robust decompositions are not unique, and we construct two distinct variants, both of which are compatible with machine-learning methodology. They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.

arXiv:2003.04171•Mar 9, 2020•0 citations
Summary This paper presents a systematic method to decompose uncertain linear quantum input‐output networks into uncertain and nominal subnetworks, when uncertainties are defined in SLH representation. To this aim, two decomposition theorems are stated, which show how an uncertain quantum network can be decomposed into nominal and uncertain subnetworks in cascaded connection and how uncertainties can be translated from SLH parameters into state‐space parameters. As a potential application of the proposed decomposition scheme, robust stability analysis of uncertain quantum networks is briefly introduced. The proposed uncertainty decomposition theorems take account of uncertainties in all three parameters of a quantum network and bridge the gap between SLH modeling and state‐space robust analysis theory for linear quantum networks.
By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decomposition we give an explicit parameterization for the decomposition.
Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy intermediate-scale quantum devices for framing near-term progress towards quantum supremacy. We establish one such equivalence using a noisy quantum circuit model that can be simulated efficiently on classical computers. With respect to its noise model, quantum states have a robust decomposition into a sequence of operations that each extend the state by one qubit without spreading errors between qubits. This enables universal quantum sampling of states with an efficient representation in this robust form and observables with low quantum weight that can be sampled from general measurements on a few qubits and computational basis measurements on the remaining qubits. These robust decompositions are not unique, and we construct two distinct variants, both of which are compatible with machine-learning methodology. They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.