Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Closed-form autonomous optimal cloning on spin networks beyond the star: fractional revival, perfect transfer and balanced beam splitters in symmetric sectors

Hikaru Wakaura

Published Oct 19, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

Abstract Copying quantum information is forbidden by the no-cloning theorem, yet approximate copies with the highest fidelity allowed by quantum mechanics are a basic resource for quantum networks and for assessing the security of quantum key distribution. Such cloners are usually gate sequences, but a spin network with fixed couplings can perform the transformation autonomously: the unknown qubit and blank qubits sit on the vertices of a graph and the free evolution does the rest. Until now, the only spin graph known to reach the optimal phase-covariant fidelity for every number of clones $M$ was the star with a tuned anisotropy. Which other graphs can clone optimally, and why, has remained open. Here we show that the complete bipartite graph $K_{2,M-1}$---the unknown qubit and one target on one side, the remaining targets on the other---reaches the optimal $1\to M$ phase-covariant fidelity for every $M\ge 3$, with all couplings given in closed form. For odd $M$ a staggered Ising anisotropy suffices, with the parameters fixed by two integers; for even $M$ an additional Ising coupling among the middle targets is required, with its value an explicit algebraic number. Both families reduce, in the permutation-symmetric sectors, to two four-level problems: a perfect-state-transfer ladder on a four-cycle and a freeze block whose characteristic polynomial we obtain analytically. We verify the formulas with no free parameter up to $M=10$ and classify exactness for all four-vertex graphs with a least-squares test of the exact revival and transfer equations. The results connect the fractional-revival engineering of spin chains to optimal cloning and identify the hidden involution behind both. Beyond cloning, optimal quantum machines can thus be read off from the spectrum of small symmetric blocks, suggesting autonomous implementations of other covariant transformations on spin and Rydberg arrays.

DOI
10.21203/rs.3.rs-11396207/v1

Related papers

Finite-copy optimal cloning of mixed qudit states:\\ exact optima, a closed-form cloner, and the structure of covariant sector channels

Hikaru Wakaura

Abstract Copying is the most basic operation on information, and the no-cloning theorem is the sharpest statement of how quantum information differs from classical. The best approximate copier of pure states has been known for decades, and the asymptotic theory of cloning mixed states at fixed gain $\gamma=m/n$ was recently completed by Schur--Weyl methods, which give closed-form limiting fidelities and an asymptotically optimal ``Schur--Cartan'' cloner. Whether those constructions are also good at the finite copy numbers available in experiments, and what the finite-copy optimum is, was unknown. We show that the finite-copy optimum is a concave program over Young-label transition rules and extremal covariant maps between irreducible sectors, solve it exactly for qubits up to $n=40$ and for qutrits and ququarts at small $n$, and show that the asymptotically optimal cloners lose up to $0.11$ in root fidelity at $n\le 20$, while purify--clone--trace fails at the degenerate spectrum. The loss is entirely in the label rule: the Cartan sector channel is finite-copy optimal for qubits, and in higher dimension it coincides with the lowest-Casimir (minimal Parthasarathy--Ranga Rao--Varadarajan) component, which is within $10^{-3}$ of optimal. A closed-form cloner, a Knothe--Rosenblatt coupling of the input and target label laws followed by lowest-Casimir channels, is asymptotically optimal, improves the Schur--Cartan cloner by up to $0.115$, and comes with Karush--Kuhn--Tucker and Frank--Wolfe certificates bracketing the true optimum to $10^{-3}$ without semidefinite programming. The analysis isolates a single representation-theoretic question, the pairwise optimality of the PRV channel at intermediate spectral mixedness, settled here in the cold and hot limits and for single-copy inputs, which governs how much coherent cloning advantage survives at the copy numbers of near-term quantum networks.

•Oct 26, 2026•0 citations

Cloning transformations in spin networks without external control

Gabriele De Chiara, Rosario Fazio, Chiara Macchiavello +2 more

In this paper we present an approach to quantum cloning with unmodulated spin networks. The cloner is realized by a proper design of the network and a choice of the coupling between the qubits. We show that in the case of phase covariant cloner the $XY$ coupling gives the best results. In the $1\ensuremath{\rightarrow}2$ cloning we find that the value for the fidelity of the optimal cloner is achieved, and values comparable to the optimal ones in the general $N\ensuremath{\rightarrow}M$ case can be attained. If a suitable set of network symmetries are satisfied, the output fidelity of the clones does not depend on the specific choice of the graph. We show that spin network cloning is robust against the presence of static imperfections. Moreover, in the presence of noise, it outperforms the conventional approach. In this case the fidelity exceeds the corresponding value obtained by quantum gates even for a very small amount of noise. Furthermore, we show how to use this method to clone qutrits and qudits. By means of the Heisenberg coupling it is also possible to implement the universal cloner although in this case the fidelity is 10% off that of the optimal cloner.

arXiv:quant-ph/0410211•Physical Review A•Jul 22, 2005•27 citations

Asymmetric quantum cloning on orthogonal orbits and four-mode fermionic states

Piotr Ćwikliński, Michał Studziński

In this work, we study asymmetric $(1\to2)$ quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension $(d\geq3)$, we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be implemented using only operations which preserve fermionic Gaussian states.

quant-pharXiv:2609.22047•Sep 21, 2026•0 citations

Asymmetric quantum cloning on orthogonal orbits and four-mode fermionic states — E8 Intelligence Research

Andrew Stewart Caldin

In this work, we study asymmetric $(1\to2)$ quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension $(d\geq3)$, we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be im Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 9, 2026•0 citations

Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning

Pritam Roy, Shashank Gupta

Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For $m\ge2$, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even $m$, exact recovery requires maximal entanglement across the signal--noise cut. For odd $m$, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least $(m-1)k$ ebits of signal--noise entanglement. For graph states, the resource classification reduces to an exact condition on the kernel of the signal--noise cut matrix, leading to binary certification and constructive Clifford recovery. We identify rank-deficient graph resources that attain the architecture-independent entanglement bound and prove that the entire Dicke family, including $W$ states, is excluded for every sector-wise two-Pauli encoder. Our results show that encrypted recovery depends not only on how much entanglement a resource contains, but also on how its correlations are organized relative to the encoder.

quant-pharXiv:2609.28241•Sep 24, 2026•0 citations

Optimal quantum cloning via spin networks

Qing Chen, Jianhua Cheng, Ke-Lin Wang +1 more

In this paper we demonstrate that optimal $1\ensuremath{\rightarrow}M$ phase-covariant cloning quantum cloning is available via free dynamical evolution of spin networks. By properly designing the network and the couplings between spins, we show that optimal $1\ensuremath{\rightarrow}M$ phase-covariant cloning can be achieved if the initial state is prepared as a specific symmetric state. Especially, when $M$ is an odd number, the optimal phase-covariant cloning can be achieved without ancillas. Moreover, we demonstrate that the same framework is capable for optimal $1\ensuremath{\rightarrow}2$ universal cloning.

arXiv:quant-ph/0510147•Physical Review A•Sep 18, 2006•23 citations
Abstract Copying quantum information is forbidden by the no-cloning theorem, yet approximate copies with the highest fidelity allowed by quantum mechanics are a basic resource for quantum networks and for assessing the security of quantum key distribution. Such cloners are usually gate sequences, but a spin network with fixed couplings can perform the transformation autonomously: the unknown qubit and blank qubits sit on the vertices of a graph and the free evolution does the rest. Until now, the only spin graph known to reach the optimal phase-covariant fidelity for every number of clones MMM was the star with a tuned anisotropy. Which other graphs can clone optimally, and why, has remained open. Here we show that the complete bipartite graph K2,M−1K_{2,M-1}K2,M−1​---the unknown qubit and one target on one side, the remaining targets on the other---reaches the optimal 1→M1\to M1→M phase-covariant fidelity for every M≥3M\ge 3M≥3, with all couplings given in closed form. For odd MMM a staggered Ising anisotropy suffices, with the parameters fixed by two integers; for even MMM an additional Ising coupling among the middle targets is required, with its value an explicit algebraic number. Both families reduce, in the permutation-symmetric sectors, to two four-level problems: a perfect-state-transfer ladder on a four-cycle and a freeze block whose characteristic polynomial we obtain analytically. We verify the formulas with no free parameter up to M=10M=10M=10 and classify exactness for all four-vertex graphs with a least-squares test of the exact revival and transfer equations. The results connect the fractional-revival engineering of spin chains to optimal cloning and identify the hidden involution behind both. Beyond cloning, optimal quantum machines can thus be read off from the spectrum of small symmetric blocks, suggesting autonomous implementations of other covariant transformations on spin and Rydberg arrays.
Abstract Copying is the most basic operation on information, and the no-cloning theorem is the sharpest statement of how quantum information differs from classical. The best approximate copier of pure states has been known for decades, and the asymptotic theory of cloning mixed states at fixed gain γ=m/n\gamma=m/nγ=m/n was recently completed by Schur--Weyl methods, which give closed-form limiting fidelities and an asymptotically optimal ``Schur--Cartan'' cloner. Whether those constructions are also good at the finite copy numbers available in experiments, and what the finite-copy optimum is, was unknown. We show that the finite-copy optimum is a concave program over Young-label transition rules and extremal covariant maps between irreducible sectors, solve it exactly for qubits up to n=40n=40n=40 and for qutrits and ququarts at small nnn, and show that the asymptotically optimal cloners lose up to 0.110.110.11 in root fidelity at n≤20n\le 20n≤20, while purify--clone--trace fails at the degenerate spectrum. The loss is entirely in the label rule: the Cartan sector channel is finite-copy optimal for qubits, and in higher dimension it coincides with the lowest-Casimir (minimal Parthasarathy--Ranga Rao--Varadarajan) component, which is within 10−310^{-3}10−3 of optimal. A closed-form cloner, a Knothe--Rosenblatt coupling of the input and target label laws followed by lowest-Casimir channels, is asymptotically optimal, improves the Schur--Cartan cloner by up to 0.1150.1150.115, and comes with Karush--Kuhn--Tucker and Frank--Wolfe certificates bracketing the true optimum to 10−310^{-3}10−3 without semidefinite programming. The analysis isolates a single representation-theoretic question, the pairwise optimality of the PRV channel at intermediate spectral mixedness, settled here in the cold and hot limits and for single-copy inputs, which governs how much coherent cloning advantage survives at the copy numbers of near-term quantum networks.
In this paper we present an approach to quantum cloning with unmodulated spin networks. The cloner is realized by a proper design of the network and a choice of the coupling between the qubits. We show that in the case of phase covariant cloner the XYXYXY coupling gives the best results. In the $1\ensuremath{\rightarrow}2$ cloning we find that the value for the fidelity of the optimal cloner is achieved, and values comparable to the optimal ones in the general $N\ensuremath{\rightarrow}M$ case can be attained. If a suitable set of network symmetries are satisfied, the output fidelity of the clones does not depend on the specific choice of the graph. We show that spin network cloning is robust against the presence of static imperfections. Moreover, in the presence of noise, it outperforms the conventional approach. In this case the fidelity exceeds the corresponding value obtained by quantum gates even for a very small amount of noise. Furthermore, we show how to use this method to clone qutrits and qudits. By means of the Heisenberg coupling it is also possible to implement the universal cloner although in this case the fidelity is 10% off that of the optimal cloner.
In this work, we study asymmetric (1→2)(1\to2)(1→2) quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension (d≥3)(d\geq3)(d≥3), we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be implemented using only operations which preserve fermionic Gaussian states.
In this work, we study asymmetric (1→2)(1\to2)(1→2) quantum cloning for pure states belonging to orbits generated by the orthogonal group. For every dimension (d≥3)(d\geq3)(d≥3), we determine the full region of achievable pairs of average single-copy fidelities. Using orthogonal covariance and the Brauer algebra, we reduce the optimization over all CPTP maps to a finite-dimensional spectral problem and construct explicit optimal cloning channels. We then apply the general results to four-mode fermionic states in the even-parity sector. Using triality, we identify the fixed-concurrence fermionic families with the orthogonal orbits considered in the first part of the paper. In particular, for pure Gaussian states we show that the symmetric locally optimal cloner is unique. We also compare local and global cloning and find that the channel optimal for the joint two-copy fidelity is different from the one optimal for the single-copy fidelities. Finally, we show that the locally optimal cloner cannot be im Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Encrypted quantum cloning distributes an unknown kkk-qubit state among mmm encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For m≥2m\ge2m≥2, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even mmm, exact recovery requires maximal entanglement across the signal--noise cut. For odd mmm, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least (m−1)k(m-1)k(m−1)k ebits of signal--noise entanglement. For graph states, the resource classification reduces to an exact condition on the kernel of the signal--noise cut matrix, leading to binary certification and constructive Clifford recovery. We identify rank-deficient graph resources that attain the architecture-independent entanglement bound and prove that the entire Dicke family, including WWW states, is excluded for every sector-wise two-Pauli encoder. Our results show that encrypted recovery depends not only on how much entanglement a resource contains, but also on how its correlations are organized relative to the encoder.
In this paper we demonstrate that optimal $1\ensuremath{\rightarrow}M$ phase-covariant cloning quantum cloning is available via free dynamical evolution of spin networks. By properly designing the network and the couplings between spins, we show that optimal $1\ensuremath{\rightarrow}M$ phase-covariant cloning can be achieved if the initial state is prepared as a specific symmetric state. Especially, when MMM is an odd number, the optimal phase-covariant cloning can be achieved without ancillas. Moreover, we demonstrate that the same framework is capable for optimal $1\ensuremath{\rightarrow}2$ universal cloning.