A quantum copying machine producing two (in general non-identical) copies of an arbitrary input state of a two-dimensional Hilbert space (qubit) is studied using a quality measure based on distinguishability of states, rather than fidelity. The problem of producing optimal copies is investigated with the help of a Bloch sphere representation, and shown to have a well-defined solution, including cases in which the two copies have unequal quality, or the quality depends upon the input state (is ``anisotropic'' in Bloch sphere language), or both. A simple quantum circuit yields the optimal copying machine. With a suitable choice of parameters it becomes an optimal eavesdropping machine for some versions of quantum cryptography, or reproduces the Buzek and Hillery result for isotropic copies.
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 to two separable copies. These optimal copying processes hint at the intricate relationship between fundamental laws of quantum theory and entanglement.
We present a scheme that transform 1 qubit to M identical copies with optimal fidedelity via free dynamical evolution of spin star networks. We show that the Heisenberg XXZ coupling can fulfill the challenge. The initial state of the copying machine and the parameters of the spin Hamiltonian are discussed in detail. Furthermore we have proposed a feasible method to prepare the initial state of the copying machine.
We study the mapping which occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system which, in effect, makes two copies of the first qubit. The general problem of the quality of the resulting copies is discussed using a special representation, a generalization of the usual Schmidt decomposition, of an arbitrary two-dimensional subspace of a tensor product of two 2-dimensional Hilbert spaces. We exhibit quantum circuits which can reproduce the results of any two qubit copying machine of …
A scheme for the optimal Gaussian cloning of coherent light states at the light-atoms interface is proposed. The distinct feature of this proposal is that the clones are stored in an atomic quantum memory, which is important for applications in quantum communication. The atomic quantum cloning machine requires only a single passage of the light pulse through the atomic ensembles followed by the measurement of a light quadrature and an appropriate feedback, which renders the protocol experimentally feasible. An alternative protocol, where one of the clones is carried by the outgoing light pulse…
We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly …
We propose new optimality criterion for the estimation of state-dependent cloning. We call this measure the relative error because the one compares the errors in the copies with contiguous size taking into account the similarity of states to be copied. A copying transformation and dimension of state space are not specified. Only the unitarity of quantum mechanical transformations is used. The presented approach is based on the notion of the angle between two states. Firstly, several useful statements simply expressed in terms of angles are proved. Among them there are the spherical triangle in…
It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We consider the optimal copying transformation which is adapted to classical information transmission by two linearly independent quantum states, and show that there is no additional contribution to the error. Instead the clones are correlated, and this breaks their usefulness: The entanglement increases with non-orthogonality of the states. The capacity of the cor…
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 according to two types of criteria: Transfer of (Shannon) information encoded in the initial states to the copies, and fidelity between the copies and the initial states. Transformations which optimise information transfer for messages encoded in qubits are found. If the message is decoded one symbol at-a-time, information is best copied by a Wootters-Zurek copier…
Although perfect copying of unknown quantum systems is forbidden by the laws of quantum mechanics, approximate cloning is possible. A natural way of realizing quantum cloning of photons is by stimulated emission. In this context the fundamental quantum limit to the quality of the clones is imposed by the unavoidable presence of spontaneous emission. In our experiment a single input photon stimulates the emission of additional photons from a source based on parametric down-conversion. This leads to the production of quantum clones with near optimal fidelity. We also demonstrate universality of …
In a classical world, simultaneous measurements of complementary properties (e.g. position and momentum) give a system's state. In quantum mechanics, measurement-induced disturbance is largest for complementary properties and, hence, limits the precision with which such properties can be determined simultaneously. It is tempting to try to sidestep this disturbance by copying the system and measuring each complementary property on a separate copy. However, perfect copying is physically impossible in quantum mechanics. Here, we investigate using the closest quantum analog to this copying strateg…
We study broadcasting of entanglement where we use universal quantum cloners (in general less optimal) to perform local cloning operations. We show that there is a lower bound on the fidelity of the universal quantum cloners that can be used for broadcasting. We prove that an entanglement is optimally broadcast only when optimal quantum cloners are used for local copying. We also show that broadcasting of entanglement into more than two entangled pairs is forbidden using only local operations.
Probabilistic cloning was first proposed by Duan and Guo. Then Pati established a novel cloning machine (NCM) for copying superposition of multiple clones simultaneously. In this paper, we deal with the novel cloning machine with supplementary information (NCMSI). For the case of cloning two states, we demonstrate that the optimal efficiency of the NCMSI in which the original party and the supplementary party can perform quantum communication equals that achieved by a two-step cloning protocol wherein classical communication is only allowed between the original and the supplementary parties. F…
An optimal universal cloning transformation is derived that produces M copies of an unknown qubit from a pair of orthogonal qubits. For M>6, the corresponding cloning fidelity is higher than that of the optimal copying of a pair of identical qubits. It is shown that this cloning transformation can be implemented probabilistically via parametric down-conversion by feeding the signal and idler modes of a nonlinear crystal with orthogonally polarized photons.
Optimal synthesis of reversible functions is a non-trivial problem. One of the major limiting factors in computing such circuits is the sheer number of reversible functions. Even restricting synthesis to 4-bit reversible functions results in a huge search space (16!~2^44 functions). The output of such a search alone, counting only the space required to list Toffoli gates for every function, would require over 100 terabytes of storage. In this paper, we present an algorithm that synthesizes an optimal circuit for any 4-bit reversible specification. We employ several techniques to make the probl…
By performing local projective measurements on a two-qubit entangled state one can certify in a device-independent way up to one bit of randomness. We show here that general measurements, defined by positive-operator-valued measures, can certify up to two bits of randomness, which is the optimal amount of randomness that can be certified from an entangled bit. General measurements thus provide an advantage over projective ones for device-independent randomness certification.
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These "quantum cloning machines" are important tools for studying a wide variety of tasks, e.g. state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines (both for discrete-dimensional and for continuous-variable quantum systems); in addition, it presents the role of cloning in quantum cry…
In [ PRL, 102, 010401 (2009)], Spekkens et al., have shown that quantum preparation contextuality can power the parity-oblivious multiplexing (POM) task. The bound on the optimal success probability of $n$-bit POM task performed with the classical resources was shown to be the \textit{same} as in a preparation non-contextual theory. This non-contextual bound is violated if the task is performed with quantum resources. While in $2$-bit POM task the optimal quantum success probability is achieved, in 3-bit case optimality was left as an open question. In this paper, we show that the quantum succ…
Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambainis achieved a cheating probability of at most 3/4[Amb01]. On the other hand, Kitaev showed that no quantum protocol can have cheating probability less than 1/sqrt{2} [Kit03] (his lower bound on coin flipping can be easily extended to bit commitment). Closing this gap has since been an important and open question. In this pape…
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted state gives no information without the secret classical data, and that 2n random classical bits are the minimum necessary for informationally secure quantum encryption. Moreover, the quantum operations are shown to have a surprising structur…
In the original BB84 protocol, the bit basis and the phase basis are used with equal probability. Lo et al (J. of Cryptology, 18, 133-165 (2005)) proposed to modify the ratio between the two bases by increasing the final key generation rate. However, the optimum ratio has not been derived. In this letter, in order to examine this problem, the ratio between the two bases is optimized for exponential constraints given Eve's information distinguishability and the final error probability.
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 multi-functional cloner in 1 to 2 copying regime, capable of providing approximate copies of qubits given by various probability distributions, and is optimized for distributions with axial symmetry. Direct applications of the proposed solution are possible in quantum technologies, doubling the range where quantum information is coherently broadcast. It also out…
It is well known that n bits of entropy are necessary and sufficient to perfectly encrypt n bits (one-time pad). Even if we allow the encryption to be approximate, the amount of entropy needed doesn't asymptotically change. However, this is not the case when we are encrypting quantum bits. For the perfect encryption of n quantum bits, 2n bits of entropy are necessary and sufficient (quantum one-time pad), but for approximate encryption one asymptotically needs only n bits of entropy. In this paper, we provide the optimal trade-off between the approximation measure epsilon and the amount of cla…
We demonstrate an experimental method for measuring energy-time entanglement over almost 80 nm spectral bandwidth in a single shot with a quantum bit error rate below 0.5%. Our scheme is extremely cost-effective and efficient in terms of resources as it employs only one source of entangled photons and one fixed unbalanced interferometer per phase-coded analysis basis. We show that the maximum analysis spectral bandwidth is obtained when the analysis interferometers are properly unbalanced, a strategy which can be straightforwardly applied to most of today's experiments based on energy-time and…
An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $ρ_0^{(n)}$ and $ρ_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string i…
While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely solved. In this paper, rigorous solutions to the problem of M to N asymmetric cloning of qudits are obtained in a number of interesting cases. The central result is the solution to the 1 to N universal asymmetric qudit cloning problem for which the exact trade-off in the fidelities of the clones for every N and d is derived. Analogous results are proven for q…
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level of disturbance has to be allowed to cover, e.g., transmission losses. An eavesdropper can attack such systems by replacing a noisy channel by a better one and by performing approximate cloning of transmitted qubits which disturb them but below the noise level assumed by legitimate users. We experimentally demonstrate such symmetric individual eavesdropping on…
A simple derivation of the optimal state estimation of a quantum bit was obtained by using the no-signaling principle. In particular, the no-signaling principle determines a unique form of the guessing probability independently of figures of merit, such as the fidelity or information gain. This proves that the optimal estimation for a quantum bit can be achieved by the same measurement for almost all figures of merit.
Optimal quantum cloning is the process of making one or more copies of an arbitrary unknown input quantum state with the highest possible fidelity. All reported demonstrations of quantum cloning have so far been limited to copying two-dimensional quantum states, or qubits. We report the experimental realization of the optimal quantum cloning of four-dimensional quantum states, or ququarts, encoded in the polarization and orbital angular momentum degrees of freedom of photons. Our procedure, based on the symmetrization method, is also shown to be generally applicable to quantum states of arbitr…
We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We present general statements on the minimal resource requirements and present optimal procedures for a number of important gates, including CNOT and Toffoli gates. We show that one bit of classical communication in each direction is both necessary and sufficient for the non-local implementation of the quantum CNOT, while in general two bits in each direction is r…
Optimal synthesis of reversible functions is a non-trivial problem. One of the major limiting factors in computing such circuits is the sheer number of reversible functions. Even restricting synthesis to 4-bit reversible functions results in a huge search space (16! {\approx} 2^{44} functions). The output of such a search alone, counting only the space required to list Toffoli gates for every function, would require over 100 terabytes of storage. In this paper, we present two algorithms: one, that synthesizes an optimal circuit for any 4-bit reversible specification, and another that synthesiz…
Strong Kantorovich duality for quantum optimal transport with generic cost and optimal couplings on quantum bits
HUN-REN Alfréd Rényi Institute of Mathematics（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Budapest University of Technology and Economics（布达佩斯技术与经济大学）；HUN-REN Wigner Research Centre for Physics（匈牙利科学院维格纳物理研究中心）
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probability B with which Bob can guess Alice's bit choice and the probability A with which Alice can guess both of Bob's bits given that she learns one of the bits with certainty. We prove that 2B + A is greater…
We apply quantum optimal control theory (QOCT) to an exactly solvable non-Markovian open quantum bit (qubit) system to achieve state-independent quantum control and construct high-fidelity quantum gates for moderate qubit decaying parameters. An important quantity, improvement $\mathcal{I}$, is proposed and defined to quantify the correction of gate errors due to the QOCT iteration when the environment effects are taken into account. With the help of the exact dynamics, we explore how the gate error is corrected in the open qubit system and determine the conditions for significant improvement.…
In this paper, we focus on a special framework for quantum coin flipping protocols,_bit-commitment based protocols_, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also analyse a sequence of multi-round protocol that tries to overcome the drawbacks of the previously proposed protocols, in order to lower the bias. We show an intricate cheating strategy for this sequence, which leads to a bias of 1/4. This indicates that a bias of 1/4 might be optimal in such protocols, and also demonstrates that a cleverer proof technique may be …
Global unitary transformations (OPTSWAPS) that optimally increase the bias of any mixed computation qubit in a quantum system -- represented by a diagonal density matrix -- towards a particular state of the computational basis which, in effect, increases its purity are presented. Quantum circuits that achieve this by implementing the above data compression technique -- a generalization of the 3B-Comp used before -- are described. These circuits enable purity increment in the computation qubit by maximally transferring part of its von Neumann or Shannon entropy to any number of surrounding qubi…
