Related papers: Building manifolds from quantum codes
We construct potentially new manifolds homeomorphic but not diffeomorphic to $\mathbb{CP}^{2} \# 8 \overline{\mathbb{CP}^{2}}$ and $\mathbb{CP}^{2} \# 9 \overline{\mathbb{CP}^{2}}$ via rational blowdown surgery along certain $4$-valent…
A few pages in Siegel describe how, starting with a fundamental polygon for a compact Riemann surface, one can construct a symplectic basis of its homology. This note retells that construction, specializing to the case where the surface is…
A theory of principal bundles possessing quantum structure groups and classical base manifolds is presented. Structural analysis of such quantum principal bundles is performed. A differential calculus is constructed, combining differential…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
Ref. 1 asked whether deleting gates from a random quantum circuit architecture can ever make the architecture a better approximate $t$-design. We show that it can. In particular, we construct a family of architectures such that the…
In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold of Euclidean space without maintaining or even constructing complicated data structures such as Voronoi diagrams or Delaunay complexes. Our…
We generalize the computation of Feynman integrals of log divergent graphs in terms of the Kirchhoff polynomial to the case of graphs with both fermionic and bosonic edges, to which we assign a set of ordinary and Grassmann variables. This…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Using extended Schwinger's quantization approach quantum mechanics on a Riemannian manifold $M$ with a given action of an intransitive group of isometries is developed. It was shown that quantum mechanics can be determined unequivocally…
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
In the age of noisy quantum processors, the exploitation of quantum symmetries can be quite beneficial in the efficient preparation of trial states, an important part of the variational quantum eigensolver algorithm. The benefits include…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
Quantum control is an important logical primitive of quantum computing programs, and an important concept for equational reasoning in quantum graphical calculi. We show that controlled diagrams in the ZXW-calculus admit rich algebraic…
Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for generating unbiased and independent samples from graphical models remains an active research…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
The realization of quantum algorithms relies on specific quantum compilations according to the underlying quantum processors. However, there are various ways to physically implement qubits in different physical devices and manipulate those…