On the structure of higher order quantum maps

• URL: http://arxiv.org/abs/2411.09256v1
• Date: Thu, 14 Nov 2024 07:45:20 GMT
• Title: On the structure of higher order quantum maps
• Authors: Anna Jenčová,
• Abstract summary: We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. Type functions can be identified with certain Boolean functions that we call type functions. On the level of higher order maps, maxima and minima correspond to affine mixtures and intersections.
• Score: 0.0
• License:
• Abstract: We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this identification, the algebraic structure of Boolean functions is inherited by some sets of quantum objects including higher order maps. Using the M\"obius transform, we assign to each type function a poset whose elements are labelled by subsets of indices of the involved spaces. We then show that the type function corresponds to a comb type if and only if the poset is a chain. We also devise a procedure for decomposition of the poset to a set of basic chains from which the type function is constructed by taking maxima and minima of concatenations of the basic chains in different orders. On the level of higher order maps, maxima and minima correspond to affine mixtures and intersections, respectively.

Related papers

• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• Learning Implicit Feature Alignment Function for Semantic Segmentation [51.36809814890326]
  Implicit Feature Alignment function (IFA) is inspired by the rapidly expanding topic of implicit neural representations. We show that IFA implicitly aligns the feature maps at different levels and is capable of producing segmentation maps in arbitrary resolutions. Our method can be combined with improvement on various architectures, and it achieves state-of-the-art accuracy trade-off on common benchmarks.
  arXiv  Detail & Related papers  (2022-06-17T09:40:14Z)
• Order preserving maps on quantum measurements [1.2891210250935143]
  We study the equivalence classes of quantum measurements endowed with the post-processing partial order. We map this set into a simpler partially ordered set using an order preserving map and investigating the resulting image.
  arXiv  Detail & Related papers  (2022-02-01T19:50:47Z)
• Complex Functional Maps : a Conformal Link Between Tangent Bundles [0.0]
  We introduce complex functional maps, which extend the functional map framework to conformal maps between tangent vector fields on surfaces. A key property of these maps is their orientation awareness. We show that functional maps and their complex counterparts can be estimated jointly to promote orientation preservation.
  arXiv  Detail & Related papers  (2021-12-17T14:54:01Z)
• Superposition with Lambdas [59.87497175616048]
  We design a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $betaeta$-equivalence classes of $lambda$-terms and rely on higher-order unification to achieve refutational completeness.
  arXiv  Detail & Related papers  (2021-01-31T13:53:17Z)
• Weighted slice rank and a minimax correspondence to Strassen's spectra [5.348876409230947]
  Strassen's spectra program characterizes optimal matrix algorithms through monotone functionals. Weighted slice rank encapsulates different notions of bipartiteness of quantum entanglement. New characterization can be extended to all fields.
  arXiv  Detail & Related papers  (2020-12-28T18:49:23Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• Infinite Feature Selection: A Graph-based Feature Filtering Approach [78.63188057505012]
  We propose a filtering feature selection framework that considers subsets of features as paths in a graph. Going to infinite allows to constrain the computational complexity of the selection process. We show that Inf-FS behaves better in almost any situation, that is, when the number of features to keep are fixed a priori.
  arXiv  Detail & Related papers  (2020-06-15T07:20:40Z)
• Equivariant Maps for Hierarchical Structures [17.931059591895984]
  We show that symmetry of a hierarchical structure is the "wreath product" of symmetries of the building blocks. By voxelizing the point cloud, we impose a hierarchy of translation and permutation symmetries on the data. We report state-of-the-art on Semantic3D, S3DIS, and vKITTI, that include some of the largest real-world point-cloud benchmarks.
  arXiv  Detail & Related papers  (2020-06-05T18:42:12Z)

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.