Information causality beyond the random access code model

• URL: http://arxiv.org/abs/2201.08986v1
• Date: Sat, 22 Jan 2022 07:57:14 GMT
• Title: Information causality beyond the random access code model
• Abstract summary: Information causality (IC) was one of the first principles that have been invoked to bound the set of quantum correlations. We use a new quantifier for IC, based on the notion of "redundant information'
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Information causality (IC) was one of the first principles that have been invoked to bound the set of quantum correlations. For some families of correlations, this principle recovers exactly the boundary of the quantum set; for others, there is still a gap. We close some of these gaps using a new quantifier for IC, based on the notion of "redundant information'". The new definition is still obeyed by quantum correlations. This progress was made possible by the recognition that the principle of IC can be captured without referring to the success criterion of random access codes.

Related papers

• Information Causality Characterizes the Set of Quantum Correlations in the Simplest Bell Scenario [0.0]
  Information causality was introduced as a physical principle constraining correlations in non-signaling theories.<n>We derive quantum Bell inequalities that exactly characterize the quantum correlations in the simplest bipartite Bell scenario.
  arXiv  Detail & Related papers  (2026-09-09T17:44:44Z)
• Quantum conditional mutual information and channel capacity [0.0]
  We show that the optimal rate for establishing quantum correlation between two parties, assisted by a third system, is given by half the QCMI.<n>This result naturally extends the classical key generation capacity of Csiszr and Ahlswede to the quantum domain.
  arXiv  Detail & Related papers  (2026-06-24T01:01:57Z)
• Bounds on Nonlocality and Random Access Codes from Extended Information Causality Principle [0.0]
  We extend Information Causality to allow correlations among Alice's inputs.<n>We derive a family of quantum Bell inequalities that strengthen previously known constraints on quantum correlations.<n>We prove that, despite being stronger in general, the extended principle does not improve the bounds obtained from the original Information Causality principle.
  arXiv  Detail & Related papers  (2026-06-01T15:58:11Z)
• Stochastic Quantum Information Geometry and Speed Limits at the Trajectory Level [35.18016233072556]
  We bridge the gap between quantum information geometry and thermodynamics by introducing the Conditional Quantum Fisher Information (CQFI)<n>We show that the CQFI admits a decomposition into incoherent (population) and coherent (basis rotation) contributions, augmented by a transient interference cross-term absent at the ensemble level.
  arXiv  Detail & Related papers  (2026-01-18T16:23:26Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
  Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
  arXiv  Detail & Related papers  (2025-06-25T22:25:47Z)
• Quantum pseudoresources imply cryptography [0.7366405857677227]
  We study the cryptographic usefulness of quantum pseudoresources. We show that quantum resources may play a similarly crucial role in the quantum setting. We propose a new cryptographic functionality that is intrinsically dependent on entanglement as a resource.
  arXiv  Detail & Related papers  (2025-04-21T11:17:30Z)
• Coherence-mixedness trade-offs [2.4940844507983875]
  We show that quantum coherence is severely restricted by environmental noise in general quantum processing. We derive basis-independent constraints on the attainable quantum coherence imposed by the mixedness of a quantum state.
  arXiv  Detail & Related papers  (2024-05-23T09:07:46Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• A simple formulation of no-cloning and no-hiding that admits efficient and robust verification [0.0]
  Incompatibility is a feature of quantum theory that sets it apart from classical theory. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox. We formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification.
  arXiv  Detail & Related papers  (2023-03-05T12:48:11Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Entanglement and Quantum Correlation Measures from a Minimum Distance Principle [0.0]
  Entanglement, and quantum correlation, are precious resources for quantum technologies implementation based on quantum information science. We derive an explicit measure able to quantify the degree of quantum correlation for pure or mixed multipartite states. We prove that our entanglement measure is textitfaithful in the sense that it vanishes only on the set of separable states.
  arXiv  Detail & Related papers  (2022-05-14T22:18:48Z)
• 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)
• Feynman's Path Integral and Complementarity of One-Quantum Interference and Two-Quanta Interference [0.0]
  This paper adjusts the notion of complementarity of first-order and second-order interference. Based on the concept of Feynman's path integral, the validity of the theory is demonstrated. In the next steps of publication, the "self-consistency principle" of such nonlocal quantum causal correlations will be shown and verified.
  arXiv  Detail & Related papers  (2021-12-15T06:33:38Z)
• 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)
• Quantum Causal Inference in the Presence of Hidden Common Causes: an Entropic Approach [34.77250498401055]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links. This approach can lay the foundations of identifying originators of malicious activity on future multi-node quantum networks.
  arXiv  Detail & Related papers  (2021-04-24T22:45:50Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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.