Semi-definite optimization of the measured relative entropies of quantum states and channels

• URL: http://arxiv.org/abs/2406.19060v1
• Date: Thu, 27 Jun 2024 10:20:56 GMT
• Title: Semi-definite optimization of the measured relative entropies of quantum states and channels
• Authors: Zixin Huang, Mark M. Wilde,
• Abstract summary: We show that measured relative entropies of quantum states and channels can be calculated efficiently by means of semi-definite programming. Not only do the programs output the optimal values of the measured relative entropies of states and channels, but they also provide numerical characterizations of optimal strategies for achieving them.
• Score: 3.9134031118910264
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The measured relative entropies of quantum states and channels find operational significance in quantum information theory as achievable error rates in hypothesis testing tasks. They are of interest in the near term, as they correspond to hybrid quantum-classical strategies with technological requirements far less challenging to implement than required by the most general strategies allowed by quantum mechanics. In this paper, we prove that these measured relative entropies can be calculated efficiently by means of semi-definite programming, by making use of variational formulas for the measured relative entropies of states and semi-definite representations of the weighted geometric mean and the operator connection of the logarithm. Not only do the semi-definite programs output the optimal values of the measured relative entropies of states and channels, but they also provide numerical characterizations of optimal strategies for achieving them, which is of significant practical interest for designing hypothesis testing protocols.

Related papers

• Semidefinite optimization of the quantum relative entropy of channels [3.9134031118910264]
  This paper introduces a method for calculating the quantum relative entropy of channels. It provides efficiently computable upper and lower bounds that sandwich the true value with any desired precision.
  arXiv  Detail & Related papers  (2024-10-21T18:00:01Z)
• Quantum Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
  Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method. We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
  arXiv  Detail & Related papers  (2024-07-18T18:57:29Z)
• Optimising the relative entropy under semi definite constraints -- A new tool for estimating key rates in QKD [0.0]
  Finding the minimal relative entropy of two quantum states under semi definite constraints is a pivotal problem. We provide a method that addresses this optimisation. We build on a recently introduced integral representation of quantum relative entropy by P.E. Frenkel.
  arXiv  Detail & Related papers  (2024-04-25T20:19:47Z)
• Adaptive measurement strategy for quantum subspace methods [0.0]
  We propose an adaptive measurement optimization method that is useful for the quantum subspace methods. The proposed method first determines the measurement protocol for classically simulatable states, and then adaptively updates the protocol of quantum subspace expansion. As a numerical demonstration, we have shown for excited-state simulation of molecules that we are able to reduce the number of measurements by an order of magnitude.
  arXiv  Detail & Related papers  (2023-11-14T04:00:59Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• 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)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• Quasiprobabilistic state-overlap estimator for NISQ devices [0.39583175274885335]
  A key concept, the state overlap between two quantum states, offers a natural tool to verify and cross-validate quantum simulators and quantum computers. Here, we demonstrate a practical approach for measuring the overlap between quantum states based on a factorable quasiprobabilistic representation of the states.
  arXiv  Detail & Related papers  (2021-12-22T01:51:31Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Direct estimation of quantum coherence by collective measurements [54.97898890263183]
  We introduce a collective measurement scheme for estimating the amount of coherence in quantum states. Our scheme outperforms other estimation methods based on tomography or adaptive measurements. We show that our method is accessible with today's technology by implementing it experimentally with photons.
  arXiv  Detail & Related papers  (2020-01-06T03:50:42Z)

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.