Optimal pure state cloning and transposition are complementary channels

• URL: http://arxiv.org/abs/2603.23628v2
• Date: Thu, 26 Mar 2026 18:32:45 GMT
• Title: Optimal pure state cloning and transposition are complementary channels
• Abstract summary: State cloning and state transposition are fundamental transformations which, despite being desirable, cannot be perfectly realised.<n>We show that the best physically allowed realisation of both transformations arises from a single physical process described by an isometry.
• Score: 0.4666493857924358
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: State cloning and state transposition are fundamental transformations which, despite being desirable, cannot be perfectly realised due to two conceptually distinct constraints of quantum theory: cloning is forbidden by linearity, while transposition is ruled out by complete positivity. In this work, we show that, despite these different constraints, the best physically allowed realisation of both transformations arises from a single physical process described by an isometry, which simultaneously implements their best possible approximations. We first determine the optimal fidelity for transforming $N$ qudits into $K$ copies of their transposition and show that, for pure input states, it is achieved by an estimation strategy, which is the unique optimal strategy under the worst-case fidelity figure of merit. We further prove that the corresponding $N \to K$ transposition map is the complementary channel of the optimal universal symmetric $N \to N + K$ quantum cloning machine on pure states. We then present an explicit quantum circuit that realises $N \to K$ transposition and $N \to N + K$ cloning in parallel and analyse its gate efficiency. Finally, we investigate mixed-state $N \to 1$ qudit transposition and determine its maximal performance in terms of white-noise visibility, yielding the structural physical approximation of transposition in the multicopy regime.

Related papers

• Optimal copy complexity of quantum state cloning [0.16992697670497803]
  We show the optimal complexity for $d$-dimensional states of at least $1-varepsilon$.<n>We also show that high-fidelity tomography can be coherently converted into cloning with comparable error.
  arXiv  Detail & Related papers  (2026-08-25T12:29:10Z)
• Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms [0.0]
  We develop efficient quantum algorithms for fermionic non-Gaussianity, all built on the eigenvalue structure of the operator $= sum_j=12n_jotimes_j.<n>We introduce the emphbridge degree of even pure states, a novel non-Gaussianity monotone defined as the largest eigenvalue sector of $$ populated by two copies of the state.
  arXiv  Detail & Related papers  (2026-06-03T16:29:05Z)
• Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs [5.480908143128776]
  Quantum purity (QPA) is the task of coherently transforming $n$ copies of a mixed state into high-fidelity copies of a chosen eigenstate.<n>We characterize the optimal channel and derive its all-site and one-site performance laws across output regimes.
  arXiv  Detail & Related papers  (2026-05-20T17:47:32Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• Antisymmetrization of composite fermionic states for quantum simulations of nuclear reactions in first-quantization mapping [0.0]
  I present a first-quantization deterministic algorithm for antisymmetrizing a spatially separated target-projectile system.<n>The method constructs a fully antisymmetric wavefunction from the product of two independently antisymmetrized many-body states.
  arXiv  Detail & Related papers  (2025-12-18T03:50:20Z)
• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Generalized Gradient Norm Clipping & Non-Euclidean $(L_0,L_1)$-Smoothness [51.302674884611335]
  This work introduces a hybrid non-Euclidean optimization method which generalizes norm clipping by combining steepest descent and conditional gradient approaches.<n>We discuss how to instantiate the algorithms for deep learning and demonstrate their properties on image classification and language modeling.
  arXiv  Detail & Related papers  (2025-06-02T17:34:29Z)
• Enhancing Quantum State Reconstruction with Structured Classical Shadows [22.432806329828782]
  We introduce a projected classical shadow (PCS) method with guaranteed performance for QST based on Haar-random projective measurements.<n>PCS extends the standard CS method by incorporating a projection step onto the target subspace.<n>For matrix product operator states, we demonstrate that the PCS method can recover the ground-truth state with $O(n2)$ total state copies.
  arXiv  Detail & Related papers  (2025-01-06T17:09:38Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Transformers as Support Vector Machines [54.642793677472724]
  We establish a formal equivalence between the optimization geometry of self-attention and a hard-margin SVM problem. We characterize the implicit bias of 1-layer transformers optimized with gradient descent. We believe these findings inspire the interpretation of transformers as a hierarchy of SVMs that separates and selects optimal tokens.
  arXiv  Detail & Related papers  (2023-08-31T17:57:50Z)
• Quantum Dueling: an Efficient Solution for Combinatorial Optimization [3.7398607565670536]
  We present a new algorithm for generic optimization, which we term quantum dueling. Quantum dueling innovates by integrating an additional qubit register, effectively creating a dueling'' scenario where two sets of solutions compete. Our work demonstrates that increasing the number of qubits allows the development of previously unthought-of algorithms, paving the way for advancement of efficient quantum algorithm design.
  arXiv  Detail & Related papers  (2023-02-20T18:33:55Z)
• Real quantum operations and state transformations [44.99833362998488]
  Resource theory of imaginarity provides a useful framework to understand the role of complex numbers. In the first part of this article, we study the properties of real'' (quantum) operations in single-party and bipartite settings. In the second part of this article, we focus on the problem of single copy state transformation via real quantum operations.
  arXiv  Detail & Related papers  (2022-10-28T01:08:16Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum Optimal Control via Semi-Automatic Differentiation [0.0]
  We develop a framework that combines gradient-based methods of quantum optimal control with automatic differentiation. The approach allows to optimize practically any computable functional. We illustrate and benchmark the use of semi-automatic differentiation for the optimization of perfectly entangling quantum gates on superconducting qubits.
  arXiv  Detail & Related papers  (2022-05-27T16:40:00Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Process-optimized phase covariant quantum cloning [4.974890682815778]
  We compute the optimal global fidelity for phase-covariant cloning machines via semi-definite programming optimization. We also consider optimal simulations of the cloning and transpose cloning map, both by a direct optimization and by a composition of component-wise QCMs.
  arXiv  Detail & Related papers  (2021-07-07T07:00:40Z)
• Internal Boundary between Entanglement and Separability Within a Quantum State [5.439020425819001]
  We show that whether a quantum state is entangled or not is determined by a threshold within the quantum state. For an arbitrary quantum state, we provide operational algorithms to obtain its optimal entangled state, its optimal separable state, its best separable approximation (BSA) decomposition.
  arXiv  Detail & Related papers  (2020-03-01T23:06:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.