Exploring Relationship Between Traditional Lattices and Graph Lattices of Topological Coding
It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored graphic lattice or a colored graphic lattice in topol...
Guardado en:
Autor principal: | ZHANG Mingjun, YANG Sihua, YAO Bing |
---|---|
Formato: | article |
Lenguaje: | ZH |
Publicado: |
Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/0866fc81c35e4941a683c184197f100f |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Skew lattices
por: Srinivas,K. V. R
Publicado: (2011) -
On rigid Hermitean lattices, II
por: Maza,Ana Cecilia de la, et al.
Publicado: (2018) -
Local-in-time adjoint-based topology optimization of unsteady fluid flows using the lattice Boltzmann method
por: Cong CHEN, et al.
Publicado: (2017) -
The continuum and leading twist limits of parton distribution functions in lattice QCD
por: Joseph Karpie, et al.
Publicado: (2021) -
Edge even graceful labeling of torus grid graph
por: Daoud,Salama Nagy, et al.
Publicado: (2020)