Tight upper bound for the maximal expectation value of the $N$-partite generalized Svetlichny operator

• URL: http://arxiv.org/abs/2409.08490v1
• Date: Fri, 13 Sep 2024 02:32:40 GMT
• Title: Tight upper bound for the maximal expectation value of the $N$-partite generalized Svetlichny operator
• Authors: Youwang Xiao, Zong Wang, Wen-Na Zhao, Ming Li,
• Abstract summary: We consider the $N$-partite scenario and provide an analytical upper bound on the maximal expectation value of the generalized Svetlichny inequality achieved by an arbitrary $N$-qubit system. Our results give feasible experimental implementations in detecting the genuine multipartite non-locality and can potentially be applied to other quantum information processing tasks.
• Score: 4.7487511537612335
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Genuine multipartite non-locality is not only of fundamental interest but also serves as an important resource for quantum information theory. We consider the $N$-partite scenario and provide an analytical upper bound on the maximal expectation value of the generalized Svetlichny inequality achieved by an arbitrary $N$-qubit system. Furthermore, the constraints on quantum states for which the upper bound is tight are also presented and illustrated by noisy generalized Greenberger-Horne-Zeilinger (GHZ) states. Especially, the new techniques proposed to derive the upper bound allow more insights into the structure of the generalized Svetlichny operator and enable us to systematically investigate the relevant properties. As an operational approach, the variation of the correlation matrix we defined makes it more convenient to search for suitable unit vectors that satisfy the tightness conditions. Finally, our results give feasible experimental implementations in detecting the genuine multipartite non-locality and can potentially be applied to other quantum information processing tasks.

Related papers

• Generalized quantum asymptotic equipartition [11.59751616011475]
  We prove that all operationally relevant divergences converge to the quantum relative entropy between two sets of quantum states. In particular, both the smoothed min-relative entropy between two sequential processes of quantum channels can be lower bounded by the sum of the regularized minimum output channel divergences. We apply our generalized AEP to quantum resource theories and provide improved and efficient bounds for entanglement distillation, magic state distillation, and the entanglement cost of quantum states and channels.
  arXiv  Detail & Related papers  (2024-11-06T16:33:16Z)
• Quantum singular value transformation for an arbitrary bounded operator embedded in a unitary operator [0.65268245109828]
  This research extends quantum singular value transformation (QSVT) for general bounded operators embedded in unitary operators on possibly infinite-dimensional Hilbert spaces. We have achieved a refined operator-theoretic understanding of QSVT, leading to a more streamlined approach.
  arXiv  Detail & Related papers  (2024-01-17T07:06:31Z)
• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• Optimal lower bounds for Quantum Learning via Information Theory [3.093890460224435]
  We derive optimal lower bounds for quantum sample complexity in both the PAC and models via an information-theoretic approach. We then turn to a quantum analogue of the Coupon Collector problem, a classic problem from probability theory. All the aspects of the Quantum Coupon Collector problem we study rest on properties of the spectrum of the associated Gram matrix.
  arXiv  Detail & Related papers  (2023-01-05T18:55:04Z)
• The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario [1.9798034349981157]
  We show that the quantum inflation hierarchy is complete for the bilocal scenario in the commuting observables model of locality. We also give a bilocal version of an observation by Tsirelson, namely that in finite dimensions, the commuting observables model and the tensor product model of locality coincide.
  arXiv  Detail & Related papers  (2022-12-21T19:00:09Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• 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)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs [9.661732401406587]
  We show that measurements in no more than 3 out of the possible $3N$ bases can reconstruct the single-qubit reduced density matrices and measure the ability to create coherent superpositions. We demonstrate that a subset of such observables can serve as entanglement witnesses for QAOA-MaxCut states, and further argue that they are especially well tailored for this purpose by defining and computing an entanglement potency metric on witnesses.
  arXiv  Detail & Related papers  (2021-05-04T17:33:15Z)

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.