Quantum circuit representation of Bayesian networks

• URL: http://arxiv.org/abs/2004.14803v2
• Date: Mon, 12 Apr 2021 15:38:03 GMT
• Title: Quantum circuit representation of Bayesian networks
• Authors: Sima E. Borujeni, Saideep Nannapaneni, Nam H. Nguyen, Elizabeth C. Behrman, James E. Steck
• Abstract summary: We develop a quantum circuit to represent a generic discrete Bayesian network with nodes that may have two or more states. The proposed approach is demonstrated for three examples: a 4-node oil company stock prediction, a 10-node network for liquidity risk assessment, and a 9-node naive Bayes classifier for bankruptcy prediction.
• Score: 5.057312718525522
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become computationally expensive in large-scale systems. While demonstrations of true quantum supremacy remain rare, quantum computing applications managing to exploit the advantages of amplitude amplification have shown significant computational benefits when compared against their classical counterparts. We develop a systematic method for designing a quantum circuit to represent a generic discrete Bayesian network with nodes that may have two or more states, where nodes with more than two states are mapped to multiple qubits. The marginal probabilities associated with root nodes (nodes without any parent nodes) are represented using rotation gates, and the conditional probability tables associated with non-root nodes are represented using controlled rotation gates. The controlled rotation gates with more than one control qubit are represented using ancilla qubits. The proposed approach is demonstrated for three examples: a 4-node oil company stock prediction, a 10-node network for liquidity risk assessment, and a 9-node naive Bayes classifier for bankruptcy prediction. The circuits were designed and simulated using Qiskit, a quantum computing platform that enables simulations and also has the capability to run on real quantum hardware. The results were validated against those obtained from classical Bayesian network implementations.

Related papers

• Challenges and opportunities in the supervised learning of quantum circuit outputs [0.0]
  Deep neural networks have proven capable of predicting some output properties of relevant random quantum circuits. We investigate if and to what extent neural networks can learn to predict the output expectation values of circuits often employed in variational quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-07T16:10:13Z)
• Success probabilities in time-reversal based hybrid quantum state transfer [0.0]
  We consider two memory nodes of a quantum network connected by flying qubits. We show how and why the probability of interfacing successfully is determined by the overlap of the spectral shape of the actual flying qubit and the ideal shape.
  arXiv  Detail & Related papers  (2024-01-16T04:38:10Z)
• Entanglement topography of large-scale quantum networks [0.0]
  Large-scale quantum networks, necessary for distributed quantum information processing, are posited to have quantum entangled systems between distant network nodes. We uncover the parametric entanglement topography and introduce the notion of typical and maximal viable regions for entanglement-enabled tasks in a general model of large-scale quantum networks. We show that such a topographical analysis, in terms of viability regions, reveals important functional information about quantum networks, provides experimental targets for the edge parameters and can guide efficient quantum network design.
  arXiv  Detail & Related papers  (2023-12-26T11:34:58Z)
• Quantum amplitude estimation with error mitigation for time-evolving probabilistic networks [0.0]
  We consider networks of nodes, where each node can be in one of two states: good or failed. Our method can evaluate arbitrary network topologies for any number of time steps. We present the results of a low-depth quantum amplitude estimation on a simulator with a realistic noise model.
  arXiv  Detail & Related papers  (2023-03-29T10:45:11Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Robust Training and Verification of Implicit Neural Networks: A Non-Euclidean Contractive Approach [64.23331120621118]
  This paper proposes a theoretical and computational framework for training and robustness verification of implicit neural networks. We introduce a related embedded network and show that the embedded network can be used to provide an $ell_infty$-norm box over-approximation of the reachable sets of the original network. We apply our algorithms to train implicit neural networks on the MNIST dataset and compare the robustness of our models with the models trained via existing approaches in the literature.
  arXiv  Detail & Related papers  (2022-08-08T03:13:24Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Realising and compressing quantum circuits with quantum reservoir computing [2.834895018689047]
  We show how a random network of quantum nodes can be used as a robust hardware for quantum computing. Our network architecture induces quantum operations by optimising only a single layer of quantum nodes. In the few-qubit regime, sequences of multiple quantum gates in quantum circuits can be compressed with a single operation.
  arXiv  Detail & Related papers  (2020-03-21T03:29:16Z)

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.