A bipartite state ${\ensuremath{\rho}}_{AB}$ is symmetric extendible if there exists a tripartite state ${\ensuremath{\rho}}_{AB{B}^{\ensuremath{'}}}$ whose $AB$ and $A{B}^{\ensuremath{'}}$ marginal states are both identical to ${\ensuremath{\rho}}_{AB}$. Symmetric extendibility of bipartite states is of vital importance in quantum information because of its central role in separability tests, one-way distillation of Einstein-Podolsky-Rosen pairs, one-way distillation of secure keys, quantum marginal problems, and antidegradable quantum channels. We establish a simple analytic characterization for symmetric extendibility of any two-qubit quantum state ${\ensuremath{\rho}}_{AB}$; specifically, $\mathrm{tr}({\ensuremath{\rho}}_{B}^{2})\ensuremath{\ge}\mathrm{tr}({\ensuremath{\rho}}_{AB}^{2})\ensuremath{-}4\sqrt{det{\ensuremath{\rho}}_{AB}}$. As a special case we solve the bosonic three-representability problem for the two-body reduced density matrix.A bipartite state ${\ensuremath{\rho}}_{AB}$ is symmetric extendible if there exists a tripartite state ${\ensuremath{\rho}}_{AB{B}^{\ensuremath{'}}}$ whose $AB$ and $A{B}^{\ensuremath{'}}$ marginal states are both identical to ${\ensuremath{\rho}}_{AB}$. Symmetric extendibility of bipartite states is of vital importance in quantum information because of its central role in separability tests, one-way distillation of Einstein-Podolsky-Rosen pairs, one-way distillation of secure keys, quantum marginal problems, and antidegradable quantum channels. We establish a simple analytic characterization for symmetric extendibility of any two-qubit quantum state ${\ensuremath{\rho}}_{AB}$; specifically, $\mathrm{tr}({\ensuremath{\rho}}_{B}^{2})\ensuremath{\ge}\mathrm{tr}({\ensuremath{\rho}}_{AB}^{2})\ensuremath{-}4\sqrt{det{\ensuremath{\rho}}_{AB}}$. As a special case we solve the bosonic three-representability problem for the two-body reduced density matrix.

arXiv:1310.3530Physical Review ASep 17, 201441 citations

Concrete Representation and Separability Criteria for Symmetric Quantum State

Chang’e Li, Yuan-Hong Tao, Jun Ping Zhang +2 more

International Journal of Theoretical PhysicsMay 16, 20141 citation

Separability criteria and entanglement witnesses for symmetric quantum states

Géza Tóth, Otfried Gühne

arXiv:0908.3679Applied Physics BDec 10, 200944 citations

A Menagerie of Symmetry Testing Quantum Algorithms

Margarite L. LaBorde

In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental concepts from quantum information. This will allow us to then define the different notions of symmetry necessary in the following chapters. In Chapter 2, we investigate Hamiltonian symmetries. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. Furthermore, we show that this algorithm is that this algorithm is DQC1-Complete. Finally, we execute one of our symmetry-testing algorithms on existing quantum computers for simple examples. In Chapter 3, we discuss tests of symmetry for quantum states. For the case of testing Bose symmetry of a state, there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones. In Chapter 4, we begin by showing that the analytical form of the acceptance probability of such a test is given by the cycle index polynomial of the symmetric group �� . We derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyze explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with ��(��2) and ��(�� log(��)) controlled-SWAP gates, respectively, where �� is the number of copies of the state In Chapter 5, we include additional results not previously published; in particular, we give a test for symmetry of a quantum state using density matrix exponentiation, a further result of Hamiltonian symmetry measurements when using Abelian groups, and an alternate Hamiltonian symmetry test construction for a block-encoded Hamiltonian.In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental concepts from quantum information. This will allow us to then define the different notions of symmetry necessary in the following chapters. In Chapter 2, we investigate Hamiltonian symmetries. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. Furthermore, we show that this algorithm is that this algorithm is DQC1-Complete. Finally, we execute one of our symmetry-testing algorithms on existing quantum computers for simple examples. In Chapter 3, we discuss tests of symmetry for quantum states. For the case of testing Bose symmetry of a state, there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones. In Chapter 4, we begin by showing that the analytical form of the acceptance probability of such a test is given by the cycle index polynomial of the symmetric group �� . We derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyze explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with ��(��2) and ��(�� log(��)) controlled-SWAP gates, respectively, where �� is the number of copies of the state In Chapter 5, we include additional results not previously published; in particular, we give a test for symmetry of a quantum state using density matrix exponentiation, a further result of Hamiltonian symmetry measurements when using Abelian groups, and an alternate Hamiltonian symmetry test construction for a block-encoded Hamiltonian.

arXiv:2305.14560Civil War Book ReviewMar 7, 20230 citations

Cycle index polynomials and generalized quantum separability tests

Zachary P. Bradshaw, Margarite L. LaBorde, Mark M. Wilde

The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled one. Here we consider quantum computational tests of mixedness, and we derive an exact expression of the acceptance probability of such tests as the number of copies of the state becomes larger. We prove that the analytical form of this expression is given by the cycle index polynomial of the symmetric group S k , which is itself related to the Bell polynomials. After doing so, we derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyse explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with O ( k 2 ) and O ( k log ⁡ ( k ) ) controlled-SWAP gates, respectively, where k is the number of copies of the state being tested.The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled one. Here we consider quantum computational tests of mixedness, and we derive an exact expression of the acceptance probability of such tests as the number of copies of the state becomes larger. We prove that the analytical form of this expression is given by the cycle index polynomial of the symmetric group S k , which is itself related to the Bell polynomials. After doing so, we derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyse explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with O ( k 2 ) and O ( k log ⁡ ( k ) ) controlled-SWAP gates, respectively, where k is the number of copies of the state being tested.

arXiv:2208.14596Proceedings of the Royal Society A Mathematical Physical and Engineering SciencesJun 1, 20237 citations

A sufficient and necessary criterion for separability of bipartite quantum states

Zhao, Hui Hui, Yu +1 more

中国物理B：英文版Jan 1, 20140 citations

A bipartite state ${\ensuremath{\rho}}_{AB}$ is symmetric extendible if there exists a tripartite state ${\ensuremath{\rho}}_{AB{B}^{\ensuremath{'}}}$ whose

AB

and $A{B}^{\ensuremath{'}}$ marginal states are both identical to ${\ensuremath{\rho}}_{AB}$. Symmetric extendibility of bipartite states is of vital importance in quantum information because of its central role in separability tests, one-way distillation of Einstein-Podolsky-Rosen pairs, one-way distillation of secure keys, quantum marginal problems, and antidegradable quantum channels. We establish a simple analytic characterization for symmetric extendibility of any two-qubit quantum state ${\ensuremath{\rho}}_{AB}$; specifically, $\mathrm{tr}({\ensuremath{\rho}}_{B}^{2})\ensuremath{\ge}\mathrm{tr}({\ensuremath{\rho}}_{AB}^{2})\ensuremath{-}4\sqrt{det{\ensuremath{\rho}}_{AB}}$. As a special case we solve the bosonic three-representability problem for the two-body reduced density matrix.