Computational Entanglement Theory

• URL: http://arxiv.org/abs/2310.02783v1
• Date: Wed, 4 Oct 2023 12:53:04 GMT
• Title: Computational Entanglement Theory
• Authors: Rotem Arnon-Friedman, Zvika Brakerski and Thomas Vidick
• Abstract summary: computational entanglement theory is inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We show that the computational measures are fundamentally different from their information-theoretic counterparts by presenting gaps between them. We discuss the relations between computational entanglement theory and other topics, such as quantum cryptography and notions of pseudoentropy.
• Score: 11.694169299062597
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We define new operational computational measures of entanglement -- the computational one-shot entanglement cost and distillable entanglement. We then show that the computational measures are fundamentally different from their information-theoretic counterparts by presenting gaps between them. We proceed by refining and extending the definition of pseudo-entanglement, introduced by Aaronson et al., 2022, using the new operational measures; and we present constructions of pseudo-entangled states (for our new definition) based on post-quantum cryptographic assumptions. Finally, we discuss the relations between computational entanglement theory and other topics, such as quantum cryptography and notions of pseudoentropy, as well as the relevance of our new definitions to the study of the AdS/CFT correspondence. We believe that, in addition to the contributions presented in the current manuscript, our work opens multiple research directions, of relevance both to the theoretical quantum information theory community as well as for future applications of quantum networks and cryptography.

Related papers

• 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)
• Theory and Implementation of the Quantum Approximate Optimization Algorithm: A Comprehensible Introduction and Case Study Using Qiskit and IBM Quantum Computers [0.0]
  We lay our focus on practical aspects and step-by-step guide through the realization of a proof of concept quantum application. In every step we first explain the underlying theory and subsequently provide the implementation using IBM's Qiskit. As another central aspect of this tutorial we provide extensive experiments on the 27 qubits state-of-the-art quantum computer ibmq_ehningen.
  arXiv  Detail & Related papers  (2023-01-23T16:38:06Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Computation in a general physical setting [0.0]
  This paper reviews and extends some results on the computational ability of quantum theory. It provides a refined version of the conjecture that a quantum computer can simulate the computation in any theory. It ends by describing an important relation between this conjecture and delegated computation, similar to the relation between quantum non-locality and device-independent cryptography.
  arXiv  Detail & Related papers  (2021-08-25T20:00:20Z)
• Quantum Entropic Causal Inference [30.939150842529052]
  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.
  arXiv  Detail & Related papers  (2021-02-23T15:51:34Z)
• Quantum field-theoretic machine learning [0.0]
  We recast the $phi4$ scalar field theory as a machine learning algorithm within the mathematically rigorous framework of Markov random fields. Neural networks are additionally derived from the $phi4$ theory which can be viewed as generalizations of conventional neural networks.
  arXiv  Detail & Related papers  (2021-02-18T16:12:51Z)
• Holographic tensor network models and quantum error correction: A topical review [78.28647825246472]
  Recent progress in studies of holographic dualities has led to a confluence with concepts and techniques from quantum information theory. A particularly successful approach has involved capturing holographic properties by means of tensor networks.
  arXiv  Detail & Related papers  (2021-02-04T14:09:21Z)
• Quantum simulation of gauge theory via orbifold lattice [47.28069960496992]
  We propose a new framework for simulating $textU(k)$ Yang-Mills theory on a universal quantum computer. We discuss the application of our constructions to computing static properties and real-time dynamics of Yang-Mills theories.
  arXiv  Detail & Related papers  (2020-11-12T18:49:11Z)
• Direct estimation of quantum coherence by collective measurements [54.97898890263183]
  We introduce a collective measurement scheme for estimating the amount of coherence in quantum states. Our scheme outperforms other estimation methods based on tomography or adaptive measurements. We show that our method is accessible with today's technology by implementing it experimentally with photons.
  arXiv  Detail & Related papers  (2020-01-06T03:50:42Z)
• Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum Computer Using Inherent Qubit Decoherence [53.20999552522241]
  We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems. We present three methods for implementing the thermal relaxation. We find excellent agreement between our results, experimental data, and the theoretical prediction.
  arXiv  Detail & Related papers  (2020-01-03T11:48:11Z)

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.