Cycle Index Polynomials and Generalized Quantum Separability Tests

• URL: http://arxiv.org/abs/2208.14596v3
• Date: Sun, 14 Jul 2024 20:20:48 GMT
• Title: Cycle Index Polynomials and Generalized Quantum Separability Tests
• Authors: Zachary P. Bradshaw, Margarite L. LaBorde, Mark M. Wilde,
• Abstract summary: The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled state. 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 of the group.
• Score: 3.481985817302898
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The mixedness of one share of a pure bipartite state determines whether the overall state is a separable, unentangled state. 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 analyze 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.

Related papers

• A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization [0.0]
  We study a connection between a Hermitian version of the SoS hierarchy, related to the quantum de Finetti theorem. We show that previously known HSoS rounding algorithms can be recast as quantizing an objective function.
  arXiv  Detail & Related papers  (2024-11-06T17:09:28Z)
• Absolute dimensionality of quantum ensembles [41.94295877935867]
  The dimension of a quantum state is traditionally seen as the number of superposed distinguishable states in a given basis. We propose an absolute, i.e.basis-independent, notion of dimensionality for ensembles of quantum states.
  arXiv  Detail & Related papers  (2024-09-03T09:54:15Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• A Menagerie of Symmetry Testing Quantum Algorithms [0.0]
  We show how to generate a notion of symmetry from a discrete, finite group and how this generalizes to a continuous group. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested.
  arXiv  Detail & Related papers  (2023-05-23T22:55:02Z)
• A Single-Timescale Analysis For Stochastic Approximation With Multiple Coupled Sequences [21.50207156675195]
  We study the finite-time convergence of nonlinear approximation with multiple coupled sequences. At the heart of our analysis is the smoothness property of the fixed points in multi-sequence SA that holds in many applications.
  arXiv  Detail & Related papers  (2022-06-21T14:13:20Z)
• Computing the quantum guesswork: a quadratic assignment problem [6.445605125467573]
  Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques. We show that computing the quantum guesswork of qubit ensembles with uniform probability distribution leads to a more-than-quadratic speedup. As examples, we compute the guesswork of regular and quasi-regular sets of qubit states.
  arXiv  Detail & Related papers  (2021-12-03T01:24:57Z)
• SWAP Test for an Arbitrary Number of Quantum States [4.989480853499916]
  We develop an algorithm to generalize the quantum SWAP test for an arbitrary number $m$ of quantum states. We construct a quantum circuit able to simultaneously measure overlaps of $m$ arbitrary pure states.
  arXiv  Detail & Related papers  (2021-10-25T20:53:44Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)
• Testing identity of collections of quantum states: sample complexity analysis [1.227734309612871]
  We show that for a collection of $d$-dimensional quantum states of cardinality $N$, the sample complexity is $O(sqrtNd/epsilon2)$. The test is obtained by estimating the mean squared-Schmidt distance between the states.
  arXiv  Detail & Related papers  (2021-03-26T15:13:45Z)
• Symmetric distinguishability as a quantum resource [21.071072991369824]
  We develop a resource theory of symmetric distinguishability, the fundamental objects of which are elementary quantum information sources. We study the resource theory for two different classes of free operations: $(i)$ $rmCPTP_A$, which consists of quantum channels acting only on $A$, and $(ii)$ conditional doubly (CDS) maps acting on $XA$.
  arXiv  Detail & Related papers  (2021-02-24T19:05:02Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.