Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Liang, Qingzhong"'
Divisible codes are defined by the property that codeword weights share a common divisor greater than one. They are used to design signals for communications and sensing, and this paper explores how they can be used to protect quantum information as
Externí odkaz:
http://arxiv.org/abs/2204.13176
Magic state distillation and the Shor factoring algorithm make essential use of logical diagonal gates. We introduce a method of synthesizing CSS codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The metho
Externí odkaz:
http://arxiv.org/abs/2110.11923
Publikováno v:
Quantum 6, 802 (2022)
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper introduces a framew
Externí odkaz:
http://arxiv.org/abs/2109.13481
Publikováno v:
Advances in Applied Mathematics, 133 (2022)
Design of experiments and model selection, though essential steps in data science, are usually viewed as unrelated processes in the study and analysis of biological networks. Not accounting for their inter-relatedness has the potential to introduce b
Externí odkaz:
http://arxiv.org/abs/2101.09384
Publikováno v:
IEEE Transactions on Information Theory, vol. 68, no. 3, pp. 1795-1808, March 2022
Physical platforms such as trapped ions suffer from coherent noise where errors manifest as rotations about a particular axis and can accumulate over time. We investigate passive mitigation through decoherence free subspaces, requiring the noise to p
Externí odkaz:
http://arxiv.org/abs/2011.00197
Autor:
Adeniran, Ayomikun, Butler, Steve, Dorpalen-Barry, Galen, Harris, Pamela E., Hettle, Cyrus, Liang, Qingzhong, Martin, Jeremy L., Nam, Hayan
Publikováno v:
Electron. J. Combin. 27(2) (2020), #P2.44
Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$
Externí odkaz:
http://arxiv.org/abs/1912.01688
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Adeniran, Ayomikun, Butler, Steve, Defant, Colin, Gao, Yibo, Harris, Pamela E., Hettle, Cyrus, Liang, Qingzhong, Nam, Hayan, Volk, Adam
We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities relating the
Externí odkaz:
http://arxiv.org/abs/1809.09360
Autor:
Liang, Qingzhong, Bowling, Grant
The cyclic sieving phenomenon (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP conditions for
Externí odkaz:
http://arxiv.org/abs/1712.07812