Related papers: Algorithmic No-Cloning Theorem
While the no-cloning theorem forbids the perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can take…
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly…
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for…
The No-Cloning property in Quantum Computation is known not to depend on the unitarity of the operators involved, but only on their linearity. Based on that fact, here it is shown that the No-Cloning property remains valid when Quantum…
A simple and unifying method to show the perfect error-correcting condition is provided based on the quantum mutual information. The one-to-one parameterization of quantum operations and the properties of the quantum relative entropy are…
Quantum error-correcting codes are analyzed from an information-theoretic perspective centered on quantum conditional and mutual entropies. This approach parallels the description of classical error correction in Shannon theory, while…
The fidelity of a quantum transformation is strongly linked with the prior partial information of the state to be transformed. We illustrate this interesting point by proposing and demonstrating the superior cloning of coherent states with…
The inherent limitations of physical processes prevent the copying of arbitrary quantum states. Furthermore, even if we only aim to clone two distinct quantum states, it remains impossible unless they are mutually orthogonal. To overcome…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
In this short communication, it is shown a simple problem using quantum circuits for which the algorithmic information theory guarantee that the minimal length of the algorithm able to solve it grows exponentially with the number of qubits.
We show that encrypted cloning of unknown quantum states is possible. Any number of encrypted clones of a qubit can be created through a unitary transformation, and each of the encrypted clones can be decrypted through a unitary…
An unknown quantum state cannot be copied on demand and broadcast freely due to the famous no-cloning theorem. Approximate cloning schemes have been proposed to achieve the optimal cloning characterized by the maximal fidelity between 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…
The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this…
Unmeasureability of a quantum state has important consequences in practical implementation of quantum computers. Like copying, deleting of an unknown state from among several copies is prohibited. This is called no-deletion prinicple. Here,…
To better understand quantum computation we can search for its limits or no-gos, especially if analogous limits do not appear in classical computation. Classical computation easily implements and extensively employs the addition of two bit…
Variational quantum algorithms (VQAs) that estimate values of widely used physical quantities such as the rank, quantum entropies, the Bures fidelity and the quantum Fisher information of mixed quantum states are developed. In addition,…
We investigate the optimal distribution of quantum information over multipartite systems in asymmetric settings. We introduce cloning transformations that take $N$ identical replicas of a pure state in any dimension as input, and yield a…
We recast the quantum no-cloning theorem in a form that preserves spin statistics and apply it to entanglement.
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…