English
Related papers

Related papers: On the structure of higher order quantum maps

200 papers

Higher order group cohomology is defined and first properties are given. Using modular symbols, an Eichler-Shimura homomorphism is constructed mapping spaces of higher order cusp forms to higher order cohomology groups.

Number Theory · Mathematics 2014-09-04 Anton Deitmar

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

We observe that the existence of sequential and parallel composition supermaps in higher order theories of transformations can be formalised using enriched category theory. Encouraged by relevant examples such as unitary supermaps and…

Quantum Physics · Physics 2025-12-02 Matt Wilson , Giulio Chiribella

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

This is the third revision. We study bases of Pfaffian systems for $A$-hypergeometric system. Gr\"obner deformations give bases. These bases also give those for twisted cohomology groups. For hypergeometric system associated to a class of…

Classical Analysis and ODEs · Mathematics 2014-06-19 Takayuki Hibi , Kenta Nishiyama , Nobuki Takayama

Affine type systems are substructural type systems where copying of information is restricted, but discarding of information is permissible at all types. Such type systems are well-suited for describing quantum programming languages,…

Logic in Computer Science · Computer Science 2021-03-19 Vladimir Zamdzhiev

Encoding classical data into quantum states is considered a quantum feature map to map classical data into a quantum Hilbert space. This feature map provides opportunities to incorporate quantum advantages into machine learning algorithms…

Quantum Physics · Physics 2021-08-31 Takahiro Goto , Quoc Hoan Tran , Kohei Nakajima

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

Combinatorics · Mathematics 2018-12-27 Benjamin Braun , Wesley K. Hough

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

Classical Analysis and ODEs · Mathematics 2020-07-20 Mario Santilli

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

Combinatorics · Mathematics 2021-03-01 Ivan Chajda , Helmut Länger

Motivated by the need to uncover some underlying mathematical structure of optimal quantum computation, we carry out a systematic analysis of a wide variety of quantum algorithms from the majorization theory point of view. We conclude that…

Quantum Physics · Physics 2009-11-07 Roman Orus , Jose I. Latorre , Miguel A. Martin-Delgado

Attempts to separate the power of classical and quantum models of computation have a long history. The ultimate goal is to find exponential separations for computational problems. However, such separations do not come a dime a dozen: while…

Quantum Physics · Physics 2013-12-05 Martin Roetteler

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We introduce a characterization of topological order based on bulk oscillations of the entanglement entropy and the definition of an `entanglement gap', showing that it is generally applicable to pure and disordered quantum systems. Using…

Strongly Correlated Electrons · Physics 2020-07-01 Chunyu Tan , Hubert Saleur , Stephan Haas

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

Combinatorics · Mathematics 2012-03-13 Balazs Szegedy

Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…

Algebraic Geometry · Mathematics 2014-01-21 Jens Forsgård , Petter Johansson

We use the crystal isomorphisms of the Fock space to describe two maps on partitions and multipartitions which naturally appear in the crystal basis theory for quantum groups in affine type A and in the representation theory of Hecke…

Combinatorics · Mathematics 2021-02-24 N Jacon

We study the partially ordered set of equivalence classes of quantum measurements endowed with the post-processing partial order. The post-processing order is fundamental as it enables to compare measurements by their intrinsic noise and it…

Quantum Physics · Physics 2022-11-14 Teiko Heinosaari , Maria Anastasia Jivulescu , Ion Nechita

The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…

Category Theory · Mathematics 2022-08-25 Laurent Poinsot , Hans-E Porst