Geometric Parameterization of Kraus Operators with Applications to Quasi Inverse Channels for Multi Qubit Systems

• URL: http://arxiv.org/abs/2512.00577v1
• Date: Sat, 29 Nov 2025 18:08:20 GMT
• Title: Geometric Parameterization of Kraus Operators with Applications to Quasi Inverse Channels for Multi Qubit Systems
• Authors: Zain Ateeq, Muhammad Faryad,
• Abstract summary: This work presents a differentiable geometric parameterization of quantum channels in Kraus representation.<n>Machine learning based algorithms have been employed successfully to find quasi inverse of quantum channels.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse channels, which can be a tedious analytically for complex noise processes and is often achievable only for a limited range of parameters. In this regard, machine learning based algorithms have been employed successfully to find quasi inverse of quantum channels. The space of quantum channels in this scheme is a unit hypersphere, and components of mutually constrained unit vectors residing in this space, are used to construct a physically valid quantum channel. Symplectic constraints, orthogonality, and unit length of the vectors suffice to maintain complete positivity and the trace-preserving property of the channels. By performing gradient descent on this parametric space with a fidelity-based loss function, this approach is found to optimize quasi inverse of a variety of quantum channels, not limited to single-qubits, proving its effectiveness.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Quantum Paths: a Quantum Walk approach [4.376469285036708]
  We present preliminary theoretical results demonstrating that, by applying tools of the quantum random walk framework to the spatial superposition of channels, it is possible to replicate the output of a quantum switch.<n>These findings suggest a promising and more feasible route to emulate the quantum switch, offering both practical advantages and interpretative clarity.
  arXiv  Detail & Related papers  (2025-08-25T14:43:29Z)
• Tangent Space Excitation Ansatz for Quantum Circuits [0.0]
  We introduce a textittangent-space excitation ansatz for quantum circuits.<n>We show that a large number of low-energy states can be accurately captured.
  arXiv  Detail & Related papers  (2025-07-10T11:22:13Z)
• A Universal Quantum Computer From Relativistic Motion [0.5999777817331317]
  We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach.<n>The variational quantum circuit consists of tunable single-qubit rotations and entangling gates that are implemented successively.
  arXiv  Detail & Related papers  (2024-10-31T18:01:02Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Weyl channels for multipartite systems [42.37986459997699]
  Quantum channels describe unitary and non-unitary evolution of quantum systems. We show that these channels are completely characterized by elements drawn of finite cyclic groups.
  arXiv  Detail & Related papers  (2023-10-17T02:45:47Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum channel decomposition with pre- and post-selection [0.7597059965024503]
  This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum states. We explicitly determine the requisite number of decomposing channels, which could be significantly smaller than the selection-free scenario. We demonstrate an application of this approach to the quantum linear solver algorithm, highlighting the efficacy of the proposed method.
  arXiv  Detail & Related papers  (2023-05-19T12:48:21Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)

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.