相关论文: Optimal asymmetric cloning machine on a great circ…

We study the feasibility of implementing a quantum NOT gate (approximate) when the quantum state lies between two latitudes on the Bloch's sphere and present an analytical formula for the optimized 1-to-$M$ quantum NOT gate. Our result…

The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry,…

While the no-cloning theorem forbids the perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can take…

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…

We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution…

We solve the problem of achieving the optimal physical approximation of the transposition for pure states of arbitrary quantum systems for finite and infinite dimensions. A unitary realization is also given for any finite dimension, which…

We propose a physically realizable machine which can either generate multiparticle W-like states, or implement high fidelity $1 \to M$ ($M=1,2,... \infty$) anti-cloning of an arbitrary qubit state, in a single step. Moreover this universal…

The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco,…

The simplest $N=2$ supersymmetric quantum mechanical system is realized in terms of the bosonic creation and annihilation operators obeying either ordinary or deformed Heisenberg algebra involving Klein operator. The construction comprises…

In a recent paper by the authors, it is shown that there exists a quasi-Monte Carlo (QMC) rule which achieves the best possible rate of convergence for numerical integration in a reproducing kernel Hilbert space consisting of smooth…

We study the phase-covariant quantum cloning machine for qudits, i.e. the input states in d-level quantum system have complex coefficients with arbitrary phase but constant module. A cloning unitary transformation is proposed. After…

We propose an AutoML system that enables model selection on clustering problems by leveraging optimal transport-based dataset similarity. Our objective is to establish a comprehensive AutoML pipeline for clustering problems and provide…

The conception of almost complete revivals has been introduced recently. In a quantum many-body system local observable may exhibit an almost complete revival to its maximal value at the predetermined moment of time. In this paper we extend…

While algebraic derivations establish theoretical limits for quantum cloning, practical implementations require explicit operator representations that are often unavailable analytically. We present a computational framework that…

We show how to implement the optimal Gaussian $N$-to-$M$ cloning with linear optics and homodyne detection. We also show that the Gaussian $N$-to-$M$ cloning of known-phase coherent states can be performed with the fidelity $\sqrt \frac{2 M…

We discuss the exact cloning of orthogonal but entangled qubits under local operations and classical communication. The amount of entanglement necessary in blank copy is obtained for various cases. Surprisingly this amount is more than 1…

The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry…

We consider a subclass of bipartite CHSH-type Bell inequalities. We investigate operations, which leave their Tsirelson bound invariant, but change their classical bound. The optimal observables are unaffected except for a relative rotation…

Quantum states obey an asymptotic no-cloning theorem, stating that no deterministic machine can reliably replicate generic sequences of identically prepared pure states. In stark contrast, we show that generic sequences of unitary gates can…

Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later…