相关论文: A generic quantum Wielandt's inequality

We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two…

When a quantum system is divided into two local subsystems, measurements on the two subsystems can exhibit correlations beyond those possible in a classical joint probability distribution; these are partially explained by entanglement, and…

A geometrically uniform (GU) ensemble is a uniformly weighted quantum state ensemble generated from a fixed state by a unitary representation of a finite group $G$. In this work we analyze the problem of discriminating GU ensembles from…

In the present paper, we develop the random restriction method in the quantum framework. By applying this method, we establish the quantum Eldan-Gross inequality, the quantum Talagrand isoperimetric inequality, and related quantum KKL-type…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

We investigate a state discrimination problem in operationally the most general framework to use a probability, including both classical, quantum theories, and more. In this wide framework, introducing closely related family of ensembles…

We replace a Hamiltonian with a modular Hamiltonian in the spectral form factor and the level spacing distribution function. This study establishes a connection between quantities within Quantum Entanglement and Quantum Chaos. To have a…

In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of two given and completely known states, rho or sigma. In…

The prospect of achieving quantum advantage with Quantum Neural Networks (QNNs) is exciting. Understanding how QNN properties (e.g., the number of parameters $M$) affect the loss landscape is crucial to the design of scalable QNN…

Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two…

Let $K$ be a field of degree $n$ and discriminant with absolute value $\Delta$. Under the assumption of the validity of the Generalized Riemann Hypothesis, we provide a new algorithm to compute a set of generators of the class group of $K$…

We investigate the optimal estimation of a quantum process that can possibly consist of multiple time steps. The estimation is implemented by a quantum network that interacts with the process by sending an input and processing the output at…

Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \epsilon > 0, we say that x_i is an \epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater than x_i are each less…

We present a simple proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code (QECC) with its ability to achieve a universal set of transversal logical gates. Our derivation employs…

We establish a comprehensive theoretical framework for coherent quantum speed limits (QSLs), deriving fundamental bounds on the rate of quantum evolution that explicitly isolate the contribution of quantum coherence. By applying H\"older's…

Concurrence, as one of entanglement measures, is a useful tool to characterize quantum entanglement in various quantum systems. However, the computation of the concurrence involves difficult optimizations and only for the case of two qubits…

We derive a new lower bound on the success probability of the Pretty Good Measurement (PGM) for worst-case quantum state discrimination among $m$ pure states. Our bound is strictly tighter than the previously known Gram-matrix-based bound…

We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x.…

Bell inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description.…

In this paper we consider $N \times N$ real generalized Wigner matrices whose entries are only assumed to have finite $(2 + \varepsilon)$-th moment for some fixed, but arbitrarily small, $\varepsilon > 0$. We show that the Stieltjes…