Strict advantage of complex quantum theory in a communication task

• URL: http://arxiv.org/abs/2505.16523v2
• Date: Mon, 02 Jun 2025 15:37:26 GMT
• Title: Strict advantage of complex quantum theory in a communication task
• Authors: Thomas J. Elliott,
• Abstract summary: We investigate how the presence of complex amplitudes in quantum theory can yield operational advantages over counterpart real formulations.<n>We identify a straightforward communication task for which complex quantum theory exhibits a provably lower communication cost.<n>This substantiates a strict operational advantage of complex quantum theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standard formulations of quantum theory are based on complex numbers: Quantum states can be in superpositions, with weights given by complex probability amplitudes. Motivated by quantum theory promising a range of practical advantages over classical for a multitude of tasks, we investigate how the presence of complex amplitudes in quantum theory can yield operational advantages over counterpart real formulations. We identify a straightforward communication task for which complex quantum theory exhibits a provably lower communication cost than not just any classical approach, but also any approach based on real quantum theory. We certify the necessity of complex quantum theory for optimal approaches to the task through geometric properties of quantum state ensembles that witness the presence of basis-independent complexity. This substantiates a strict operational advantage of complex quantum theory. We discuss the relevance of this finding for quantum advantages in stochastic simulation.

Related papers

• A Variational Quantum Algorithm for Entanglement Quantification [0.3613661942047476]
  We introduce a variational quantum algorithm inspired by Uhlmann's theorem to quantify the Bures entanglement of general quantum states.<n>The algorithm requires a number of ancillary qubits and circuit depth relative to the system size, dimensionality, and free state cardinality, making it scalable for practical implementations.
  arXiv  Detail & Related papers  (2025-07-28T13:22:03Z)
• Quantum complexity in gravity, quantum field theory, and quantum information science [0.0]
  We describe several definitions of complexity, along with their key properties.<n>In quantum many-body systems and quantum field theory (QFT), we discuss a geometric definition of complexity in terms of geodesics on the unitary group.<n>We also outline applications to simple quantum systems, quantum many-body models, and QFTs including conformal field theories (CFTs)
  arXiv  Detail & Related papers  (2025-03-13T18:00:01Z)
• 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)
• Character Complexity: A Novel Measure for Quantum Circuit Analysis [0.0]
  This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum computing concerns. I prove several key properties of character complexity and establish a surprising connection to the classical simulability of quantum circuits. I present innovative visualization methods for character complexity, providing intuitive insights into the structure of quantum circuits.
  arXiv  Detail & Related papers  (2024-08-19T01:58:54Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Does Quantum Mechanics Breed Larger, More Intricate Quantum Theories? The Case for Experience-Centric Quantum Theory and the Interactome of Quantum Theories [0.0]
  We show that the recently proposed experience-centric quantum theory (ECQT) is a larger and richer theory of quantum behaviors. ECQT allows the quantum information of the closed quantum system's developed state history to continually contribute to defining manybody interactions. The interplay of unitarity and non-Markovianity in ECQT brings about a host of diverse behavioral phases.
  arXiv  Detail & Related papers  (2023-08-04T16:33:24Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• 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)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• 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)
• An introductory review on resource theories of generalized nonclassical light [0.0]
  Quantum resource theory is perhaps the most revolutionary framework that quantum physics has ever experienced. Generalized quantum optical framework strives to bring in several prosperous contemporary ideas.
  arXiv  Detail & Related papers  (2021-03-23T05:10:44Z)
• Probing the limits of quantum theory with quantum information at subnuclear scales [0.13844779265721088]
  We propose a new theoretical framework of Q-data tests. It recognises the established validity of quantum theory, but allows for more general -- 'post-quantum' -- scenarios in certain physical regimes.
  arXiv  Detail & Related papers  (2021-03-22T16:47:39Z)

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.