Some Problems Concerning Quantum Channels and Entropies

• URL: http://arxiv.org/abs/2304.13771v1
• Date: Wed, 26 Apr 2023 18:33:29 GMT
• Title: Some Problems Concerning Quantum Channels and Entropies
• Authors: Mohammad A. Alhejji
• Abstract summary: This thesis describes contributions to the study of optimizing and approximating entropic formulas over relevant subsets of quantum states. It also describes progress on a quantum erasure simulation problem in the high noise regime.
• Score: 3.04585143845864
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fundamental limits on communication rates over quantum channels are given by mathematical expressions involving entropic formulas. Often, it is unclear if these expressions are computable. This thesis describes contributions to the study of optimizing and approximating entropic formulas over relevant subsets of quantum states. It also describes progress on a quantum erasure simulation problem in the high noise regime.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• 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)
• 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)
• Dissipative quasi-particle picture for quadratic Markovian open quantum systems [0.0]
  Correlations between different regions of a quantum many-body system can be quantified. For closed systems, analytical and numerical tools can accurately capture the time-evolution of subsystem entropies. Here, we make progress by formulating a dissipative quasi-particle picture for a general class of noninteracting open quantum systems.
  arXiv  Detail & Related papers  (2021-06-22T18:10:47Z)
• Quantum computing critical exponents [0.0]
  We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain. The order parameter only collapses on one side of the transition due to a slowdown of the quantum algorithm when crossing the phase transition.
  arXiv  Detail & Related papers  (2021-04-02T17:38:20Z)
• Quantum Simulation of Light-Front Parton Correlators [0.0]
  The physics of high-energy colliders relies on the knowledge of non-perturbative parton correlators. We propose a quantum algorithm to perform a quantum simulation of these type of correlators.
  arXiv  Detail & Related papers  (2020-11-02T19:38:33Z)
• Sign Problems in Quantum Field Theory: Classical and Quantum Approaches [0.0]
  lattice field computation theory provides non-perturbative access to equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics, Monte Carlo calculations encounter the so-called sign problem. This thesis details two methods for mitigating or avoiding the sign problem.
  arXiv  Detail & Related papers  (2020-06-05T20:57:51Z)
• On estimating the entropy of shallow circuit outputs [49.1574468325115]
  Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing. We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
  arXiv  Detail & Related papers  (2020-02-27T15:32:08Z)

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.