English
Related papers

Related papers: Noncrossing normal ordering for functions of boson…

200 papers

A full treatment for the scattering of an arbitrary number of bosons through a Bell multiport beam splitter is presented that includes all possible output arrangements. Due to exchange symmetry, the event statistics differs dramatically…

Quantum Physics · Physics 2012-04-18 Malte C. Tichy , Markus Tiersch , Fernando de Melo , Florian Mintert , Andreas Buchleitner

Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and colored Motzkin paths. A (3,2)-Motzkin path can be viewed as a colored…

Combinatorics · Mathematics 2010-09-02 William Y. C. Chen , Carol J. Wang

Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes…

Quantum Physics · Physics 2024-02-07 Luca Apadula , Alessandro Bisio , Paolo Perinotti

We review here the quantum mechanics of some noncommutative theories in which no state saturates simultaneously all the non trivial Heisenberg uncertainty relations. We show how the difference of structure between the Poisson brackets and…

High Energy Physics - Theory · Physics 2009-11-10 Musongela Lubo

A generalized quantum distribution function is introduced. The corresponding ordering rule for non-commuting operators is given in terms of a single parameter. The origin of this parameter is in the extended canonical transformations that…

Quantum Physics · Physics 2007-05-23 S. Nasiri , S. Khademi , S. Bahrami , F. Taati

In this paper we develop the generalised Schur theory offered in the recent paper by the second author in dimension one case, and apply it to obtain a new explicit parametrisation of torsion free rank one sheaves on projective irreducible…

Algebraic Geometry · Mathematics 2025-11-06 J. Guo , A. B. Zheglov

Detecting nonclassical properties that do not allow classical interpretation of photoelectric counting events is one of the crucial themes in quantum optics. Observation of individual nonclassical effects for a single-mode field, however,…

Quantum Physics · Physics 2015-05-13 Juhui Lee , Jaewan Kim , Hyunchul Nha

We use a noncommutative generalization of Fourier analysis to define a broad class of pseudo-probability representations, which includes the known bosonic and discrete Wigner functions. We characterize the groups of quantum unitary…

Mathematical Physics · Physics 2020-05-19 Sang Jun Park , Cedric Beny , Hun Hee Lee

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

We develop an extension of the process matrix (PM) framework for correlations between quantum operations with no causal order that allows multiple rounds of information exchange for each party compatibly with the assumption of well-defined…

Quantum Physics · Physics 2021-01-27 Timothée Hoffreumon , Ognyan Oreshkov

We construct the most general form of our previously proposed nonlinear extension of quantum mechanics that possesses three basic properties. Unlike the simpler model, the new version is not completely integrable, but it has an underlying…

Quantum Physics · Physics 2025-11-05 Alan Chodos , Fred Cooper

Non-commutativity is ubiquitous in mathematical modeling of reality and in many cases same algebraic structures are implemented in different situations. Here we consider the canonical commutation relation of quantum theory and discuss a…

Quantum Physics · Physics 2010-12-30 Pawel Blasiak

The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent…

Combinatorics · Mathematics 2011-11-14 Ricardo Mamede

Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with nonnegative entries. Based on this point of…

Quantum Physics · Physics 2007-05-23 Leonid Gurvits

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

Category Theory · Mathematics 2020-07-01 Saugata Basu , M. Umut Isik

We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…

Combinatorics · Mathematics 2014-01-29 Qingchun Ren

The partition function of composite bosons ("cobosons" for short) is calculated in the canonical ensemble, with the Pauli exclusion principle between their fermionic components included in an exact way through the finite temperature…

Statistical Mechanics · Physics 2016-12-13 Shiue-Yuan Shiau , Monique Combescot , Yia-Chung Chang

We give a general expression for the normally ordered form of a function F(w(a,a*)) where w is a function of boson annihilation and creation operators satisfying [a,a*]=1. The expectation value of this expression in a coherent state becomes…

Quantum Physics · Physics 2015-06-26 P. Blasiak , K. A. Penson , A. I. Solomon , A. Horzela , G. E. H. Duchamp

We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given. Furthermore, we…

Combinatorics · Mathematics 2012-03-16 Octavio Arizmendi

In this paper, we present a reduction algorithm which transforms $m$-regular partitions of $[n]=\{1, 2, ..., n\}$ to $(m-1)$-regular partitions of $[n-1]$. We show that this algorithm preserves the noncrossing property. This yields a simple…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Eva Y. P. Deng , Rosena R. X. Du