The most discriminable quantum states in the multicopy regime

• URL: http://arxiv.org/abs/2604.26927v1
• Date: Wed, 29 Apr 2026 17:41:12 GMT
• Title: The most discriminable quantum states in the multicopy regime
• Abstract summary: We consider uniformly distributed ensembles of the form $leftfrac1N,_iotimes kright_i=1N$, where $N$ states in dimension $d$ are provided in $k$ identical copies.<n>For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally discriminable sets.<n>We also analyse the analogue classical discrimination problems, in which states are replaced by probability distributions.
• Score: 0.410492188035848
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form $\left\{\frac{1}{N},ρ_i^{\otimes k}\right\}_{i=1}^N$, where $N$ states in dimension $d$ are provided in $k$ identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever $N$ is large enough to support a state $k$-design, these designs will exactly give rise to the maximally discriminable sets. We further show that when $N$ exceeds the size required for a $k$-design, mixed states can outperform all pure state ensembles. We also analyse the analogue classical discrimination problems, in which states are replaced by probability distributions. We recognise that the problem of most discriminable classical states in the multi-copy regime is in one-to-one correspondence to the concept of the multiplicative Bayes capacity of independent uses of classical channels, a concept that emerges naturally in the context of classical information leakage. This connection allows us to completely solve the classical analogue of our problem when $N\geq \binom{d + k - 1}{k}$, and to prove that quantum systems offer a quadratic advantage (in number of copies $k$) over classical ones. Curiously, we also show that this quantum advantage is strongly reduced when one is restricted to real quantum states. Finally, we introduce computational techniques to find sets of most discriminable ensembles, and to obtain rigorous universal upper bounds on the maximal success probability for multi-copy state discrimination in cases that are analytically intractable.

Related papers

• Hypothesis testing between quantum ensembles [1.370074756133613]
  Quantum state ensembles are important in quantum information processing.<n>We formulate binary hypothesis testing between finite quantum ensembles.<n>We show that discrimination is governed by the full moment hierarchy up to the number of samples.
  arXiv  Detail & Related papers  (2026-08-21T17:29:43Z)
• Quantum state determinability from local marginals is universally robust [22.159831673341287]
  We show that deviations of local marginals propagate to global states strictly bounded by a power law with exponent $in(0,1]$.<n>We apply our theory to construct a scalable two-local genuine multipartite entanglement witness.
  arXiv  Detail & Related papers  (2026-04-07T07:02:22Z)
• Generalized quantum Chernoff bound [1.8371802327210847]
  We establish a quantum Chernoff bound for the discrimination of multiple sets of quantum states.<n>We show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability.
  arXiv  Detail & Related papers  (2025-08-18T12:41:04Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Quasi-quantum states and the quasi-quantum PCP theorem [0.21485350418225244]
  We show that solving the $k$-local Hamiltonian over the quasi-quantum states is equivalent to optimizing a distribution of assignment over a classical $k$-local CSP.<n>Our main result is a PCP theorem for the $k$-local Hamiltonian over the quasi-quantum states in the form of a hardness-of-approximation result.
  arXiv  Detail & Related papers  (2024-10-17T13:43:18Z)
• Sample-Efficient Quantum State Tomography for Structured Quantum States in One Dimension [25.333797381352973]
  Many physical quantum states often exhibit certain low-dimensional structures that enable the development of efficient QST.<n>We show that the number of state copies to guarantee bounded recovery error of an MPO state with a constrained least-squares estimator depends on the probability distribution of the MPO.<n>We prove that only a number of state copies proportional to the number of independent parameters in the MPO is sufficient for a guaranteed recovery of any state represented by an MPO.
  arXiv  Detail & Related papers  (2024-10-03T15:26:26Z)
• Maximal Clauser-Horne-Shimony-Holt violation for qubit-qudit states [41.99844472131922]
  We evaluate the maximal Clauser-Horne-Shimony-Holt violation for a generic (typically mixed) qubit-qudit state.<n>This represents the optimal (2-2-2) Bell nonlocality for this kind of systems.
  arXiv  Detail & Related papers  (2024-04-02T16:40:57Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Unextendibility, uncompletability, and many-copy indistinguishable ensembles [49.1574468325115]
  We show that the complement of any bipartite pure entangled state is spanned by product states which form a nonorthogonal unextendible product basis (nUPB) of maximum cardinality.<n>We also report a class of multipartite many-copy indistinguishable ensembles for which local indistinguishability property increases with decreasing number of mixed states.
  arXiv  Detail & Related papers  (2023-03-30T16:16:41Z)
• Reconstructing the whole from its parts [0.0]
  We analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. We show that any self-consistent set of multipartite marginal reductions is compatible with the existence of a global quantum state, after passing through a depolarizing channel.
  arXiv  Detail & Related papers  (2022-09-28T15:04:22Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05: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.