Related papers: `Lazy' quantum ensembles
We develop a technique for single qubit quantum state tomography using the mathematical setup of generalized quantization scheme for games. In our technique Alice sends an unknown pure quantum state to Bob who appends it with |0><0| and…
Ensemble forecasting of nonlinear systems involves the use of a model to run forward a discrete ensemble (or set) of initial states. Data assimilation techniques tend to focus on estimating the true state of the system, even though model…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…
`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between $1$ and $n$, and Alice's goal is to recover it using a minimal number of Yes/No questions. Shannon's entropy has a natural interpretation in this…
An open quantum system leaks information into its environment. In some circumstances it is possible for an observer, say Alice, to recover that information, as a classical measurement record, in a variety of different ways, using different…
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $\rho$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the…
We investigate an advantage for information processing of ordering a set of states over making a global quantum processing with a fixed number of copies of coherent states. Suppose Alice has $N$ copies of one of two quantum states…
A powerful way to improve performance in machine learning is to construct an ensemble that combines the predictions of multiple models. Ensemble methods are often much more accurate and lower variance than the individual classifiers that…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the…
Quantum teleportation is one of the most important techniques for quantum information secure transmission. Using preshared entanglement, quantum teleportation is designed as a basic key in many quantum information tasks and features…
In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the…
Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum states. However, the standard greedy algorithm, in general, cannot take the…
In this paper, we examine a variety of strategies for numerical quantum-state estimation from data of the sort commonly measured in experiments involving quantum state tomography. We find that, in some important circumstances, an elaborate…
Studying the complexity of states sampled from various ensembles is a central component of quantum information theory. In this work we establish the average-case hardness of learning, in the statistical query model, the Born distributions…
We propose a deterministic remote state preparation (RSP) scheme for preparing an arbitrary (including pure and mixed) qubit, where a partially entangled state and finite classical communication are used. To our knowledge, our scheme is the…
Several physical architectures allow for measurement-based quantum computing using sequential preparation of cluster states by means of probabilistic quantum gates. In such an approach, the order in which partial resources are combined to…
There is a newly emerging understanding that in the chaotic domain of isolated finite interacting many particle systems smoothed densities define the statistical description of these systems and these densities follow from embedded…
We study the universal structure of late-time ensembles obtained from unitary dynamics in quantum chaotic systems with symmetries, such as charge or energy conservation. We find that although quantum states do not ergodically explore the…