Related papers: Optimal compression for identically prepared qubit…
We establish a connection between optimal quantum cloning and optimal state estimation for d-dimensional quantum systems. In this way we derive an upper limit on the fidelity of state estimation for d-dimensional pure quantum states and,…
We prove concentration bounds for the following classes of quantum states: (i) output states of shallow quantum circuits, answering an open question from [DPMRF22]; (ii) injective matrix product states; (iii) output states of dense…
We investigate the universal asymmetric cloning of states in a Hilbert space of arbitrary dimension. We derive the class of optimal and fully asymmetric 1->3 cloners, which produce three copies, each having a different fidelity. A simple…
The amount of entanglement necessary to teleport quantum states drawn from general ensemble $\{p_i,\rho_i\}$ is derived. The case of perfect transmission of individual states and that of asymptotically faithful transmission are discussed.…
A quantum equation-of-state model is presented and applied to the calculation of high-pressure shock Hugoniot curves beyond the asymptotic fourfold density, close to the maximum compression where quantum effects play a role. An analytical…
As a ubiquitous aspect of modern information technology, data compression has a wide range of applications. Therefore, a quantum autoencoder which can compress quantum information into a low-dimensional space is fundamentally important to…
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not…
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations…
We present an efficient quantum algorithm for a structured state discrimination problem we call the subspace decoding task. Building on this, we show that the algorithm enables efficient and optimal decoding of certain families of…
The N to M (M>N) universal quantum broadcasting of mixed states are proposed for qubits system. The broadcasting of mixed states is universal and optimal in the sense that the shrinking factor is independent of input state and achieves the…
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum…
We report the successful generation of an entangled multiparticle quantum superposition of pure photon states. They result from a multiple (universal} cloning of a single photon qubit by a high gain, quantum-injected parametric amplifier.…
We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the…
We examine information loss, resource costs, and run time from practical application of quantum data compression. Compressing quantum data to fewer qubits enables efficient use of resources, as well as applications for quantum communication…
We derive a lower bound for the optimal fidelity for deterministic cloning a set of n pure states. In connection with states estimation, we obtain a lower bound about average maximum correct states estimation probability.
Here, asymmetric phase-covariant quantum cloning machines are defined and trade-off between qualities of their outputs and its impact on entanglement properties of the outputs are studies. In addition, optimal families among these cloners…
All quantum information processes inevitably requires the explicit state preparation of an entangled state. Here we present the construction of a quantum switchboard which can act both as an optimal quantum cloning machine and a quantum…
We present a family of easily computable upper bounds for the Holevo quantity of ensemble of quantum states depending on a reference state as a free parameter. These upper bounds are obtained by combining probabilistic and metric…
The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry…
We study the problem of optimizing the Shannon mutual information for sources of real quantum states i.e. sources for which there is a basis in which all the states have only real components. We consider in detail the sources ${\cal E}_M$…