The LU-LC conjecture is false

The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equivalent stabilizer states are also local Clifford equivalent. If this conjecture were true, the local equivalence of stabilizer states would be extremely easy to characterize. Unfortunately, however, based on the recent progress made by Gross and Van den Nest, we find that the conjecture is false.Comment: Added a new part explaining how the counterexamples are foun

Constraints on anomalous quartic gauge couplings via WγjjW\gamma jj production at the LHC

The vector boson scattering at the Large Hadron Collider (LHC) is sensitive to anomalous quartic gauge couplings (aQGCs). In this paper, we investigate the aQGC contribution to $W \gamma jj$ production at the LHC with $\sqrt{s}=13$ TeV in the context of an effective field theory (EFT). The unitarity bound is applied as a cut on the energy scale of this production process, which is found to have significant suppressive effects on the signals. To enhance the statistical significance, we analyse the kinematic and polarization features of the aQGC signals in detail. We find that the polarization effects induced by the aQGCs are unique and can discriminate the signals from the SM backgrounds well. With the proposed event selection strategy, we obtain the constraints on the coefficients of dimension-8 operators with current luminosity. The results indicate that the process $pp \to W \gamma jj$ is powerful for searching for the $O_{M_{2,3,4,5}}$ and $O_{T_{5,6,7}}$ operators.Comment: 29 pages, 11 figures, 7 tables, to be published in Chinese Physics

On Path Memory in List Successive Cancellation Decoder of Polar Codes

Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the state-of-the-art designs, the memories are implemented with registers and a large crossbar is used for copying the partial decoded vectors from one block of memory to another during the update. The architectures are quite area-costly when the code length and list size are large. To solve this problem, we propose two optimization schemes for the path memory in this work. First, a folded path memory architecture is presented to reduce the area cost. Second, we show a scheme that the path memory can be totally removed from the architecture. Experimental results show that these schemes effectively reduce the area of path memory.Comment: 5 pages, 6 figures, 2 table