A hierarchy of efficient bounds on quantum capacities exploiting symmetry

• URL: http://arxiv.org/abs/2203.02127v1
• Date: Fri, 4 Mar 2022 04:34:15 GMT
• Title: A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• Authors: Omar Fawzi, Ala Shayeghi, and Hoang Ta
• Abstract summary: We exploit the recently introduced $D#$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence. We prove that for fixed input and output dimensions, the regularized sandwiched R'enyi divergence between any two quantum channels can be approximated up to an $epsilon$ accuracy in time.
• Score: 8.717253904965371
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how to compute such quantities. Here, we exploit the symmetries in the recently introduced $D^{\#}$ in order to obtain a hierarchy of semidefinite programming bounds on various regularized quantities. As applications, we give a general procedure to give efficient bounds on the regularized Umegaki channel divergence as well as the classical capacity and two-way assisted quantum capacity of quantum channels. In particular, we obtain slight improvements for the capacity of the amplitude damping channel. We also prove that for fixed input and output dimensions, the regularized sandwiched R\'enyi divergence between any two quantum channels can be approximated up to an $\epsilon$ accuracy in time that is polynomial in $1/\epsilon$.

Related papers

• Estimating quantum amplitudes can be exponentially improved [11.282486674587236]
  Estimating quantum amplitudes is a fundamental task in quantum computing. We present a novel framework for estimating quantum amplitudes by transforming pure states into their matrix forms. Our framework achieves the standard quantum limit $epsilon-2$ and the Heisenberg limit $epsilon-1$, respectively.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Accelerating Quantum Optimal Control of Multi-Qubit Systems with Symmetry-Based Hamiltonian Transformations [3.0126004742841253]
  We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems. Our approach reduces the Hamiltonian size of an $n$-qubit system from 2n by 2n to O(n by n) or O((2n / n) by (2n / n) under Sn or Dn symmetry.
  arXiv  Detail & Related papers  (2023-09-12T00:08:17Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry [14.524074846672526]
  We show that for a fixed output dimension of a quantum channel, we can compute the SDP in time with respect to the level of the hierarchy and input dimension. As a consequence of our result, the optimal fidelity can be approximated with an accuracy of $epsilon$ in $mathrmpoly (1/epsilon, textinput dimension)$ time.
  arXiv  Detail & Related papers  (2023-08-30T09:03:45Z)
• Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound [0.0]
  We show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be classically simulated in subexponential time. We implement an algorithm guaranteed to meet our bound and which finds contraction orders with vastly lower computational times in practice.
  arXiv  Detail & Related papers  (2022-08-02T14:46:52Z)
• Multivariate trace estimation in constant quantum depth [5.908471365011943]
  A folkloric belief is that a depth-$Theta(m)$ quantum circuit is needed to estimate the trace of a $m$ density matrix. We prove that this belief is overly conservative by constructing a constant quantum-depth circuit for the task. We show how to implement our circuit in a highly parallelized way on an architecture similar to that of Google's Sycamore processor.
  arXiv  Detail & Related papers  (2022-06-30T16:44:58Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.