Related papers: Process optimized quantum cloners via semidefinite…
We propose a non-deterministic CNOT gate based on a quantum cloner, a quantum switch based on all optical routing of single photon by single photon, a quantum-dot spin in a double-sided optical microcavity with two photonic qubits, delay…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
In a recent paper ([1]=quant-ph/0606035) it is shown how the optimal recovery operation in an error correction scheme can be considered as a semidefinite program. As a possible future improvement it is noted that still better error…
We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these…
We suggest a near deterministic compact model of a photonic CNOT gate based on a quantum dot trapped in a double sided optical microcavity and a universal cloner. Our design surpasses the cloner optimal limit of 5/6 and we show that it…
Quantum information can not be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred as quantum cloning, and quantum…
As quantum technology advances, the efficient design of quantum circuits has become an important area of research. This paper provides an introduction to the MCT quantum circuit design problem for reversible Boolean functions with the…
We develop a scalable architecture for quantum computation using controllable electrons of double-dot molecules coupled to a microwave stripline resonator on a chip, which satisfies all Divincenzo criteria. We analyze the performance and…
Semidefinite programs are convex optimisation problems involving a linear objective function and a domain of positive semidefinite matrices. Over the last two decades, they have become an indispensable tool in quantum information science.…
We consider the problem of determining the achievable region of parameters for universal $1 \to 2$ asymmetric quantum cloning. Measuring the cloning performance with the figure of merit of singlet fraction, we show that the physical region…
A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum…
We demonstrate that a phase-independent quantum amplifier of a polarization qubit is a complementary amplifier of the heralded qubit amplifier [N. Gisin, S. Pironio and N. Sangouard, Phys. Rev. Lett. 105, 070501 (2010)]. It employs the…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
Due to the no-cloning theorem, the unknown quantum state can only be cloned approximately or exactly with some probability. There are two types of cloners: universal and state-dependent cloner. The optimal universal cloner has been found…
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…
Due to the no-cloning theorem, generating perfect quantum clones of an arbitrary unknown quantum state is not possible, however approximate quantum clones can be constructed. Quantum telecloning is a protocol that originates from a…
With qubit measurement and control fidelities above the threshold of fault-tolerance, much attention is moving towards the daunting task of scaling up the number of physical qubits to the large numbers needed for fault tolerant quantum…
We consider the entanglement manipulation capabilities of the universal covariant quantum cloner or quantum processor circuit for quantum bits. We investigate its use for cloning a member of a bipartite or a genuine tripartite entangled…
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation…