相关论文: Impossibility of comparing and sorting quantum sta…

It is known that to imperfectly clone a phase-set of states uncorrelatedly is impossible due to the linearity and the hermitian-preservation of quantum operations deterministically shown by D'Ariano et al. In this paper we address…

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…

Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…

We investigate the problem of copying pure two-qubit states of a given degree of entanglement in an optimal way. Completely positive covariant quantum operations are constructed which maximize the fidelity of the output states with respect…

We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…

Quantum computing is a growing field where the information is processed by two-levels quantum states known as qubits. Current physical realizations of qubits require a careful calibration, composed by different experiments, due to noise and…

We present a general scheme to realize the POVMs for the unambiguous discrimination of quantum states. For any set of pure states it enables us to set up a feasible linear optical circuit to perform their optimal discrimination, if they are…

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…

The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…

Quantum no-cloning, the impossibility of perfectly cloning an arbitrary unknown quantum state, is one of the most fundamental limitations due to the laws of quantum mechanics, which underpin the physical security of quantum key…

We investigate the discrimination of pure-mixed (quantum filtering) and mixed-mixed states and compare their optimal success probability with the one for discriminating other pairs of pure states superposed by the vectors included in the…

The theory of generalised measurements is used to examine the problem of discriminating unambiguously between non-orthogonal pure quantum states. Measurements of this type never give erroneous results, although, in general, there will be a…

The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…

It is possible to reduce some types of quantum computation errors by symmetrizing the quantum state of a redundant array. Various models are discussed.

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…

Quantum process tomography (QPT) methods aim at identifying a given quantum process. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the…

It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…

Sorting is a fundamental computational process, which facilitates subsequent searching of a database. It can be thought of as factorisation of the search process. The location of a desired item in a sorted database can be found by classical…

An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…