相关论文: Constructing Two Edge-Disjoint Hamiltonian Cycles …

Single electron spins in quantum dots are attractive for quantum communication because of their expected long coherence times. We propose a method to create entanglement between two remote spins based on the coincident detection of two…

This work proposes a distributed algorithm for solving empirical risk minimization problems, called L-DQN, under the master/worker communication model. L-DQN is a distributed limited-memory quasi-Newton method that supports asynchronous…

The scarcity of qubits is a major obstacle to the practical usage of quantum computers in the near future. To circumvent this problem, various circuit knitting techniques have been developed to partition large quantum circuits into…

Superconducting circuits are one of the leading quantum platforms for quantum technologies. With growing system complexity, it is of crucial importance to develop scalable circuit models that contain the minimum information required to…

Thanks to recent advances, the 4D quantum Hall (QH) effect is becoming experimentally accessible in various engineered set-ups. In this paper, we propose a new type of 4D topological system that, unlike other 2D and 4D QH models, does not…

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

Non-local communication among position based qubits is described for the system of the quantum electromagnetic resonator entangled to two semiconductor electrostatic qubits via interaction between matter and radiation by Jaynes-Cummings…

We propose a superconducting circuit architecture suitable for digital-analog quantum computing (DAQC) based on an enhanced NISQ family of nearest-neighbor interactions. DAQC makes a smart use of digital steps (single qubit rotations) and…

Edge networks call for communication efficient (low overhead) and robust distributed optimization (DO) algorithms. These are, in fact, desirable qualities for DO frameworks, such as federated edge learning techniques, in the presence of…

An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m \times n$…

The balanced hypercube $BH_n$, a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2,\cdots,s_{2n-2}\}$ and $T=\{t_1,t_2,\cdots,t_{2n-2}\}$ are…

In real communication and transportation networks, the geographical positions of nodes are very important for the efficiency and the tolerance of connectivity. Considering spatially inhomogeneous positions of nodes according to a…

Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

We say that a set of pairs of disjoint cycles $\Lambda(G)$ of a graph $G$ is linked if for any spatial embedding $f$ of $G$ there exists an element $\lambda$ of $\Lambda(G)$ such that the $2$-component link $f(\lambda)$ is nonsplittable,…

We investigate the coupling of two spatially separated qubits via topologically protected edge states in a two-dimensional Hofstadter lattice. In this hybrid platform, the qubits are coupled to distinct edge sites of the lattice, enabling…

In the parallel processing field, graph embedding is motivated by simulation interconnection networks to another. The quadtree is an important technique used to present spatial data and is used in many application domains, especially…

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…