相关论文: A Universal Construction for Unique Sink Orientati…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

Unitary designs are unitary ensembles that emulate Haar-random unitary statistics. They provide a vital tool for studying quantum randomness and have found broad applications in quantum technologies. However, existing research has focused…

In this paper, we propose a new and broadly applicable root-finding method, called as the upper-crossing/solution (US) algorithm, which belongs to the category of non-bracketing (or open domain) methods. The US algorithm is a general…

We propose a universal practical approach to realize magnetic second-order topological insulator (SOTI) materials, based on properly breaking the time reversal symmetry in conventional (first-order) topological insulators. The approach…

Unitary evolutions of a qubit are traditionally represented geometrically as rotations of the Bloch sphere, but the composition of such evolutions is handled algebraically through matrix multiplication [of SU(2) or SO(3) matrices].…

Recent experimental breakthroughs, particularly for single-qubit and two-qubit gates exceeding the error correction threshold, highlight silicon spin qubits as leading candidates for fault-tolerant quantum computation. In the existing…

The 2x2 space-filling curve is a type of generalized space-filling curve characterized by a basic unit is in a "U-shape" that traverses a 2x2 grid. In this work, we propose a universal framework for constructing general 2x2 curves where…

We introduce a family of copulas which are locally piecewise uniform in the interior of the unit cube of any given dimension. Within that family, the simultaneous control of tail dependencies of all projections to faces of the cube is…

We investigate the mathematical structure of unit systems and the relations between them. Looking over the entire set of unit systems, we can find a mathematical structure that is called preorder (or quasi-order). For some pair of unit…

Override and update are natural constructions for combining partial functions, which arise in various program specification contexts. We use an unexpected connection with combinatorial geometry to provide a complete finite system of…

For each $\Pi^0_1$ $S\subseteq \mathbb{N}$, let the $S$-square shift be the two-dimensional subshift on the alphabet $\{0,1\}$ whose elements consist of squares of 1s of various sizes on a background of 0s, where the side length of each…

We provide a universal construction of the category of finite-dimensional C*-algebras and completely positive trace-nonincreasing maps from the rig category of finite-dimensional Hilbert spaces and unitaries. This construction, which can be…

We introduce a new method of constructing Birkhoff sections for pseudo-Anosov flows, which uses the connection between pseudo-Anosov flows and veering triangulations. This method allows for explicit constructions, as well as control over…

Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…

It is sometimes desirable to produce for a nonlinear system of ODEs a new representation of simpler structural form, but it is well known that this goal may imply an increase in the dimension of the system. This is what happens if in this…

New universal invariant operators are introduced in a class of geometries which include the quaternionic structures and their generalisations as well as 4-dimensional conformal (spin) geometries. It is shown that, in a broad sense, all…

Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show…

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…

Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of…

We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary…