Transferable Belief Model on Quantum Circuits

• URL: http://arxiv.org/abs/2410.08949v2
• Date: Thu, 17 Oct 2024 11:52:24 GMT
• Title: Transferable Belief Model on Quantum Circuits
• Authors: Qianli Zhou, Hao Luo, Lipeng Pan, Yong Deng, Eloi Bosse,
• Abstract summary: The transferable belief model is a semantic interpretation of Dempster-Shafer theory. This paper introduces a new perspective on basic information representation for quantum AI models.
• Score: 18.733294090807995
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The transferable belief model, as a semantic interpretation of Dempster-Shafer theory, enables agents to perform reasoning and decision making in imprecise and incomplete environments. The model offers distinct semantics for handling unreliable testimonies, allowing for a more reasonable and general process of belief transfer compared to the Bayesian approach. However, because both the belief masses and the structure of focal sets must be considered when updating belief functions-leading to extra computational complexity during reasoning-the transferable belief model has gradually lost favor among researchers in recent developments. In this paper, we implement the transferable belief model on quantum circuits and demonstrate that belief functions offer a more concise and effective alternative to Bayesian approaches within the quantum computing framework. Furthermore, leveraging the unique characteristics of quantum computing, we propose several novel belief transfer approaches. More broadly, this paper introduces a new perspective on basic information representation for quantum AI models, suggesting that belief functions are more suitable than Bayesian approach for handling uncertainty on quantum circuits.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Structure-Fair Quantum Circuit Complexity: An Auditable Information-Theoretic Lower Bound [0.2606834301724095]
  This paper introduces the Reference-Contingent Complexity (RCC), an information-theoretic measure calibrated by the available quantum operations.<n>Our central result is a key theorem that rigorously proves the RCC serves as a lower bound for the complexity of any universal quantum circuit.<n>This work provides a "ruler" for quantum technology that is structure-fair and enables cross-platform comparison.
  arXiv  Detail & Related papers  (2025-09-20T14:58:34Z)
• Anticipating Decoherence: a Predictive Framework for Enhancing Coherence in Quantum Emitters [96.41185946460115]
  We develop an anticipatory framework for forecasting and decoherence engineering in remote quantum emitters.<n>We show that a machine learning model trained on limited data can accurately forecast unseen spectral behavior.<n>These results pave the way for real-time decoherence engineering in scalable quantum systems.
  arXiv  Detail & Related papers  (2025-08-04T17:23:14Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• A Survey of Quantum Transformers: Architectures, Challenges and Outlooks [82.4736481748099]
  Quantum Transformers integrate the representational power of classical Transformers with the computational advantages of quantum computing.<n>Since 2022, research in this area has rapidly expanded, giving rise to diverse technical paradigms and early applications.<n>This paper presents the first comprehensive, systematic, and in-depth survey of quantum Transformer models.
  arXiv  Detail & Related papers  (2025-04-04T05:40:18Z)
• Realizing Quantum Adversarial Defense on a Trapped-ion Quantum Processor [3.1858340237924776]
  We implement a data re-uploading-based quantum classifier on an ion-trap quantum processor.<n>We demonstrate its superior robustness on the MNIST dataset.
  arXiv  Detail & Related papers  (2025-03-04T09:22:59Z)
• Quantum Data Encoding and Variational Algorithms: A Framework for Hybrid Quantum Classical Machine Learning [0.0]
  Quantum Machine Learning (QML) integrates the calculational framework of quantum mechanics with the adaptive properties of classical machine learning.<n>This article suggests a broad architecture that allows the connection between classical data pipelines and quantum algorithms.
  arXiv  Detail & Related papers  (2025-02-17T16:04:04Z)
• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models. This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space. The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the multimode extreme bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.<n>Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Relative-belief inference in quantum information theory [0.0]
  We show that the relative belief procedure chooses Hilbert spaces that are never smaller in dimension than those selected from optimizing a broad class of information criteria. We apply the relative belief procedure to an important application: state reconstruction of imperfect quantum sources.
  arXiv  Detail & Related papers  (2024-06-05T14:59:58Z)
• Isopignistic Canonical Decomposition via Belief Evolution Network [12.459136964317942]
  We propose an isopignistic transformation based on the belief evolution network. This decomposition offers a reverse path between the possibility distribution and its isopignistic mass functions. This paper establishes a theoretical basis for building general models of artificial intelligence based on probability theory, Dempster-Shafer theory, and possibility theory.
  arXiv  Detail & Related papers  (2024-05-04T12:39:15Z)
• Quantum Generative Adversarial Networks: Bridging Classical and Quantum Realms [0.6827423171182153]
  We explore the synergistic fusion of classical and quantum computing paradigms within the realm of Generative Adversarial Networks (GANs) Our objective is to seamlessly integrate quantum computational elements into the conventional GAN architecture, thereby unlocking novel pathways for enhanced training processes. This research is positioned at the forefront of quantum-enhanced machine learning, presenting a critical stride towards harnessing the computational power of quantum systems.
  arXiv  Detail & Related papers  (2023-12-15T16:51:36Z)
• Revisiting Nancy Cartwright's Notion of Reliability: Addressing Quantum Devices' Noise [0.0]
  This addendum seeks to enrich the discussion by highlighting the challenges and implications of assessing quantum device reliability. I show that when applied to the realm of quantum devices, such as Google's Sycamore quantum processor, these well-established notions demand careful adaptation and consideration.
  arXiv  Detail & Related papers  (2023-08-09T11:24:58Z)
• 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)
• Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
  We propose a framework for efficient and effective counterfactual inference implemented with neural networks. The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data. Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
  arXiv  Detail & Related papers  (2023-06-09T08:30:51Z)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Quantum realism: axiomatization and quantification [77.34726150561087]
  We build an axiomatization for quantum realism -- a notion of realism compatible with quantum theory. We explicitly construct some classes of entropic quantifiers that are shown to satisfy almost all of the proposed axioms.
  arXiv  Detail & Related papers  (2021-10-10T18:08:42Z)
• 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)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Dynamic framework for criticality-enhanced quantum sensing [1.819932604590499]
  Quantum criticality, as a fascinating quantum phenomenon, may provide significant advantages for quantum sensing. We propose a framework for quantum sensing with a family of Hamiltonians that undergo quantum phase transitions. It is expected to provide a route towards the implementation of criticality-enhanced quantum sensing.
  arXiv  Detail & Related papers  (2020-08-26T05:36:46Z)

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.