Related papers: Small knot mosaics and partition matrices
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…
We introduce and explore the notion of texture of an arbitrary quantum state, in a selected basis. In the first part of this letter we develop a resource theory and show that state texture is adequately described by an easily computable…
Looking at incidence matrices of $t$-$(v,k,\lambda)$ designs as $v \times b$ matrices with $2$ possible entries, each of which indicates incidences of a $t$-design, we introduce the notion of a $c$-mosaic of designs, having the same number…
A single qubit may be represented on the Bloch sphere or similarly on the $3$-sphere $S^3$. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of $3$-manifolds. A magic state and…
Macroscopic quantum phenomena refer to quantum features in objects of `large' sizes, systems with many components or degrees of freedom, organized in ways where they can be identified as macroscopic objects. This emerging field is ushered…
We discuss existence of mixed state of multicomponent system with given spectrum and given reduced density matrices. We give a complete solution of the problem in terms of linear inequalities on the spectra, accompanied with extensive…
We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are provided as an input structure for tiles to grow along: we…
Howards and Kobin give a sharp upper bound for crossing number of knots on rectangular mosaics. Here we extend the proof to create a new bound for hexagonal mosaics in all three natural settings and shorten the proof in the rectangular…
The notion of a macroscopic quantum state must be pinned down in order to assess how well experiments probe the large-scale limits of quantum mechanics. However, the issue of quantifying so-called quantum macroscopicity is fraught with…
Given a locally finite set $A \subseteq \mathbb{R}^d$ and a coloring $\chi \colon A \to \{0,1,\ldots,s\}$, we introduce the chromatic Delaunay mosaic of $\chi$, which is a Delaunay mosaic in $\mathbb{R}^{s+d}$ that represents how points of…
In a convex mosaic in $\mathbb{R} ^d$ we denote the average number of vertices of a cell by $\bar v$ and the average number of cells meeting at a node by $\bar n$. Except for the $d=2$ planar case, there is no known formula prohibiting…
The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its…
When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…
The circuit model of quantum computation is reformulated as a multilayer network theory [3] called a Quantum Multiverse Network (QuMvN). The QuMvN formulation allows us to interpret the quantum wave function as a combination of ergodic…
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…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
Recently, Andrews, Bhattacharjee and Dastidar introduced the concept of $k$-measure of an integer partition, and proved a surprising identity that the number of partitions of $n$ which have $2$-measure $m$ is equal to the number of…
Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e.…
The theory of bottom tangles is used to construct a quantum fundamental group. On the other hand, the skein module is considered as a quantum analogue of the $SL(2)$ representation of the fundamental group. Here we construct the skein…