相关论文: On construction of anticliques for non-commutative…

This paper considers the comparison between the eigenvalues of Laplace operators with the standard conditions and the anti-standard conditions on non-bipartite graphs which are equilateral or inequilateral. First of all, we show the…

We propose a new method, "counter-factual" carving, that uses the "no-jump" evolution of a probe to generate entangled many-body states of high fidelity. The probe is coupled to a target ensemble of qubits and engineered to exponentially…

We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum…

Entangled qubit can increase the capacity of quantum error correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the…

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…

Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…

Graph states are versatile resources for quantum computation and quantum-enhanced measurement. Their generation illustrates a high level of control over entanglement. We report on the generation of continuous-variable graph states of atomic…

Quantum mechanics of composite systems, gives rise to certain special states called entangled states. A physical system, that is in an entangled state displays an intricate correlation between its subsystems. There are also some composite…

We consider composability of quantum channels from a limited amount of entanglement via local operations and classical communication (LOCC). We show that any $k$-partially entanglement breaking channel can be composed from an entangled…

Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. found correlations from Pauli measurements on certain network graphs refute a local hidden variable (LHV) description even allowing some…

We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations…

We modify the Hochschild $\phi$-map to construct central extensions of a restricted Lie algebra. Such central extension gives rise to a group scheme which leads to a geometric construction of unrestricted representations. For a classical…

This paper is intended to provide concrete examples of concepts discussed elsewhere in this volume, especially splittings of groups and non-positively curved cube complexes but also other things. The idea of the construction (configuration…

We study genuine tripartite entanglement and multipartite entanglement of arbitrary $n$-partite quantum states by using the representations with generalized Pauli operators of a density matrices. While the usual Bloch representation of a…

Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems. We present a new way to construct mutually unbiased bases by difference matrices in the theory of combinatorial…

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…

We prove that graphs that do not contain a totally odd immersion of $K_t$ are $\mathcal{O}(t)$-colorable. In particular, we show that any graph with no totally odd immersion of $K_t$ is the union of a bipartite graph and a graph which…

We study the power of closed timelike curves (CTCs) and other nonlinear extensions of quantum mechanics for distinguishing nonorthogonal states and speeding up hard computations. If a CTC-assisted computer is presented with a labeled…