Related papers: Minimum Decision Cost for Quantum Ensembles
In the current era, known as Noisy Intermediate-Scale Quantum (NISQ), encoding large amounts of data in the quantum devices is challenging and the impact of noise significantly affects the quality of the obtained results. A viable approach…
Postselection is the process of discarding outcomes from statistical trials that are not the event one desires. Postselection can be useful in many applications where the cost of getting the wrong event is implicitly high. However, unless…
Adaptive sampling theory has shown that, with proper assumptions on the signal class, algorithms exist to reconstruct a signal in $\mathbb{R}^{d}$ with an optimal number of samples. We generalize this problem to the case of spatial signals,…
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…
Scheme for optimal spin state estimation is considered in analogy with phase detection in interferometry. Recently reported coherent measurements yielding the average fidelity (N+1)/(N+2) for N particle system corresponds to the standard…
We present, and analyze thoroughly, a highly symmetric and efficient scheme for the determination of a single-qubit state, such as the polarization properties of photons emitted by a single-photon source. In our scheme there are only four…
A new scheme is proposed which will permit electron spin resonance pulse techniques to be used to realize a quantum computer with a 100 qbits, or more. The computation is performed on effective pure states which correspond to off-diagonal…
Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k…
It is shown that different distinguishability measures impose different orderings on ensembles of $N$ pure quantum states. This is demonstrated using ensembles of equally-probable, linearly independent, symmetrical pure states, with the…
Ensemble-based approaches are very effective in various fields in raising the accuracy of its individual members, when some voting rule is applied for aggregating the individual decisions. In this paper, we investigate how to find and…
We investigate the uncertainty associated with a joint quantum measurement of two components of spin of a spin-1/2 particle and quantify this in terms of entropy. We consider two entropic quantities: the joint entropy and the sum of the…
We construct the optimal strategy for the estimation of an unknown unitary transformation $U\in SU(d)$. This includes, in addition to a convenient measurement on a probe system, finding which is the best initial state on which $U$ is to…
Bayesian optimization (BO) is a class of global optimization algorithms, suitable for minimizing an expensive objective function in as few function evaluations as possible. While BO budgets are typically given in iterations, this implicitly…
Efficient simulations of quantum evolutions of spin-1/2 systems are relevant for ensemble quantum computation as well as in typical NMR experiments. We propose an efficient method to calculate the dynamics of an observable provided that the…
The optimal and minimal measuring strategy is obtained for a two-state system prepared in a mixed state with a probability given by any isotropic a priori distribution. We explicitly construct the specific optimal and minimal generalized…
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asymmetric traveling salesman problems. Simulations with…
This work examines the expected computational cost to determine an approximate global minimum of a class of cost functions characterized by the variance of coefficients. The cost function takes $N$-dimensional binary states as arguments and…
We investigate the average minimum cost of a bipartite matching between two samples of n independent random points uniformly distributed on a unit cube in d $\ge$ 3 dimensions, where the matching cost between two points is given by any…
Quantum algorithmics with single spins poses serious technological challenges such as precision fabrication, rapid decoherence, atomic-scale addressing and readout. To circumvent atomic-scale challenges, we examine the case of fully…
In this paper, we consider nonparametric multidimensional finite mixture models and we are interested in the semiparametric estimation of the population weights. Here, the i.i.d. observations are assumed to have at least three components…