ﻻ يوجد ملخص باللغة العربية
The ZX calculus is a mathematical tool to represent and analyse quantum operations by manipulating diagrams which in effect represent tensor networks. Two families of nodes of these networks are ones which commute with either Z rotations or X rotations, usually called green nodes and red nodes respectively. The original formulation of the ZX calculus was motivated in part by properties of the algebras formed by the green and red nodes: notably, that they form a bialgebra -- but only up to scalar factors. As a consequence, the diagram transformations and notation for certain unitary operations involve scalar gadgets which denote contributions to a normalising factor. We present renormalised generators for the ZX calculus, which form a bialgebra precisely. As a result, no scalar gadgets are required to represent the most common unitary transformations, and the corresponding diagram transformations are generally simpler. We also present a similar renormalised version of the ZH calculus. We obtain these results by an analysis of conditions under which various idealised rewrites are sound, leveraging the existing presentations of the ZX and ZH calculi.
ZX-calculus is graphical language for quantum computing which usually focuses on qubits. In this paper, we generalise qubit ZX-calculus to qudit ZX-calculus in any finite dimension by introducing suitable generators, especially a carefully chosen tri
Self tuning is one of the few methods for dynamically cancelling a large cosmological constant and yet giving an accelerating universe. Its drawback is that it tends to screen all sources of energy density, including matter. We develop a model that t
When faced with two nigh intractable problems in cosmology -- how to remove the original cosmological constant problem and how to parametrize modified gravity to explain current cosmic acceleration -- we can make progress by counterposing them. The w
Well tempering is one of the few classical field theory methods for solving the original cosmological constant problem, dynamically canceling a large (possibly Planck scale) vacuum energy and leaving the matter component intact, while providing a via
ZX-calculus is a graphical language for quantum computing which is complete in the sense that calculation in matrices can be done in a purely diagrammatic way. However, all previous universally complete axiomatisations of ZX-calculus have included at