Related papers: Improving the Fidelity of deletion

In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting…

Suppose we are given two identical copies of an unknown quantum state and we wish to delete one copy from among the given two copies. The quantum no-deletion principle restricts us from perfectly deleting a copy but it does not prohibit us…

In this paper, a generalized input state dependent deletion machine called probabilistic quantum deletion machine is proposed. Considering the Pati-Braunstein deletion machine as a benchmark, the machine is characterized by its deletion…

In this work, we design a deleting machine and shown that for some given condition on machine parameters, it gives slightly better result than P-B deleting machine [5,6]. Also it is shown that for some particular values of the machine…

Quantum mechanics put restriction on performing some task which we can do classically. One such restriction is that we cannot copy an arbitrary quantum state. This is known as No-cloning theorem. Although quantum mechanics forbid us to…

Coherence, being at the heart of interference phenomena, is found to be an useful resource in quantum information theory. Here we want to understand quantum coherence under the combination of two fundamentally dual processes, viz., cloning…

The accurate measurement of quantum two-level objects (qubits) is crucial for developing quantum computers. Over the last decade, the measure of choice for benchmarking readout routines for superconducting qubits has been assignment…

One of the fundamental restrictions that quantum mechanics imposes is the "No deletion Theorem" which tells us that given two identical unknown quantum states, it is impossible to delete one of them. But nevertheless if not perfect, people…

In conventional quantum mechanics, quantum no-deleting and no-cloning theorems indicate that two different and nonorthogonal states cannot be perfectly and deterministically deleted and cloned, respectively. Here, we investigate the quantum…

Deep imitation learning is promising for solving dexterous manipulation tasks because it does not require an environment model and pre-programmed robot behavior. However, its application to dual-arm manipulation tasks remains challenging.…

We establish the best possible approximation to a perfect quantum cloning machine which produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for…

We find that very different quantum copying machines are optimal depending on the indicator used to assess their performance. Several quantum copying machine models acting on non-orthogonal input states are investigated, and assessed…

The fidelity and local unitary transformation are two widely useful notions in quantum physics. We study two constrained optimization problems in terms of the maximal and minimal fidelity between two bipartite quantum states undergoing…

We quantify the amount of correlation generated between two different output modes in the process of im- perfect cloning and deletion processes. We use three different measures of correlations and study their role in determining the…

We introduce a simple protocol for adaptive quantum state tomography, which reduces the worst-case infidelity between the estimate and the true state from $O(N^{-1/2})$ to $O(N^{-1})$. It uses a single adaptation step and just one extra…

In this work, we introduce a special kind of quantum cloning machine called Hybrid quantum cloning machine. The introduced Hybrid quantum cloning machine or transformation is nothing but a combination of pre-existing quantum cloning…

Fidelity is known to increase through any Kraus map: the fidelity between two density matrices is less than the fidelity between their images via a Kraus map. We prove here that, in average, fidelity is also increasing for any discrete-time…

Environment-induced decoherence presents a great challenge to realizing a quantum computer. We point out the somewhat surprising fact that decoherence can be useful, indeed necessary, for practical quantum computation, in particular, for…

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two…

We study the fidelity susceptibility of two SU(2)-invariant reduced density matrices. Due to the commuting property of these matrices, analytical results for reduced fidelity susceptibility are obtained and can be applied to study quantum…