# chorasimilarity

computing with space
Home > Uncategorized > Towards qubits: graphic lambda calculus over conical groups and the barycentric move

## Towards qubits: graphic lambda calculus over conical groups and the barycentric move

February 14, 2013

In this post I want to pave the way to the application of graphic lambda calculus to the realm of quantum computation. It is not a short, nor too lengthy way, which will be explained in several posts. Also, some experimentation is to be expected.

Disclaimer: For the moment it is not very clear to me which are the exact relations between the approach I am going to explain and linear lambda calculus or the  lambda calculus for quantum computation.  I expect a certain overlapping, but maybe not as much as expected (by the specialist in the field). The reason is that the instruments and goals which I have come from fields apparently far away from quantum computation, as for example sub-riemannian geometry, which is my main field of interest (however, for an interaction between sub-riemannian geometry and computation  see  L_p metrics on the Heisenberg group and the Goemans-Linial conjecture, by James R. Lee and Asaf Naor). Therefore, I feel the need to issue such a disclaimer for the narrow specialist.

Background for his post:

• The page Graphic lambda calculus
•  [1] Infinitesimal affine geometry of metric spaces endowed with a dilatation structure, Houston J.  Math., 36, 1 (2010), 91-136, arXiv:0804.0135.
• [2]  On graphic lambda calculus and the dual of the graphic beta move, arXiv:1302.0778.

Affine conical spaces. In the article [1] they appear under the name “normed affine group spaces”, definition 3. We may use the same type of arguments as the ones from emergent algebras   in order to get rid of the need to have a norm on such spaces.  Instead of anorm we shall put an uniformity on such a space, such that the topology associated to the uniformity makes the space to be locally compact.

Theorem 2.2 [1] characterizes affine conical spaces as self-distributive emergent algebras. The relations satisfied by self-distributive emergent algebras, if graphically represented by gates in graphic lambda calculus, are the following:

• fan-out moves, pruning moves,
• emergent algebra moves
• The Reidemeister move R3a  (which represents self-distributivity), described in this post.

Notice that I don’t want to use the dual of the graphic beta move ([2], section 8), which is simply too powerful in this context (see [2] section 10). That is why I use instead the move R3a (which is a composite of dual beta moves). Another instance of this choice will be explained in a future post, having to do with the distributivity of the emergent algebra operations with respect to the application and lambda gates.

The barycentric move.   In order to obtain usual affine spaces instead of their more general,  noncommutative versions (i.e. affine conical spaces), we have to add the barycentric condition. This condition appears as (Af3) in Theorem 2.2 [1].  I shall transform this condition into a move in graphic lambda calculus.

The barycentric move BAR is described by the following figure and explanation. We take the commutative group $\Gamma$, which is used to label the emergent algebra gates, as $\Gamma = K^{*}$, where $K$ is a field. (Therefore $K = \Gamma \cup \left\{ 0 \right\}$.) We have then two operations on the field $K$: multiplication $\varepsilon, \mu) \mapsto \varepsilon \mu$ and addition $(\varepsilon, \mu) \mapsto \varepsilon + \mu$. Because $K$ contains also the element $0$, the neutral element for addition, we add a new gate $\bar{0}$.  With these preparations, the BAR move is the following:

Notice that when $\varepsilon = 1$ at the left hand side of the figure appears the gate $\bar{0}$. This gate corresponds, in the particular case of a vector space, to the usual dilation of coefficient $0$. We don’t need to put this as a sort of an axiom, because we can obtain it as a combination of the BAR move and ext2 moves. Indeed:

Knowing this, we can extend the emergent algebra moves R1a, R1b and R2 to the case $\varepsilon = 0$. Here is the proof. For R1a we do this:

The move R1b, for the degenerate case $\varepsilon = 0$, is this:

Finally, for the move R2 we have two cases, corresponding to $0 \, \varepsilon = 0$ and $\varepsilon \, 0 = 0$. The first case is this:

The second case is this:

Final remark: The move BAR can be seen as analogous of an infinite sequence of moves R3 (but there is no rigorous sense for this in graphic lambda calculus). Indeed, this is related to the fact that $\frac{1}{1-\varepsilon} = \sum^{\infty}_{0} \varepsilon^{k}$.  See [1] section 8 “Noncommutative affine geometry” for the dilation structures correspondent of this equality and also see the post Menelaus theorem by way of Reidemeister move 3.

### Like this:

1. No comments yet.
1. February 19, 2013 at 5:25 pm | #1
2. March 21, 2013 at 5:08 pm | #2
3. April 28, 2013 at 1:04 pm | #3
4. May 15, 2013 at 12:55 pm | #4
Sauropod Vertebra Picture of the Week #AcademicSpring

SV-POW! ... All sauropod vertebrae, except when we're talking about Open Access

Science to Grok

computing with space

isomorphismes

computing with space

DIANABUJA'S BLOG: Africa, the Middle East, Agriculture, History & Culture

Ambling through the present and past

Retraction Watch

Tracking retractions as a window into the scientific process

Shtetl-Optimized

computing with space

Not Even Wrong

computing with space

Theoretical Atlas

He had bought a large map representing the sea, / Without the least vestige of land: / And the crew were much pleased when they found it to be / A map they could all understand.

Gödel's Lost Letter and P=NP

a personal view of the theory of computation

Gowers's Weblog

Mathematics related discussions

Research and Lecture notes

by Fabrice Baudoin

Calculus VII

being boring

The "Putnam Program"

Language & Brains, Machines & Minds

What's new

Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Tao

Cancel
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 18, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8922616839408875, "perplexity_flag": "middle"}