Putting paradoxes to work: contextuality in measurement-based quantum computation

• URL: http://arxiv.org/abs/2208.06624v1
• Date: Sat, 13 Aug 2022 11:04:03 GMT
• Title: Putting paradoxes to work: contextuality in measurement-based quantum computation
• Authors: Robert Raussendorf
• Abstract summary: We describe a joint cohomological framework for measurement-based quantum computation (MBQC) and the corresponding contextuality proofs. The central object in this framework is an element in the second cohomology group of the chain complex describing a given MBQC.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We describe a joint cohomological framework for measurement-based quantum computation (MBQC) and the corresponding contextuality proofs. The central object in this framework is an element in the second cohomology group of the chain complex describing a given MBQC. It contains the function computed, up to gauge equivalence, and at the same time is a contextuality witness. The present cohomological description only applies to temporally flat MBQCs, and we outline an approach for extending it to the temporally ordered case.

Related papers

• Quantum computing and persistence in topological data analysis [41.16650228588075]
  Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We show that a computational problem closely related to a core task in TDA is $mathsfBQP_1$-hard and contained in $mathsfBQP$. Our approach relies on encoding the persistence of a hole in a variant of the guided sparse Hamiltonian problem, where the guiding state is constructed from a harmonic representative of the hole.
  arXiv  Detail & Related papers  (2024-10-28T17:54:43Z)
• Measurement-based quantum computation in symmetry protected topological states of one-dimensional integer spin systems [2.231201892342328]
  In addition to half-odd-integer spins, the integer spin chains can also be incorporated in the framework. The computational order parameter characterizing the efficiency of MBQC is identified, which, for spin-$1$ chains in the Haldane phase, coincides with the conventional string order parameter in condensed matter physics.
  arXiv  Detail & Related papers  (2024-09-24T14:12:54Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Edge modes, extended TQFT, and measurement based quantum computation [2.741486053013819]
  In citeWong:2022mnv, it was explained that measurement based quantum computation in one dimension can be understood in term of a gauge theory. In this work, we give an alternative formulation of this "entanglement gauge theory" as an extended topological field theory.
  arXiv  Detail & Related papers  (2023-12-01T14:11:31Z)
• Equivariant simplicial distributions and quantum contextuality [0.0]
  We introduce an equivariant version of contextuality with respect to a symmetry group, which comes with natural applications to quantum theory. In the equivariant setting, we construct cohomology classes that can detect contextuality.
  arXiv  Detail & Related papers  (2023-10-27T13:25:46Z)
• Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective [39.58317527488534]
  We develop a framework to characterize the separability of a specific type of one-dimensional quasiparticle known as a fermionic anyon. We map this notion of fermionic-anyon separability to the free resources of matchgate circuits. We also identify how entanglement between two qubits encoded in a dual-rail manner, as standard for matchgate circuits, corresponds to the notion of entanglement between fermionic anyons.
  arXiv  Detail & Related papers  (2023-06-01T15:25:19Z)
• Sequential measurements, TQFTs, and TQNNs [0.0]
  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.
  arXiv  Detail & Related papers  (2022-05-26T06:37:57Z)
• Quantum state inference from coarse-grained descriptions: analysis and an application to quantum thermodynamics [101.18253437732933]
  We compare the Maximum Entropy Principle method, with the recently proposed Average Assignment Map method. Despite the fact that the assigned descriptions respect the measured constraints, the descriptions differ in scenarios that go beyond the traditional system-environment structure.
  arXiv  Detail & Related papers  (2022-05-16T19:42:24Z)
• From geometry to coherent dissipative dynamics in quantum mechanics [68.8204255655161]
  We work out the case of finite-level systems, for which it is shown by means of the corresponding contact master equation. We describe quantum decays in a 2-level system as coherent and continuous processes.
  arXiv  Detail & Related papers  (2021-07-29T18:27:38Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Cohomology and the Algebraic Structure of Contextuality in Measurement Based Quantum Computation [0.0]
  Roberts, Bartlett and Raussendorf recently introduced a new cohomological approach to contextuality in quantum computation. We give an abstract description of their obstruction and the algebraic structure it exploits, using the sheaf theoretic framework of Abramsky and Brandenburger. At this level of generality we contrast their approach to the Cech cohomology obstruction of Abramsky, Mansfield and Barbosa and give a direct proof that Cech cohomology is at least as powerful.
  arXiv  Detail & Related papers  (2020-05-01T04:15: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.