Related papers: Building manifolds from quantum codes
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
Extended Schwinger's quantization procedure is used for constructing quantum mechanics on a manifold with a group structure. The considered manifold $M$ is a homogeneous Riemannian space with the given action of isometry transformation…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
Schwinger's quantization scheme is extended in order to solve the problem of the formulation of quantum mechanics on a space with a group structure. The importance of Killing vectors in a quantization scheme is showed. Usage of these…
Designing quantum circuits for ground state preparation is a fundamental task in quantum information science. However, standard Variational Quantum Algorithms (VQAs) are often constrained by limited ansatz expressivity and difficult…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
Recent advancements in the discipline of quantum algorithms have displayed the importance of the geometry of quantum operators. Given this thrust, this paper develops a rigorous geometric framework to analyze how the Riemannian structure of…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Motivated by the geometrical structures of quantum mechanics, we introduce an almost-complex structure $J$ on the product $M\times M$ of any parallelizable statistical manifold $M$. Then, we use $J$ to extract a pre-symplectic form and a…
In this paper we discuss how we can design Hamiltonians to implement quantum algorithms, in particular we focus in Deutsch and Grover algorithms. As main result of this paper, we show how Hamiltonian inverse quantum engineering method allow…
We give a new reconstruction method of big quantum $K$-ring based on the $q$-difference module structure in quantum $K$-theory. The $q$-difference structure yields commuting linear operators $A_{i,\rm com}$ on the $K$-group as many as the…
In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…
Control barrier functions (CBFs) have a well-established theory in Euclidean spaces, yet still lack general formulations and constructive synthesis tools for systems evolving on manifolds common in robotics and aerospace applications. In…
This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with…
We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph…