English
Related papers

Related papers: The quantum k-Bruhat order

200 papers

Various constructions for quantum groups have been generalized to $\imath$-quantum groups. Such generalization is called $\imath$-program. In this paper, we fill one of parts in the $\imath$-program. Namely, we provide an equivariant…

Representation Theory · Mathematics 2019-11-05 Zhaobing Fan , Haitao Ma , Husileng Xiao

Let $B$ be the group of invertible upper-triangular complex $n\times n$ matrices, $\mathfrak{u}$ the space of upper-triangular complex matrices with zeroes on the diagonal and $\mathfrak{u}^*$ its dual space. The group $B$ acts on…

Representation Theory · Mathematics 2013-10-15 Mikhail V. Ignatyev

Bj\"orner-Ekedahl prove that general intervals $[e,w]$ in Bruhat order are "top-heavy", with at least as many elements in the $i$-th corank as the $i$-th rank. Well-known results of Carrell and of Lakshmibai-Sandhya give the equality case:…

Combinatorics · Mathematics 2020-12-15 Christian Gaetz , Yibo Gao

To observe Majorana bound states, and especially to use them as a qubit, requires careful optimization of competing quality metrics. We systematically compare Majorana quality in proximitized semiconductor nanowires and quantum dot chains.…

Our objective is to demonstrate an inconsistency with both the original and modern Everettian Many Worlds Interpretations. We do this by examining two important corollaries of the universally valid quantum mechanics in the context of the…

Quantum Physics · Physics 2012-02-15 J. Jeknic-Dugic , M. Dugic , A. Francom

For one qubit systems, we present a short, elementary argument characterizing unital quantum operators in terms of their action on Bloch vectors. We then show how our approach generalizes to multi-qubit systems, obtaining inequalities that…

Quantum Physics · Physics 2009-11-10 P. S. Bourdon , H. T. Williams

We give a quantum approximation scheme (i.e., $(1 + \varepsilon)$-approximation for every $\varepsilon > 0$) for the classical $k$-means clustering problem in the QRAM model with a running time that has only polylogarithmic dependence on…

Quantum Physics · Physics 2025-05-27 Ragesh Jaiswal

To any saturated chain in the affine Weyl group whose translation parts are sufficiently regular, we associate a near path and a far path in the quantum Bruhat graph. Using this, working in the Bruhat order on the minimal-length…

Combinatorics · Mathematics 2021-07-27 Michael Lugo , Mark Shimozono

The Murnaghan--Nakayama rule is a combinatorial rule for the character values of symmetric groups. We give a new combinatorial proof by explicitly finding the trace of the representing matrices in the standard basis of Specht modules. This…

Representation Theory · Mathematics 2019-05-06 Jasdeep Kochhar , Mark Wildon

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…

Combinatorics · Mathematics 2016-11-08 Carolina Benedetti , Nantel Bergeron

In a recent paper Bernevig, Brodie, Susskind and Toumbas constructed a brane realization of the Quantum Hall fluid. Since then it has been realized that the Quantum Hall system is very closely related to non--commutative Chern Simons theory…

High Energy Physics - Theory · Physics 2007-05-23 Simeon Hellerman , Leonard Susskind

The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…

Quantum Algebra · Mathematics 2020-08-05 Naihuan Jing , Jian Zhang

Contextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, $\hbar$, can also be used to…

Quantum Physics · Physics 2018-08-01 Lucas Kocia , Peter Love

Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…

Quantum Physics · Physics 2013-11-15 Chen-Fu Chiang

A celebrated theorem of Baranyai states that when $k$ divides $n$, the family $K_n^k$ of all $k$-subsets of an $n$-element set can be partitioned into perfect matchings. In other words, $K_n^k$ is $1$-factorable. In this paper, we determine…

Combinatorics · Mathematics 2022-07-04 Jinye He , Hao Huang , Jie Ma

The superfield formulation of two - dimensional $N=4$ Extended Supersymmetric Quantum Mechanics (SQM) is described. It is shown that corresponding classical Lagrangian describes the motion in the conformally flat metric with additional…

High Energy Physics - Theory · Physics 2009-10-28 V. Berezovoj , A. Pashnev

Let $M_q(n)$ be the standard quantized matrix algebra, introduced by Faddeev, Reshetikhin, and Takhtajan. It is shown, by constructing an appropriate monomial ordering $\prec$ on its PBW $K$-basis ${\cal B}$ , that $M_q(n)$ is a solvable…

Rings and Algebras · Mathematics 2022-02-24 Rabigul Tuniyaz

Let ${\mathbf U}^-_q$ be the negative half of the quantum group associated to a Kac-Moody algebra ${\mathfrak g}$, and $\underline{\mathbf U}^-_q$ the quantum group obtained by a folding of ${\mathfrak g}$. Let ${\mathbf A} = {\mathbf…

Quantum Algebra · Mathematics 2022-10-20 Ying Ma , Toshiaki Shoji , Zhiping Zhou

We answer two questions regarding the sum-of-squares for the SYK model left open in Ref. 1, both of which are related to graphs. First (a "limitation"), we show that a fragment of the sum-of-squares, in which one considers commutation…

Quantum Physics · Physics 2024-03-05 M. B. Hastings

In the $k$-junta testing problem, a tester has to efficiently decide whether a given function $f:\{0,1\}^n\rightarrow \{0,1\}$ is a $k$-junta (i.e., depends on at most $k$ of its input bits) or is $\epsilon$-far from any $k$-junta. Our main…

Computational Complexity · Computer Science 2015-07-15 Andris Ambainis , Aleksandrs Belovs , Oded Regev , Ronald de Wolf
‹ Prev 1 8 9 10 Next ›