Computation in a general physical setting

• URL: http://arxiv.org/abs/2108.11454v1
• Date: Wed, 25 Aug 2021 20:00:20 GMT
• Title: Computation in a general physical setting
• Authors: Ciar\'an M. Gilligan-Lee
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical principles and computation. Moreover, comparing and contrasting the computational properties of quantum theory with other operationally-sensible theories could shed light on the strengths and limitations of quantum computation. This paper reviews and extends some of these results, deriving new bounds on the computational ability of theories satisfying n-local tomography, and theories in which states are represented as generalised superpositions. It moreover provides a refined version of the conjecture that a quantum computer can simulate the computation in any theory within a certain sub-class of generalised probabilistic theories with at most polynomial overhead. The paper ends by describing an important relation between this conjecture and delegated computation, similar to the relation between quantum non-locality and device-independent 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)
• Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
  Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators. The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
  arXiv  Detail & Related papers  (2024-07-28T20:02:21Z)
• Lecture Notes on Quantum Electrical Circuits [49.86749884231445]
  Theory of quantum electrical circuits goes under the name of circuit quantum electrodynamics or circuit-QED. The goal of the theory is to provide a quantum description of the most relevant degrees of freedom. These lecture notes aim at giving a pedagogical overview of this subject for theoretically-oriented Master or PhD students in physics and electrical engineering.
  arXiv  Detail & Related papers  (2023-12-08T19:26:34Z)
• Computational Entanglement Theory [11.694169299062597]
  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.
  arXiv  Detail & Related papers  (2023-10-04T12:53:04Z)
• Advantages of quantum mechanics in the estimation theory [0.0]
  In quantum theory, the situation with operators is different due to its non-commutativity nature. We formulate, with complete generality, the quantum estimation theory for Gaussian states in terms of their first and second moments.
  arXiv  Detail & Related papers  (2022-11-13T18:03:27Z)
• 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)
• Quantum Simulation of Conformal Field Theory [77.34726150561087]
  We describe a quantum algorithm to simulate the dynamics of conformal field theories. A full analysis of the approximation errors suggests near-term applicability.
  arXiv  Detail & Related papers  (2021-09-29T06:44:33Z)
• Resource theory of imaginarity: Quantification and state conversion [48.7576911714538]
  Resource theory of imaginarity has been introduced, allowing for a systematic study of complex numbers in quantum mechanics and quantum information theory. We investigate imaginarity quantification, focusing on the geometric imaginarity and the robustness of imaginarity, and apply these tools to the state conversion problem in imaginarity theory. Our study reveals the significance of complex numbers in quantum physics, and proves that imaginarity is a resource in optical experiments.
  arXiv  Detail & Related papers  (2021-03-02T15:30:27Z)
• 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)
• Towards correlation self-testing of quantum theory in the adaptive Clauser-Horne-Shimony-Holt game [1.0878040851638]
  Correlation self-testing of a theory addresses the question of whether we can identify the set of correlations realisable in a theory from its performance in a particular information processing task. This is the first step towards a general solution that could rule out all theories in which the set of realisable correlations does not coincide with the quantum set.
  arXiv  Detail & Related papers  (2020-09-10T18:04:13Z)
• Perfect Discrimination in Approximate Quantum Theory of General Probabilistic Theories [51.7367238070864]
  We define larger measurement classes that are smoothly connected with the class of POVMs via a parameter. We give a sufficient condition of perfect discrimination, which shows a significant improvement beyond the class of POVMs.
  arXiv  Detail & Related papers  (2020-04-10T08:45:20Z)

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.