Related papers: Quantum state testing beyond the polarizing regime…
This paper studies the complexity classes QZK and HVQZK of problems having a quantum computational zero-knowledge proof system and an honest-verifier quantum computational zero-knowledge proof system, respectively. The results proved in…
We study the error exponents in quantum hypothesis testing between two sets of quantum states, extending the analysis beyond the independent and identically distributed case to encompass composite correlated hypotheses. In particular, we…
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum…
Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from,…
Given a mixture of states, finding a way to optimally discriminate its elements is a prominent problem in quantum communication theory. In this paper, we will address mixtures of density operators that are unitarily equivalent via elements…
The conflict between classical and quantum physics can be identified through a series of yes-no tests on quantum systems, without it being necessary that these systems be in special quantum states. Kochen-Specker (KS) sets of yes-no tests…
Hypothesis testing is a fundamental issue in statistical inference and has been a crucial element in the development of information sciences. The Chernoff bound gives the minimal Bayesian error probability when discriminating two hypotheses…
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$-…
In this work we make progress in understanding the relationship between learning models with access to entangled, separable and statistical measurements in the quantum statistical query (QSQ) model. To this end, we show the following…
Quantum error-correcting codes (QECCs) is at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related…
In the usual tomography of multipartite entangled quantum states one assumes that the measurement devices used in the laboratory are under perfect control of the experimenter. In this paper, using the so-called SWAP concept introduced…
In studies of quantum squeezing, the emphasis is typically placed more on specific squeezed states and their evolution rather than on the dynamical operations that could simultaneously squeeze a broader range of quantum states, regardless…
The problem of quantum state filtering consists of determining whether an unknown quantum state, which is chosen from a known set of states, is either a particular, specified state, or not. We consider this problem for the case that the…
Top quarks have been recently shown to be a promising system to study quantum information at the highest-energy scale available. The current lines of research mostly discuss topics such as entanglement, Bell nonlocality or quantum…
We introduce the challenges of multi-party quantum entanglement and explain a recent success in learning to take its measure. Given the widely accepted reputation of entanglement as a counter-intuitive feature of quantum theory, we first…
In this paper, we consider lower bounds on the query complexity for testing CSPs in the bounded-degree model. First, for any ``symmetric'' predicate $P:{0,1}^{k} \to {0,1}$ except \equ where $k\geq 3$, we show that every (randomized)…
Quantum signal processing (QSP) and quantum singular value transformation (QSVT), have emerged as unifying frameworks in the context of quantum algorithm design. These techniques allow to carry out efficient polynomial transformations of…
Distinguishing assigned quantum states with assigned probabilities via quantum measurements is a crucial problem for the transmission of classical information through quantum channels. Measurement operators maximizing the probability of…
Solving optimization problems is a key task for which quantum computers could possibly provide a speedup over the best known classical algorithms. Particular classes of optimization problems including semi-definite programming (SDP) and…
Hoeffding's formulation and solution to the universal hypothesis testing (UHT) problem had a profound impact on many subsequent works dealing with asymmetric hypotheses. In this work, we introduce a quantum universal hypothesis testing…