Optimal representation of quantum channels

• URL: http://arxiv.org/abs/2002.05507v1
• Date: Thu, 13 Feb 2020 14:15:34 GMT
• Title: Optimal representation of quantum channels
• Authors: Paulina Lewandowska, Ryszard Kukulski, {\L}ukasz Pawela
• Abstract summary: It is achieved by finding a base of the cone of positive semidefinite matrices which represent quantum channels. This is implemented in the Julia programming language as a part of the QuantumInformation.jl package.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work shows an approach to reduce the dimensionality of matrix representations of quantum channels. It is achieved by finding a base of the cone of positive semidefinite matrices which represent quantum channels. Next, this is implemented in the Julia programming language as a part of the QuantumInformation.jl package.

Related papers

• 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)
• A Quantum Approximate Optimization Method For Finding Hadamard Matrices [0.0]
  We propose a novel qubit-efficient method by implementing the Hadamard matrix searching algorithm on a gate-based quantum computer. We present the formulation of the method, construction of corresponding quantum circuits, and experiment results in both a quantum simulator and a real gate-based quantum computer.
  arXiv  Detail & Related papers  (2024-08-15T06:25:50Z)
• Matrix Multiplication on Quantum Computer [11.527403788898457]
  We design optimized quantum adders and multipliers based on Quantum Fourier Transform (QFT) We construct a basic universal quantum matrix multiplication and extend it to the Strassen algorithm.
  arXiv  Detail & Related papers  (2024-08-06T10:25:02Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information [0.9208007322096533]
  We study representation theory of the partially transposed permutation matrix algebra. We show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels. We derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol.
  arXiv  Detail & Related papers  (2023-10-03T17:55:10Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Generating random quantum channels [1.0499611180329802]
  Several techniques of generating random quantum channels, which act on the set of $d$-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show under which conditions they become mathematically equivalent. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states.
  arXiv  Detail & Related papers  (2020-11-05T17:35:30Z)
• On diagonal quantum channels [0.0]
  It is shown that action of every diagonal quantum channel on pure state from computational basis is a convex combination of pure states determined by some transition probabilities. It is presented an algorithmic method to find an explicit form for Kraus operators of diagonal quantum channels.
  arXiv  Detail & Related papers  (2020-10-31T10:52:19Z)

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.