Search

Fully revealing the mathmatical structure of quantum contextuality is a significant task, while some known contextuality theories are only applicable for rank-1 projectors. That is because they adopt the observable-based definitions. This paper analyses the challenges faced by some known contextuality theories, and establishes an event-based contextuality theory with partial Boolean algebra to overcome them. The theory can handle the scenarios composed of general projectors and observables, and provides a unified mathematical structure to investigate the hierarchy of quantum contextuality. It also introduces a tool to extend some known results from rank-1 cases to general cases. For example, we get a Kochen-Specker set with 12 projectors from the Cabello-Estebaranz-Garcia set with 18 vectors.

Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion \textit{atom graphs} to reveal the graph structure of partial Boolean algebra for quantum systems by proving that (i) the partial Boolean algebras for quantum systems are determined by their atom graphs; (ii) the states on atom graphs can be extended uniquely to the partial Boolean algebras, and (iii) each exclusivity graph is an induced graph of an atom graph. (i) and (ii) show that the quantum systems are uniquely determined by their atom graphs. which proves the reasonability of graphs as the models of quantum experiments. (iii) establishes a connection between partial Boolean algebra and exclusivity graphs, and introduces a method to express the exclusivity experiments more precisely. We also present a general and parametric description for Kochen-Specker theorem based on graphs, which gives a type of non-contextuality inequality for KS contextuality., Comment: 20 pages, 13 figures

The classical belief revision framework, as proposed by Alchourron, Gardenfors, and Makinson, involves the revision of a theory based on eight postulates. In this paper, we focus on the exploration of a revision theory grounded in quantum mechanics, referred to as the natural revision theory. There are two reasoning modes in quantum systems: static intuitionistic reasoning, which incorporates contextuality, and dynamic reasoning, which is achieved through projection measurement. We combine the advantages of two intuitionistic quantum logic frameworks, as proposed by D{\"o}ring and Coecke, respectively. Our goal is to establish a truth-value assignment for intuitionistic quantum logic that not only aligns with the inherent characteristics of quantum mechanics but also supports truth-value reasoning. The natural revision theory is then investigated based on this approach. We introduce two types of revision operators that correspond to the two reasoning modes in quantum systems: static and dynamic revision. Furthermore, we highlight the distinctions between these two operators. Shifting away from classical revision paradigms, we consider the revision of consequence relations in intuitionistic quantum logic. We demonstrate how, within the natural revision theory framework, both revision operators collectively influence the consequence relations. Notably, the outcomes of revision process are impacted by the sequence in which these interweaved operators are deployed.

Distributed Acoustic Sensing (DAS) is promising for traffic monitoring, but its extensive data and sensitivity to vibrations, causing noise, pose computational challenges. To address this, we propose a two-step deep-learning workflow with high efficiency and noise immunity for DAS-based traffic monitoring, focusing on instance vehicle trajectory segmentation and velocity estimation. Our approach begins by generating a diverse synthetic DAS dataset with labeled vehicle signals, tackling the issue of missing training labels in this field. This dataset is used to train a Convolutional Neural Network (CNN) to detect linear vehicle trajectories from the noisy DAS data in the time-space domain. However, due to significant noise, these trajectories are often fragmented and incomplete. To enhance accuracy, we introduce a second step involving the Hough transform. This converts detected linear features into point-like energy clusters in the Hough domain. Another CNN is then employed to focus on these energies, identifying the most significant points. The inverse Hough transform is applied to these points to reconstruct complete, distinct, and noise-free linear vehicle trajectories in the time-space domain. The Hough transform plays a crucial role by enforcing a local linearity constraint on the trajectories, enhancing continuity and noise immunity, and facilitating the separation of individual trajectories and estimation of vehicle velocities (indicated by trajectory slopes in the Hough domain). Our method has shown effectiveness in real-world datasets, proving its value in real-time processing of DAS data and applicability in similar traffic monitoring scenarios. All related codes and data are available at https://github.com/TTMuTian/itm/.

In quantum information theory, it is a fundamental problem to construct multipartite unextendible product bases (UPBs). We show that there exist two families UPBs in Hilbert space $\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^4$ by merging two different systems of an existing $7$-qubit UPB of size $11$. Moreover, a new family of $7$-qubit positive-partial-transpose (PPT) entangled states of rank $2^7-11$ is constructed. We analytically derive a geometric measure of entanglement of a special PPT entangled states. Also an upper bound are given by two methods., Comment: 15 pages, 4 figures

In this paper we define the notion of local rank for fusion systems so as to reformulate the Alperin's weight conjecture in the framework of block fusion systems following the work by Kn\"orr and Robinson., Comment: 16 pages

Let $G$ be a subgroup of $S_{n}$, the symmetric group of degree $n$. For any field $k$, $G$ acts naturally on the rational function field $k(x_{1},\cdots,x_{n})$ via $k$-automorphisms defined by $\sigma\cdot x_{i}:=x_{\sigma\cdot i}$ for any $\sigma\in G$ and $1\leq i\leq n$. In this article, we will show that if $G$ is a solvable transitive subgroup of $S_{14}$ and $\text{char}(k)=7$, then the fixed subfield $k(x_{1},\cdots,x_{14})^{G}$ is rational (i.e., purely transcendental) over $k$. In proving the above theorem, we rely on the Kuniyoshi-Gasch\"utz Theorem or some ideas in its proof.

For any field K and any transitive subgroup G of S_8, let G acts naturally on K(x_1, . . ., x_8) by permutations of the variables, we prove that under some minor conditions K(x_1, . . ., x_8)^G is always K-rational except G is A_8 or G is isomorphic to PGL(2, 7). We pay special attentions on the characteristic 2 cases., Comment: 29 pages

Let $G$ be a subgroup of $S_6$, the symmetric group of degree 6. For any field $k$, $G$ acts naturally on the rational function field $k(x_1,...,x_6)$ via $k$-automorphisms defined by $\sigma\cdot x_i=x_{\sigma(i)}$ for any $\sigma\in G$, any $1\le i\le 6$. Theorem. The fixed field $k(x_1,...,x_6)^G$ is rational (=purely transcendental) over $k$, except possibly when $G$ is isomorphic to $PSL_2(\bm{F}_5)$, $PGL_2(\bm{F}_5)$ or $A_6$. When $G$ is isomorphic to $PSL_2(\bm{F}_5)$ or $PGL_2(\bm{F}_5)$, then $\bm{C}(x_1,...,x_6)^G$ is $\bm{C}$-rational and $k(x_1,...,x_6)^G$ is stably $k$-rational for any field $k$. The invariant theory of wreath products will be investigated also.

Let $G$ be a subgroup of $S_n$, the symmetric group of degree $n$. For any field $k$, $G$ acts naturally on the rational function field $k(x_1,x_2,\ldots,x_n)$ via $k$-automorphisms defined by $\sigma\cdot x_i=x_{\sigma(i)}$ for any $\sigma\in G$, any $1\le i\le n$. Theorem. If $n\le 5$, then the fixed field $k(x_1,\ldots,x_n)^G$ is purely transcendental over $k$. We will show that $\bm{C}(x_1,\ldots,x_7)^G$ is also purely transcendental over $\bm{C}$ if $G$ is any transitive subgroups of $S_7$ other than $A_7$; a similar result is valid for solvable transitive subgroups of $S_{11}$.