arXiv:1806.05624 · Physical Review A

Tsirelson's bound and Landauer's principle in a single-system game

Luciana Henaut, Lorenzo Catani, Dan E. Browne, Shane Mansfield, Anna Pappa

Published Dec 17, 2018• 18 citations

Abstract

We introduce a simple single-system game inspired by the Clauser-Horne-Shimony-Holt (CHSH) game. For qubit systems subjected to unitary gates and projective measurements, we prove that any strategy in our game can be mapped to a strategy in the CHSH game, which implies that Tsirelson's bound also holds in our setting. More generally, we show that the optimal success probability depends on the reversible or irreversible character of the gates, the quantum or classical nature of the system, and the system dimension. We analyze the bounds obtained in light of Landauer's principle, showing the entropic costs of the erasure associated with the game. This demonstrates a connection between the reversibility in fundamental operations embodied by Landauer's principle and Tsirelson's bound that arises from the restricted physics of a unitarily evolving single-qubit system.

DOI: 10.1103/physreva.98.060302

Related papers

Non-Hermitian CHSH* Game with a Single Trapped-Ion Qubit

Xiao 潇 Song 宋, Teng Liu, Ji Bian +4 more

Abstract The Clauser–Horne–Shimony–Holt (CHSH) game provides a captivating illustration of the advantages of quantum strategies over classical ones. In a recent study, a variant of the CHSH game leveraging a single qubit system, referred to as the CHSH* game, has been identified. We demonstrate that this mapping relationship between these two games remains effective even for a non-unitary gate. Here we delve into the breach of Tsirelson’s bound in a non-Hermitian system, predicting changes in the upper and lower bounds of the player’s winning probability when employing quantum strategies in a single dissipative qubit system. We experimentally explore the impact of the CHSH* game on the player’s winning probability in a single trapped-ion dissipative system, demonstrating a violation of Tsirelson’s bound under the influence of parity-time ( P T ) symmetry. These results contribute to a deeper understanding of the influence of non-Hermitian systems on quantum games and the behavior of quantum systems under P T symmetry, which is crucial for designing more robust and efficient quantum protocols.

Chinese Physics LettersMay 8, 20242 citations

Robust violation of a multipartite Bell inequality from the perspective of a single-system game

Gang-Gang He, Xing-Yan Fan, Fulin Zhang

Recently, Fan et al. [Mod. Phys. Lett. A 36, 2150223 (2021)] presented a generalized Clauser–Horne–Shimony–Holt (CHSH) inequality, to identify [Formula: see text]-qubit Greenberger–Horne–Zeilinger states. They showed an interesting phenomenon that the maximal violation of the generalized CHSH inequality is robust under some specific noises. In this work, we map the inequality to the CHSH game, and consequently to the CHSH* game in a single-qubit system. This mapping provides an explanation for the robust violations in [Formula: see text]-qubit systems. Namely, the robust violations, resulting from the degeneracy of the generalized CHSH operators correspond to the symmetry of the maximally entangled two-qubit states and the identity transformation in the single-qubit game. This explanation enables us to exactly demonstrate that the degeneracy is [Formula: see text].

arXiv:2202.05980Modern Physics Letters AApr 20, 20222 citations

Classical command of quantum systems via rigidity of CHSH games

Ben W. Reichardt, Falk Unger, Umesh V. Vazirani

Can a classical system command a general adversarial quantum system to realize arbitrary quantum dynamics? If so, then we could realize the dream of device-independent quantum cryptography: using untrusted quantum devices to establish a shared random key, with security based on the correctness of quantum mechanics. It would also allow for testing whether a claimed quantum computer is truly quantum. Here we report a technique by which a classical system can certify the joint, entangled state of a bipartite quantum system, as well as command the application of specific operators on each subsystem. This is accomplished by showing a strong converse to Tsirelson's optimality result for the Clauser-Horne-Shimony-Holt (CHSH) game: the only way to win many games is if the bipartite state is close to the tensor product of EPR states, and the measurements are the optimal CHSH measurements on successive qubits. This leads directly to a scheme for device-independent quantum key distribution. Control over the state and operators can also be leveraged to create more elaborate protocols for reliably realizing general quantum circuits.

arXiv:1209.0449Sep 3, 201213 citations

A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games

Ben W. Reichardt, Falk Unger, Umesh V. Vazirani

arXiv:1209.0448Sep 3, 201225 citations

Tsirelson's gräns : Introduktion och Exempel

Kaarna, Amanda

Tsirelson's bound is the upper bound for a Bell inequality which is valid for all quantum mechanical systems. We discuss why Tsirelson's bound was developed by looking at some historical arguments in quantum physics, such as the Einstein-Podolsky-Rosen (EPR) paradox, an argument for the quantum mechanical description of physical reality being incomplete, and local hidden variables. We present the counterargument to those theories, Bell's inequality, which later expanded to include any inequality that a local system fulfills, but that an entangled quantum system can violate. We present the proof of two specific Bell inequalities: the Clauser-Horne-Shimony-Holt (CHSH) inequality and the I3322 inequality. Then the Tsirelson's bound for the CHSH inequality is proven with a simple system of two entangled spin-1/2 particles and with a general argument that is valid for all entangled systems. We give the upper quantum bound for the generalized CHSH inequality, which describes the situation that we have more than two measurement options, by using semidefinite programming. We prove the Tsirelson's bound for the I3322 inequality by using maximally entangled systems and semidefinite programming. Finally, we discuss the upper bounds that are obtained from these different methods.

Jan 1, 20220 citations

Quantum vs Classical Erasure: Equal Bounds but Unequal Costs

Jan Neuser, Jake Xuereb, Pharnam Bakhshinezhad +1 more

Irreversibility has a fundamental thermodynamic cost, erasing information inevitably generates heat. This connection is quantified by the Landauer bound, which gives the minimum dissipation needed to erase a single bit of information. While this bound applies in both classical and quantum settings, it is saturated only in idealised limits of infinite resources. Here, we provide a unified first principles description of finite-resource erasure in both classical and quantum systems. We begin by proving the communal folklore that in the idealised regime the erasure cost of a bit encoded in a quantum or classical system is the same. Despite this, we show that their practical implementation differs substantially: achieving comparable erasure quality in quantum systems requires more control, larger accessible energy gaps and longer operation times. Classical protocols can achieve the erasure of a comparable quantum protocol under far weaker constraints which we expose in trade-off relations. Our results explain why practical erasure schemes fall short of Landauer's bound and show that classical systems enjoy several fundamental thermodynamic advantages.

quant-pharXiv:2607.27341Jul 31, 20260 citations