Related papers: Error Basis and Quantum Channel

We introduce an elementary measure of non-commutativity between two algebras of quantum operators acting on the same Hilbert space. This quantity, which we call Mutual Averaged Non-commutativity (MAN), is a simple generalization of a type…

Quantum machine learning is one of the most promising applications of quantum computing in the Noisy Intermediate-Scale Quantum(NISQ) era. Here we propose a quantum convolutional neural network(QCNN) inspired by convolutional neural…

A method for analyzing the feature map for the kernel-based quantum classifier is developed; that is, we give a general formula for computing a lower bound of the exact training accuracy, which helps us to see whether the selected feature…

This paper provides elementary analyses of the regret and generalization of minimum-norm interpolating classifiers (MNIC). The MNIC is the function of smallest Reproducing Kernel Hilbert Space norm that perfectly interpolates a label…

We describe properties of a Hermitian square matrix M in M_n(C) equivalent to that of having minimal quotient norm in the following sense: ||M|| <= ||M+D|| for all real diagonal matrices D in M_n(C) and || || the operator norm. These…

Quantum-enhanced metrology surpasses classical metrology by improving estimation precision scaling with a resource $N$ (e.g., particle number or energy) from $1/\sqrt{N}$ to $1/N$. Through the use of nonlinear effects, Roy and…

A classical theorem of Balcar, Pelant, and Simon says that there is a base matrix of height h, where h is the distributivity number of P(omega)/fin. We show that if the continuum c is regular, then there is a base matrix of height c, and…

An index of an effective number of variables (ENV) is introduced for model selection in nested models. This is the case, for instance, when we have to decide the order of a polynomial function or the number of bases in a nonlinear…

We introduce Orb, a family of universal interatomic potentials for atomistic modelling of materials. Orb models are 3-6 times faster than existing universal potentials, stable under simulation for a range of out of distribution materials…

Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating the QC architecture. The…

The difference between ideal experiments to test Bell's weak nonlocality and the real experiments leads to loopholes. Ideal experiments involve either inequalities (Bell) or equalities (Greenberger, Horne, Zeilinger). Every real experiment…

The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates…

Ideally, a meta-analysis will summarize data from several unbiased studies. Here we consider the less than ideal situation in which contributing studies may be compromised by measurement error. Measurement error affects every study design,…

A formalism for quantum error correction based on operator algebras was introduced in [1] via consideration of the Heisenberg picture for quantum dynamics. The resulting theory allows for the correction of hybrid quantum-classical…

Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations…

The image of a given orthonormal basis for a separable Hilbert space $\mathcal{H}$ under a bijective, bounded, and linear operator acting on $\mathcal{H}$ is called a Riesz basis of $\mathcal{H}$. Contrary to what happens with Riesz bases…

Quantum error mitigation (QEM) is a class of promising techniques capable of reducing the computational error of variational quantum algorithms tailored for current noisy intermediate-scale quantum computers. The recently proposed…

We derive an analytical formula for the covariance $\mathrm{Cov}(A,B)$ of two smooth linear statistics $A=\sum_i a(\lambda_i)$ and $B=\sum_i b(\lambda_i)$ to leading order for $N\to\infty$, where $\{\lambda_i\}$ are the $N$ real eigenvalues…

Linear matrix inequalities (LMIs) are ubiquitous in real algebraic geometry, semidefinite programming, control theory and signal processing. LMIs with (dimension free) matrix unknowns are central to the theories of completely positive maps…

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…