相关论文: Realizing string-net condensation: Fibonacci anyon…
Even-denominator quantum Hall states can host several types of anyons with distinct exchange statistics. Depending on the anyon type, exchanging two quasiparticles can impart a phase to the many-body wave function or even transform it into…
Graph Convolutional Networks (GCNs) achieve an impressive performance due to the remarkable representation ability in learning the graph information. However, GCNs, when implemented on a deep network, require expensive computation power,…
Graph condensation has emerged as an intriguing technique to save the expensive training costs of Graph Neural Networks (GNNs) by substituting a condensed small graph with the original graph. Despite the promising results achieved, previous…
Camouflaged object detection (COD) aims to segment objects that blend into their surroundings. However, most existing studies overlook the semantic differences among textual prompts of different targets as well as fine-grained frequency…
We establish an exact mapping between identical particles in one dimension with arbitrary exchange statistics, including bosons, anyons and fermions, provided they share the same scattering length. This boson-anyon-fermion mapping…
Real-time semantic segmentation, which can be visually understood as the pixel-level classification task on the input image, currently has broad application prospects, especially in the fast-developing fields of autonomous driving and drone…
The viscosity of the suspension consisting of fine particles dispersed in a Newtonian liquid diverges close to the jamming packing fraction. The contact microstructure in suspensions governs this macroscopic behavior in the vicinity of…
Active quantum error correction has been identified as a crucial ingredient of future quantum computers, motivating the recent experimental efforts to encode logical quantum bits using small topological codes. In addition to the…
Strongly interacting topologically ordered many-body systems consisting of fermions or bosons can host exotic quasiparticles with anyonic statistics. This raises the question whether many-body systems of anyons can also form anyonic…
The burgeoning volume of graph data presents significant computational challenges in training graph neural networks (GNNs), critically impeding their efficiency in various applications. To tackle this challenge, graph condensation (GC) has…
We compare two different implementations of fault-tolerant entangling gates on logical qubits. In one instance, a twelve-qubit trapped-ion quantum computer is used to implement a non-transversal logical CNOT gate between two five qubit…
Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in…
We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions. These enhanced theories offer more powerful models for quantum computation.…
Anyons are low-dimensional quasiparticles that obey fractional statistics, hence interpolating between bosons and fermions. In two dimensions, they exist as elementary excitations of fractional quantum Hall states and they are believed to…
Random Linear Network Coding (RLNC) has been proved to offer an efficient communication scheme, leveraging an interesting robustness against packet losses. However, it suffers from a high computational complexity and some novel approaches,…
Experimental realization of a universal set of quantum logic gates with high-fidelity is critical to quantum information processing, which is always challenging by inevitable interaction between the quantum system and environment. Geometric…
Non-Abelian anyons are exotic quasiparticle excitations hosted by certain topological phases of matter. They break the fermion-boson dichotomy and obey non-Abelian braiding statistics: their interchanges yield unitary operations, rather…
Counting $(p,q)$-bicliques in bipartite graphs is crucial for a variety of applications, from recommendation systems to cohesive subgraph analysis. Yet, it remains computationally challenging due to the combinatorial explosion to exactly…
We address the problem of computing the distribution of induced connected subgraphs, aka \emph{graphlets} or \emph{motifs}, in large graphs. The current state-of-the-art algorithms estimate the motif counts via uniform sampling, by…
In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely…