Progress toward practical quantum cryptanalysis by variational quantum cloning

Cryptanalysis of quantum cryptographic systems generally involves finding optimal adversarial attack strategies on the underlying protocols. The core principle of modeling quantum attacks often reduces to the ability of the adversary to clone unknown quantum states and to extract thereby meaningful secret information. Explicit optimal attack strategies typically require high computational resources due to large circuit depths or, in many cases, are unknown. Here we introduce variational quantum cloning (VarQlone), a cryptanalysis algorithm based on quantum machine learning, which allows an adversary to obtain optimal approximate cloning strategies with short depth quantum circuits, trained using hybrid classical-quantum techniques. The algorithm contains operationally meaningful cost functions with theoretical guarantees, quantum circuit structure learning and gradient-descent-based optimization. Our approach enables the end-to-end discovery of hardware-efficient quantum circuits to clone specific families of quantum states, which we demonstrate in an implementation on the Rigetti Aspen quantum hardware. We connect these results to quantum cryptographic primitives and derive explicit attacks facilitated by VarQlone. We expect that quantum machine learning will serve as a resource for improving attacks on current and future quantum cryptographic protocols

Strategies and Networks for State-Dependent Quantum Cloning

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 maximum global fidelity of $N$ approximate clones given $M$ initial exact copies, where $N>M$. We also consider strategies which interpolate between approximate and exact cloning. A tight inequality is obtained which expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit as $N{\to}{\infty}$, to a known inequality which expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are describedComment: 12 pages, 6 eps figures, submitted to Phys. Rev.

Experimental asymmetric phase-covariant quantum cloning of polarization qubits

We report on two optical realizations of the $1 \to 2$ asymmetric phase-covariant cloning machines for polarization states of single photons. The experimental setups combine two-photon interference and tunable polarization filtering that enables us to control the asymmetry of the cloners. The first scheme involves a special unbalanced bulk beam splitter exhibiting different splitting ratios for vertical and horizontal polarizations, respectively. The second implemented scheme consists of a balanced fiber coupler where photon bunching occurs, followed by a free-space part with polarization filters. With this later approach we were able to demonstrate very high cloning fidelities which are above the universal cloning limit.Comment: 7 pages, 8 figure

Several experimental realizations of symmetric phase-covariant quantum cloner of single-photon qubits

We compare several optical implementations of phase-covariant cloning machines. The experiments are based on copying of the polarization state of a single photon in bulk optics by special unbalanced beam splitter or by balanced beam splitter accompanied by a state filtering. Also the all-fiber based setup is discussed, where the information is encoded into spatial modes, i.e., the photon can propagate through two optical fibers. Each of the four implementations possesses some advantages and disadvantages that are discussed.Comment: 8 pages, 11 figure

General impossible operations in quantum information

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations.Comment: 15 pages, no figures, Discussion about personal quantum computer remove