Related papers: Building manifolds from quantum codes
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function…
We consider the problem of developing a method to reconstruct a potential $q$ from the partial data Dirichlet-to-Neumann map for the Schr\"odinger equation $(-\Delta_g+q)u=0$ on a fixed admissible manifold $(M,g)$. If the part of the…
In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…
We study inverse statistical mechanics: how can one design a potential function so as to produce a specified ground state? In this paper, we show that unexpectedly simple potential functions suffice for certain symmetrical configurations,…
This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…
Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite…
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…
This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…
Free categorical constructions characterise quantum computing as the combination of two copies of a reversible classical model, glued by the complementarity equations of classical structures. This recipe effectively constructs a…
We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field $\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal under the…
Quantum algorithms operate on quantum states through unitary transformations in high dimensional complex Hilbert space. In this work, we propose a machine learning approach to create the quantum circuit using a single-layer complex-valued…
Using odd symplectic structure constructed over tangent bundle of the symplectic manifold, we construct the simple supergeneralization of an arbitrary Hamiltonian mechanics on it. In the case, if the initial mechanics defines Killing vector…
This paper deals with a general method for the reduction of quantum systems with symmetry. For a Riemannian manifold M admitting a compact Lie group G as an isometry group, the quotient space Q = M/G is not a smooth manifold in general but…
Assume that $M$ is a compact Riemannian manifold of bounded geometry given by restrictions on its diameter, Ricci curvature and injectivity radius. Assume we are given, with some error, the first eigenvalues of the Laplacian $\Delta_g$ on…
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…
We explore a geometric perspective on quantum field theory by considering the configuration space, where all field configurations reside. Employing $n$-particle irreducible effective actions constructed via Legendre transforms of the…
We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…