Asymptotic implementation of multipartite quantum channels and other quantum instruments using local operations and classical communication

• URL: http://arxiv.org/abs/2310.05362v1
• Date: Mon, 9 Oct 2023 02:44:28 GMT
• Title: Asymptotic implementation of multipartite quantum channels and other quantum instruments using local operations and classical communication
• Authors: Scott M. Cohen
• Abstract summary: We prove that a quantum channel on a multipartite system may be approximated arbitrarily using local operations and classical communication (LOCC) We illustrate these results by a detailed analysis of a quantum instrument that is known not to be implementable by LOCC.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We prove a necessary condition that a quantum channel on a multipartite system may be approximated arbitrarily closely using local operations and classical communication (LOCC). We then extend those arguments to obtain a condition that applies to all quantum instruments, which range from the most refined case, a generalized measurement, to the most coarse-grained, which is a quantum channel. We illustrate these results by a detailed analysis of a quantum instrument that is known not to be implementable by LOCC, but which can be arbitrarily closely approximated within that framework. As one outgrowth of this analysis, we find a quantum measurement that falls into the same category: it cannot be implemented exactly by LOCC, but can be approximated by LOCC arbitrarily closely. This measurement has an infinite number of outcomes, leaving open the question as to whether or not there exists a measurement within this same category but having only a finite number of outcomes.

Related papers

• Optimal Local Measurements in Many-body Quantum Metrology [3.245777276920855]
  We propose a method dubbed as the "iterative matrix partition" approach to elucidate the underlying structures of optimal local measurements. We find that exact saturation is possible for all two-qubit pure states, but it is generically restrictive for multi-qubit pure states. We demonstrate that the qCRB can be universally saturated in an approximate manner through adaptive coherent controls.
  arXiv  Detail & Related papers  (2023-09-30T07:34:31Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Holography as a resource for non-local quantum computation [0.0]
  We show that any finite-memory quantum system on a circular lattice yields a protocol for non-local quantum computation. Under plausible physical assumptions about quantum in the bulk, our results imply that non-local quantum computation can be performed for anyly complex unitary with a large amount of entanglement.
  arXiv  Detail & Related papers  (2022-10-24T18:00:25Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Almost qudits in the prepare-and-measure scenario [0.0]
  We introduce and investigate quantum information encoded in carriers that nearly, but not entirely, correspond to standard qudits. We show how small higher-dimensional components can significantly compromise the conclusions of established protocols. We also consider viewing almost qubit systems as a physical resource available to the experimenter.
  arXiv  Detail & Related papers  (2022-08-16T18:00:07Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Equivalence checking of quantum circuits by nonlocality [0.6091702876917279]
  We show that this realistic problem can be solved completely from the viewpoints of quantum nonlocality. Specifically, we design an elegant protocol that examines underlying quantum nonlocality. We show that the protocol also works approximately, where the distance between two quantum circuits can be calculated accurately.
  arXiv  Detail & Related papers  (2021-05-06T13:07:24Z)
• Eliminating Intermediate Measurements in Space-Bounded Quantum Computation [0.0]
  We show that it is possible to defer measurements to the end of a quantum computation without increasing the number of ancillary qubits. A key component of our approach involves showing that the well-conditioned versions of many standard linear-algebraic problems may be solved by a quantum computer in less space than seems possible by a classical computer.
  arXiv  Detail & Related papers  (2020-06-05T16:05:49Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.