Sequential measurements, TQFTs, and TQNNs

• URL: http://arxiv.org/abs/2205.13184v1
• Date: Thu, 26 May 2022 06:37:57 GMT
• Title: Sequential measurements, TQFTs, and TQNNs
• Authors: Chris Fields, James F. Glazebrook and Antonino Marciano
• Abstract summary: We introduce novel methods for implementing generic quantum information within a scale-free architecture. We show how observational outcomes are taken to be finite bit strings induced by measurement operators derived from a holographic screen bounding the system. We extend the analysis so develop topological quantum neural networks (TQNNs), which enable machine learning with functorial evolution of quantum neural 2-complex quiveres.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce novel methods for implementing generic quantum information within a scale-free architecture. For a given observable system, we show how observational outcomes are taken to be finite bit strings induced by measurement operators derived from a holographic screen bounding the system. In this framework, measurements of identified systems with respect to defined reference frames are represented by semantically-regulated information flows through distributed systems of finite sets of binary-valued Barwise-Seligman classifiers. Specifically, we construct a functor from the category of cone-cocone diagrams (CCCDs) over finite sets of classifiers, to the category of finite cobordisms of Hilbert spaces. We show that finite CCCDs provide a generic representation of finite quantum reference frames (QRFs). Hence the constructed functor shows how sequential finite measurements can induce TQFTs. The only requirement is that each measurement in a sequence, by itself, satisfies Bayesian coherence, hence that the probabilities it assigns satisfy the Kolmogorov axioms. We extend the analysis so develop topological quantum neural networks (TQNNs), which enable machine learning with functorial evolution of quantum neural 2-complexes (TQN2Cs) governed by TQFTs amplitudes, and resort to the Atiyah-Singer theorems in order to classify topological data processed by TQN2Cs. We then comment about the quiver representation of CCCDs and generalized spin-networks, a basis of the Hilbert spaces of both TQNNs and TQFTs. We finally review potential implementations of this framework in solid state physics and suggest applications to quantum simulation and biological information processing.

Related papers

• Quantum Conditional Entropies [7.988085110283119]
  We introduce a comprehensive family of conditional entropies that reveals a unified structure underlying all previously studied forms of quantum conditional R'enyi entropies. This new family satisfies a range of desiderata, including data processing inequalities, additivity under tensor products, duality relations, chain rules, concavity or convexity, and various parameter monotonicity relations. We expect this family of entropies, along with our generalized chain rules, to find applications in quantum cryptography and information theory.
  arXiv  Detail & Related papers  (2024-10-29T12:03:10Z)
• 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)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Bayesian RG Flow in Neural Network Field Theories [41.94295877935867]
  The Neural Network Field Theory correspondence (NNFT) is a mapping from neural network (NN) architectures into the space of statistical field theories (SFTs) We coin BRG-NNFT to form a powerful new framework for exploring the space of NNs and SFTs.
  arXiv  Detail & Related papers  (2024-05-27T18:00:00Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• The Stochastic-Quantum Theorem [0.0]
  This paper states and proves a new theorem that establishes a precise correspondence between any generalized system and a unitarily evolving quantum system. The theorem also provides a first-principles explanation for why quantum systems are based on the complex numbers, Hilbert spaces, linear-unitary time evolution, and the Born rule.
  arXiv  Detail & Related papers  (2023-09-03T15:28:07Z)
• Novel Architecture of Parameterized Quantum Circuit for Graph Convolutional Network [4.955918131723842]
  In the machine learning field, the classical graph convolutional layer (GCL)-based graph convolutional network (GCN) can well handle topological data. We design a novel PQC architecture to realize a quantum GCN (QGCN)
  arXiv  Detail & Related papers  (2022-03-07T10:18:13Z)
• Model Checking for Verification of Quantum Circuits [1.1878820609988696]
  We will describe a framework for assertion-based verification of quantum circuits. Quantum assertions are specified by a temporal extension of Birkhoff-von Neumann quantum logic. Algorithms for reachability analysis and model checking of quantum circuits are developed based on contraction of tensor networks.
  arXiv  Detail & Related papers  (2021-04-23T00:43:37Z)
• Quantum Hypothesis Testing with Group Structure [0.0]
  Recently-developed techniques of quantum signal processing can be modified to constitute subroutines for quantum hypothesis testing. Performance is completely defined by explicit group homomorphisms. Extensions to larger groups and noisy settings are discussed.
  arXiv  Detail & Related papers  (2021-02-03T18:46:51Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.