Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic

• URL: http://arxiv.org/abs/2506.19369v1
• Date: Tue, 24 Jun 2025 06:57:52 GMT
• Title: Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic
• Authors: Snehasish Roy Chowdhury, Sahil Gopalkrishna Naik, Ananya Chakraborty, Ram Krishna Patra, Subhendu B. Ghosh, Pratik Ghosal, Manik Banik, Ananda G. Maity,
• Abstract summary: We show that any one-way communication complexity protocol implemented using a prime-dimensional quantum system can always be simulated exactly by communicating a classical system of the same dimension.<n>In direct analogy with the Gottesman-Knill theorem in quantum computation, our result identifies the same resources as essential for realizing quantum advantage in one-way communication complexity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A recent influential result by Frenkel and Weiner establishes that in presence of shared randomness (SR), any input-output correlation, with a classical input provided to one party and a classical output produced by a distant party, achievable with a d-dimensional quantum system can always be reproduced by a d-dimensional classical system. In contrast, quantum systems are known to offer advantages in communication complexity tasks, which consider an additional input variable to the second party. Here, we show that, in presence of SR, any one-way communication complexity protocol implemented using a prime-dimensional quantum system can always be simulated exactly by communicating a classical system of the same dimension, whenever quantum protocols are restricted to stabilizer state preparations and stabilizer measurements. In direct analogy with the Gottesman-Knill theorem in quantum computation, which attributes quantum advantage to non-stabilizer (or magic) resources, our result identifies the same resources as essential for realizing quantum advantage in one-way communication complexity. We further present explicit tasks where `minimal magic' suffices to offer a provable quantum advantage, underscoring the efficient use of such resources in communication complexity.

Related papers

• Quantum stochastic communication via high-dimensional entanglement [5.009186332667873]
  In this work, we consider a natural quantum information primitive in which the message to be communicated is selected.<n>We introduce a protocol that leverages high-dimensional entanglement to perform this task perfectly.<n>We experimentally demonstrate the protocol's scalability in an optical setup using 8-dimensional entanglement and multi-outcome detection.
  arXiv  Detail & Related papers  (2025-02-07T12:47:49Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum-Amplified Simultaneous Quantum-Classical Communications [0.2982610402087727]
  We investigate how to minimally alter classical FSO systems to provide some element of quantum communication coexisting with classical communications. We show how this is indeed the case, but only at the cost of some additional receiver complexity, relative to standalone quantum communications.
  arXiv  Detail & Related papers  (2024-05-15T06:44:01Z)
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage [5.669806907215807]
  We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. Our work paves the way for immediate applications in near-term quantum technologies.
  arXiv  Detail & Related papers  (2024-03-05T05:09:32Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)

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.