We study a purely functional quantum extension of lambda calculus, that is, an extension of lambda calculus to express some quantum features, where the quantum memory is abstracted out. This calculus is a typed extension of the first-order linear-algebraic lambda-calculus. The type is linear on superpositions, so to forbid from cloning them, while allows to clone basis vectors. We provide examples of the Deutsch algorithm and the Teleportation, and prove the subject reduction of the calculus. In addition, we provide a denotational semantics where superposed types are interpreted as vector spaces and non-superposed types as their basis.
A Unifying Review of Gaussian Linear Models (Roweis 1999)Feynman Liang
Through a linear Gaussian process, we can unify a family of Gaussian linear models including Factor Analysis, PCA, Kalman Filters, Mixture of Gaussians, and Hidden Markov Models.
The linear-algebraic lambda-calculus (arXiv:quant-ph/0612199) extends the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms a.t+b.u. In this paper we provide a System F -like type system for the linear-algebraic lambda-calculus, which keeps track of \'the amount of a type\' that is present in a term. We show that this scalar type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results. The latter yields a significant simplification of the linear-algebraic lambda-calculus itself, by removing the need for some restrictions in its reduction rules - and thus leaving it more intuitive. More importantly we show that our type system can readily be modified into a probabilistic type system, which guarantees that terms define correct probabilistic functions. Thus we are able to specialize the linear-algebraic lambda-calculus into a higher-order, probabilistic lambda-calculus. Finally we discuss the more long-term aims of this reseach in terms of establishing connections with linear logic, and building up towards a quantum physical logic through the Curry-Howard isomorphism. Thus we begin to investigate the logic induced by the scalar type system, and prove a no-cloning theorem expressed solely in terms of the possible proof methods in this logic.
First-order cosmological perturbations produced by point-like masses: all sca...Maxim Eingorn
This presentation based on the paper http://arxiv.org/abs/1509.03835 was made at Institute of Cosmology, Tufts University, on November 12, 2015. The abstract follows:
In the framework of the concordance cosmological model the first-order scalar and vector perturbations of the homogeneous background are derived without any supplementary approximations in addition to the weak gravitational field limit. The sources of these perturbations (inhomogeneities) are presented in the discrete form of a system of separate point-like gravitating masses. The obtained expressions for the metric corrections are valid at all (sub-horizon and super-horizon) scales and converge in all points except the locations of the sources, and their average values are zero (thus, first-order backreaction effects are absent). Both the Minkowski background limit and the Newtonian cosmological approximation are reached under certain well-defined conditions. An important feature of the velocity-independent part of the scalar perturbation is revealed: up to an additive constant it represents a sum of Yukawa potentials produced by inhomogeneities with the same finite time-dependent Yukawa interaction range. The suggesting itself connection between this range and the homogeneity scale is briefly discussed along with other possible physical implications.
ALL-SCALE cosmological perturbations and SCREENING OF GRAVITY in inhomogeneou...Maxim Eingorn
M. Eingorn, First-order cosmological perturbations engendered by point-like masses, ApJ 825 (2016) 84: http://iopscience.iop.org/article/10.3847/0004-637X/825/2/84
In the framework of the concordance cosmological model, the first-order scalar and vector perturbations of the homogeneous background are derived in the weak gravitational field limit without any supplementary approximations. The sources of these perturbations (inhomogeneities) are presented in the discrete form of a system of separate point-like gravitating masses. The expressions found for the metric corrections are valid at all (sub-horizon and super-horizon) scales and converge at all points except at the locations of the sources. The average values of these metric corrections are zero (thus, first-order backreaction effects are absent). Both the Minkowski background limit and the Newtonian cosmological approximation are reached under certain well-defined conditions. An important feature of the velocity-independent part of the scalar perturbation is revealed: up to an additive constant, this part represents a sum of Yukawa potentials produced by inhomogeneities with the same finite time-dependent Yukawa interaction range. The suggested connection between this range and the homogeneity scale is briefly discussed along with other possible physical implications.
A Unifying Review of Gaussian Linear Models (Roweis 1999)Feynman Liang
Through a linear Gaussian process, we can unify a family of Gaussian linear models including Factor Analysis, PCA, Kalman Filters, Mixture of Gaussians, and Hidden Markov Models.
The linear-algebraic lambda-calculus (arXiv:quant-ph/0612199) extends the lambda-calculus with the possibility of making arbitrary linear combinations of lambda-calculus terms a.t+b.u. In this paper we provide a System F -like type system for the linear-algebraic lambda-calculus, which keeps track of \'the amount of a type\' that is present in a term. We show that this scalar type system enjoys both the subject-reduction property and the strong-normalisation property, which constitute our main technical results. The latter yields a significant simplification of the linear-algebraic lambda-calculus itself, by removing the need for some restrictions in its reduction rules - and thus leaving it more intuitive. More importantly we show that our type system can readily be modified into a probabilistic type system, which guarantees that terms define correct probabilistic functions. Thus we are able to specialize the linear-algebraic lambda-calculus into a higher-order, probabilistic lambda-calculus. Finally we discuss the more long-term aims of this reseach in terms of establishing connections with linear logic, and building up towards a quantum physical logic through the Curry-Howard isomorphism. Thus we begin to investigate the logic induced by the scalar type system, and prove a no-cloning theorem expressed solely in terms of the possible proof methods in this logic.
First-order cosmological perturbations produced by point-like masses: all sca...Maxim Eingorn
This presentation based on the paper http://arxiv.org/abs/1509.03835 was made at Institute of Cosmology, Tufts University, on November 12, 2015. The abstract follows:
In the framework of the concordance cosmological model the first-order scalar and vector perturbations of the homogeneous background are derived without any supplementary approximations in addition to the weak gravitational field limit. The sources of these perturbations (inhomogeneities) are presented in the discrete form of a system of separate point-like gravitating masses. The obtained expressions for the metric corrections are valid at all (sub-horizon and super-horizon) scales and converge in all points except the locations of the sources, and their average values are zero (thus, first-order backreaction effects are absent). Both the Minkowski background limit and the Newtonian cosmological approximation are reached under certain well-defined conditions. An important feature of the velocity-independent part of the scalar perturbation is revealed: up to an additive constant it represents a sum of Yukawa potentials produced by inhomogeneities with the same finite time-dependent Yukawa interaction range. The suggesting itself connection between this range and the homogeneity scale is briefly discussed along with other possible physical implications.
ALL-SCALE cosmological perturbations and SCREENING OF GRAVITY in inhomogeneou...Maxim Eingorn
M. Eingorn, First-order cosmological perturbations engendered by point-like masses, ApJ 825 (2016) 84: http://iopscience.iop.org/article/10.3847/0004-637X/825/2/84
In the framework of the concordance cosmological model, the first-order scalar and vector perturbations of the homogeneous background are derived in the weak gravitational field limit without any supplementary approximations. The sources of these perturbations (inhomogeneities) are presented in the discrete form of a system of separate point-like gravitating masses. The expressions found for the metric corrections are valid at all (sub-horizon and super-horizon) scales and converge at all points except at the locations of the sources. The average values of these metric corrections are zero (thus, first-order backreaction effects are absent). Both the Minkowski background limit and the Newtonian cosmological approximation are reached under certain well-defined conditions. An important feature of the velocity-independent part of the scalar perturbation is revealed: up to an additive constant, this part represents a sum of Yukawa potentials produced by inhomogeneities with the same finite time-dependent Yukawa interaction range. The suggested connection between this range and the homogeneity scale is briefly discussed along with other possible physical implications.
Mathematics (from Greek μάθημα máthēma, “knowledge, study, learning”) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics
On the Numerical Solution of Differential EquationsKyle Poe
Report written to satisfy requirements of ENGR 219, Numerical Methods, as part of an independent study of the course. Topics range from multistep methods for ODE solution to finite element methods.
ARCH/GARCH model.ARCH/GARCH is a method to measure the volatility of the series, to model the noise term of ARIMA model. ARCH/GARCH incorporates new information and analyze the series based on the conditional variance where users can forecast future values with updated information. Here we used ARIMA-ARCH model to forecast moments. And forecast error 0.9%
This Presentation describes, in short, Introduction to Time Series and the overall procedure required for Time Series Modelling including general terminologies and algorithms. However the detailed Mathematics is excluded in the slides, this ppt means to give a start to understanding the Time Series Modelling before going into detailed Statistics.
Gauss Elimination Method With Partial PivotingSM. Aurnob
Gauss Elimination Method with Partial Pivoting:
Goal and purposes:
Gauss Elimination involves combining equations to eliminate unknowns. Although it is one of the earliest methods for solving simultaneous equations, it remains among the most important algorithms in use now a days and is the basis for linear equation solving on many popular software packages.
Description:
In the method of Gauss Elimination the fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Once this final variable is determined, its value is substituted back into the other equations in order to evaluate the remaining unknowns. This method, characterized by step‐by‐step elimination of the variables.
Gauss Seidel Method:
Goal and purposes:
The main goal and purpose of the program is to solve a system of n linear simultaneous equation using Gauss Seidel method.
This Slides includes:
Goal and purpose, Description, Algorithm, C-code, Screenshot etc.
Abstract : Motivated by the recovery and prediction of electricity consumption time series, we extend Nonnegative Matrix Factorization to take into account external features as side information. We consider general linear measurement settings, and propose a framework which models non-linear relationships between external features and the response variable. We extend previous theoretical results to obtain a sufficient condition on the identifiability of NMF with side information. Based on the classical Hierarchical Alternating Least Squares (HALS) algorithm, we propose a new algorithm (HALSX, or Hierarchical Alternating Least Squares with eXogeneous variables) which estimates NMF in this setting. The algorithm is validated on both simulated and real electricity consumption datasets as well as a recommendation system dataset, to show its performance in matrix recovery and prediction for new rows and columns.
A lambda calculus for density matrices with classical and probabilistic controlsAlejandro Díaz-Caro
Slides of my presentation at APLAS'17 (Suzhou, China, December 2017).
Publication: LNCS 10695:448-467, 2017 (http://dx.doi.org/10.1007/978-3-319-71237-6_22)
ArXiv'd at https://arxiv.org/abs/1705.00097
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions. We illustrate this idea by defining a quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors. In addition, we provide an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis.
Slides of LNCS 10687:281-293 paper (TPNC 2017). Full paper: https://doi.org/10.1007/978-3-319-71069-3_22
Mathematics (from Greek μάθημα máthēma, “knowledge, study, learning”) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics
On the Numerical Solution of Differential EquationsKyle Poe
Report written to satisfy requirements of ENGR 219, Numerical Methods, as part of an independent study of the course. Topics range from multistep methods for ODE solution to finite element methods.
ARCH/GARCH model.ARCH/GARCH is a method to measure the volatility of the series, to model the noise term of ARIMA model. ARCH/GARCH incorporates new information and analyze the series based on the conditional variance where users can forecast future values with updated information. Here we used ARIMA-ARCH model to forecast moments. And forecast error 0.9%
This Presentation describes, in short, Introduction to Time Series and the overall procedure required for Time Series Modelling including general terminologies and algorithms. However the detailed Mathematics is excluded in the slides, this ppt means to give a start to understanding the Time Series Modelling before going into detailed Statistics.
Gauss Elimination Method With Partial PivotingSM. Aurnob
Gauss Elimination Method with Partial Pivoting:
Goal and purposes:
Gauss Elimination involves combining equations to eliminate unknowns. Although it is one of the earliest methods for solving simultaneous equations, it remains among the most important algorithms in use now a days and is the basis for linear equation solving on many popular software packages.
Description:
In the method of Gauss Elimination the fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Once this final variable is determined, its value is substituted back into the other equations in order to evaluate the remaining unknowns. This method, characterized by step‐by‐step elimination of the variables.
Gauss Seidel Method:
Goal and purposes:
The main goal and purpose of the program is to solve a system of n linear simultaneous equation using Gauss Seidel method.
This Slides includes:
Goal and purpose, Description, Algorithm, C-code, Screenshot etc.
Abstract : Motivated by the recovery and prediction of electricity consumption time series, we extend Nonnegative Matrix Factorization to take into account external features as side information. We consider general linear measurement settings, and propose a framework which models non-linear relationships between external features and the response variable. We extend previous theoretical results to obtain a sufficient condition on the identifiability of NMF with side information. Based on the classical Hierarchical Alternating Least Squares (HALS) algorithm, we propose a new algorithm (HALSX, or Hierarchical Alternating Least Squares with eXogeneous variables) which estimates NMF in this setting. The algorithm is validated on both simulated and real electricity consumption datasets as well as a recommendation system dataset, to show its performance in matrix recovery and prediction for new rows and columns.
A lambda calculus for density matrices with classical and probabilistic controlsAlejandro Díaz-Caro
Slides of my presentation at APLAS'17 (Suzhou, China, December 2017).
Publication: LNCS 10695:448-467, 2017 (http://dx.doi.org/10.1007/978-3-319-71237-6_22)
ArXiv'd at https://arxiv.org/abs/1705.00097
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions. We illustrate this idea by defining a quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors. In addition, we provide an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis.
Slides of LNCS 10687:281-293 paper (TPNC 2017). Full paper: https://doi.org/10.1007/978-3-319-71069-3_22
MVPA with SpaceNet: sparse structured priorsElvis DOHMATOB
The GraphNet (aka S-Lasso), as well as other “sparsity + structure” priors like TV (Total-Variation), TV-L1, etc., are not easily applicable to brain data because of technical problems
relating to the selection of the regularization parameters. Also, in
their own right, such models lead to challenging high-dimensional optimization problems. In this manuscript, we present some heuristics for speeding up the overall optimization process: (a) Early-stopping, whereby one halts the optimization process when the test score (performance on leftout data) for the internal cross-validation for model-selection stops improving, and (b) univariate feature-screening, whereby irrelevant (non-predictive) voxels are detected and eliminated before the optimization problem is entered, thus reducing the size of the problem. Empirical results with GraphNet on real MRI (Magnetic Resonance Imaging) datasets indicate that these heuristics are a win-win strategy, as they add speed without sacrificing the quality of the predictions. We expect the proposed heuristics to work on other models like TV-L1, etc.
We study an elliptic eigenvalue problem, with a random coefficient that can be parametrised by infinitely-many stochastic parameters. The physical motivation is the criticality problem for a nuclear reactor: in steady state the fission reaction can be modeled by an elliptic eigenvalue
problem, and the smallest eigenvalue provides a measure of how close the reaction is to equilibrium -- in terms of production/absorption of neutrons. The coefficients are allowed to be random to model the uncertainty of the composition of materials inside the reactor, e.g., the
control rods, reactor structure, fuel rods etc.
The randomness in the coefficient also results in randomness in the eigenvalues and corresponding eigenfunctions. As such, our quantity of interest is the expected value, with
respect to the stochastic parameters, of the smallest eigenvalue, which we formulate as an integral over the infinite-dimensional parameter domain. Our approximation involves three steps: truncating the stochastic dimension, discretizing the spatial domain using finite elements and approximating the now finite but still high-dimensional integral.
To approximate the high-dimensional integral we use quasi-Monte Carlo (QMC) methods. These are deterministic or quasi-random quadrature rules that can be proven to be very efficient for the numerical integration of certain classes of high-dimensional functions. QMC methods have previously been applied to linear functionals of the solution of a similar elliptic source problem; however, because of the nonlinearity of eigenvalues the existing analysis of the integration error
does not hold in our case.
We show that the minimal eigenvalue belongs to the spaces required for QMC theory, outline the approximation algorithm and provide numerical results.
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
The main challenge of concurrent software verification has always been in achieving modularity, i.e., the ability to divide and conquer the correctness proofs with the goal of scaling the verification effort. Types are a formal method well-known for its ability to modularize programs, and in the case of dependent types, the ability to modularize and scale complex mathematical proofs.
In this talk I will present our recent work towards reconciling dependent types with shared memory concurrency, with the goal of achieving modular proofs for the latter. Applying the type-theoretic paradigm to concurrency has lead us to view separation logic as a type theory of state, and has motivated novel abstractions for expressing concurrency proofs based on the algebraic structure of a resource and on structure-preserving functions (i.e., morphisms) between resources.
Slides to be used in the 11th International Computer Science Symposium in Russia (CSR 2016) to present the paper at http://dx.doi.org/10.1007/978-3-319-34171-2_11 (and arXiv'ed at http://arxiv.org/abs/1602.04732).
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to transform a non-deterministic calculus into a probabilistic one. We use as example λ+, a recently introduced calculus defined with techniques from deduction modulo.
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
Call-by-value non-determinism in a linear logic type disciplineAlejandro Díaz-Caro
We consider the call-by-value λ-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction.
Slides used during my thesis defense "Du typage vectoriel"Alejandro Díaz-Caro
The objective of this thesis is to develop a type theory for the linear-algebraic λ-calculus, an extension of λ-calculus motivated by quantum computing. This algebraic extension encompass all the terms of λ-calculus together with their linear combinations, so if t and r are two terms, so is α.t + β.r, with α and β being scalars from a given ring. The key idea and challenge of this thesis was to introduce a type system where the types, in the same way as the terms, form a vectorial space, providing the information about the structure of the normal form of the terms. This thesis presents the system Lineal, and also three intermediate systems, however interesting by themselves: Scalar, Additive and λCA, all of them with their subject reduction and strong normalisation proofs.
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity present in such formalisms. After proving the subject reduction and the strong normalisation properties, we propose a translation of this calculus into the System F with pairs, which corresponds to a non linear fragment of linear logic. The translation provides a deeper understanding of the linearity in our setting.
A type system for the vectorial aspects of the linear-algebraic lambda-calculusAlejandro Díaz-Caro
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms resulting from the reduction of programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We show that the resulting typed lambda-calculus is strongly normalizing and features a weak subject-reduction.
The linear-algebraic λ-calculus and the algebraic λ-calculus are untyped λ-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ-calculi are not confluent unless further restrictions are added. We provide a type system for the linear-algebraic λ-calculus enforcing strong normalisation, which gives back confluence. The type system allows an interpretation in System F.
The ability to recreate computational results with minimal effort and actionable metrics provides a solid foundation for scientific research and software development. When people can replicate an analysis at the touch of a button using open-source software, open data, and methods to assess and compare proposals, it significantly eases verification of results, engagement with a diverse range of contributors, and progress. However, we have yet to fully achieve this; there are still many sociotechnical frictions.
Inspired by David Donoho's vision, this talk aims to revisit the three crucial pillars of frictionless reproducibility (data sharing, code sharing, and competitive challenges) with the perspective of deep software variability.
Our observation is that multiple layers — hardware, operating systems, third-party libraries, software versions, input data, compile-time options, and parameters — are subject to variability that exacerbates frictions but is also essential for achieving robust, generalizable results and fostering innovation. I will first review the literature, providing evidence of how the complex variability interactions across these layers affect qualitative and quantitative software properties, thereby complicating the reproduction and replication of scientific studies in various fields.
I will then present some software engineering and AI techniques that can support the strategic exploration of variability spaces. These include the use of abstractions and models (e.g., feature models), sampling strategies (e.g., uniform, random), cost-effective measurements (e.g., incremental build of software configurations), and dimensionality reduction methods (e.g., transfer learning, feature selection, software debloating).
I will finally argue that deep variability is both the problem and solution of frictionless reproducibility, calling the software science community to develop new methods and tools to manage variability and foster reproducibility in software systems.
Exposé invité Journées Nationales du GDR GPL 2024
Toxic effects of heavy metals : Lead and Arsenicsanjana502982
Heavy metals are naturally occuring metallic chemical elements that have relatively high density, and are toxic at even low concentrations. All toxic metals are termed as heavy metals irrespective of their atomic mass and density, eg. arsenic, lead, mercury, cadmium, thallium, chromium, etc.
Salas, V. (2024) "John of St. Thomas (Poinsot) on the Science of Sacred Theol...Studia Poinsotiana
I Introduction
II Subalternation and Theology
III Theology and Dogmatic Declarations
IV The Mixed Principles of Theology
V Virtual Revelation: The Unity of Theology
VI Theology as a Natural Science
VII Theology’s Certitude
VIII Conclusion
Notes
Bibliography
All the contents are fully attributable to the author, Doctor Victor Salas. Should you wish to get this text republished, get in touch with the author or the editorial committee of the Studia Poinsotiana. Insofar as possible, we will be happy to broker your contact.
Professional air quality monitoring systems provide immediate, on-site data for analysis, compliance, and decision-making.
Monitor common gases, weather parameters, particulates.
What is greenhouse gasses and how many gasses are there to affect the Earth.moosaasad1975
What are greenhouse gasses how they affect the earth and its environment what is the future of the environment and earth how the weather and the climate effects.
Richard's aventures in two entangled wonderlandsRichard Gill
Since the loophole-free Bell experiments of 2020 and the Nobel prizes in physics of 2022, critics of Bell's work have retreated to the fortress of super-determinism. Now, super-determinism is a derogatory word - it just means "determinism". Palmer, Hance and Hossenfelder argue that quantum mechanics and determinism are not incompatible, using a sophisticated mathematical construction based on a subtle thinning of allowed states and measurements in quantum mechanics, such that what is left appears to make Bell's argument fail, without altering the empirical predictions of quantum mechanics. I think however that it is a smoke screen, and the slogan "lost in math" comes to my mind. I will discuss some other recent disproofs of Bell's theorem using the language of causality based on causal graphs. Causal thinking is also central to law and justice. I will mention surprising connections to my work on serial killer nurse cases, in particular the Dutch case of Lucia de Berk and the current UK case of Lucy Letby.
Deep Behavioral Phenotyping in Systems Neuroscience for Functional Atlasing a...Ana Luísa Pinho
Functional Magnetic Resonance Imaging (fMRI) provides means to characterize brain activations in response to behavior. However, cognitive neuroscience has been limited to group-level effects referring to the performance of specific tasks. To obtain the functional profile of elementary cognitive mechanisms, the combination of brain responses to many tasks is required. Yet, to date, both structural atlases and parcellation-based activations do not fully account for cognitive function and still present several limitations. Further, they do not adapt overall to individual characteristics. In this talk, I will give an account of deep-behavioral phenotyping strategies, namely data-driven methods in large task-fMRI datasets, to optimize functional brain-data collection and improve inference of effects-of-interest related to mental processes. Key to this approach is the employment of fast multi-functional paradigms rich on features that can be well parametrized and, consequently, facilitate the creation of psycho-physiological constructs to be modelled with imaging data. Particular emphasis will be given to music stimuli when studying high-order cognitive mechanisms, due to their ecological nature and quality to enable complex behavior compounded by discrete entities. I will also discuss how deep-behavioral phenotyping and individualized models applied to neuroimaging data can better account for the subject-specific organization of domain-general cognitive systems in the human brain. Finally, the accumulation of functional brain signatures brings the possibility to clarify relationships among tasks and create a univocal link between brain systems and mental functions through: (1) the development of ontologies proposing an organization of cognitive processes; and (2) brain-network taxonomies describing functional specialization. To this end, tools to improve commensurability in cognitive science are necessary, such as public repositories, ontology-based platforms and automated meta-analysis tools. I will thus discuss some brain-atlasing resources currently under development, and their applicability in cognitive as well as clinical neuroscience.
DERIVATION OF MODIFIED BERNOULLI EQUATION WITH VISCOUS EFFECTS AND TERMINAL V...Wasswaderrick3
In this book, we use conservation of energy techniques on a fluid element to derive the Modified Bernoulli equation of flow with viscous or friction effects. We derive the general equation of flow/ velocity and then from this we derive the Pouiselle flow equation, the transition flow equation and the turbulent flow equation. In the situations where there are no viscous effects , the equation reduces to the Bernoulli equation. From experimental results, we are able to include other terms in the Bernoulli equation. We also look at cases where pressure gradients exist. We use the Modified Bernoulli equation to derive equations of flow rate for pipes of different cross sectional areas connected together. We also extend our techniques of energy conservation to a sphere falling in a viscous medium under the effect of gravity. We demonstrate Stokes equation of terminal velocity and turbulent flow equation. We look at a way of calculating the time taken for a body to fall in a viscous medium. We also look at the general equation of terminal velocity.
(May 29th, 2024) Advancements in Intravital Microscopy- Insights for Preclini...Scintica Instrumentation
Intravital microscopy (IVM) is a powerful tool utilized to study cellular behavior over time and space in vivo. Much of our understanding of cell biology has been accomplished using various in vitro and ex vivo methods; however, these studies do not necessarily reflect the natural dynamics of biological processes. Unlike traditional cell culture or fixed tissue imaging, IVM allows for the ultra-fast high-resolution imaging of cellular processes over time and space and were studied in its natural environment. Real-time visualization of biological processes in the context of an intact organism helps maintain physiological relevance and provide insights into the progression of disease, response to treatments or developmental processes.
In this webinar we give an overview of advanced applications of the IVM system in preclinical research. IVIM technology is a provider of all-in-one intravital microscopy systems and solutions optimized for in vivo imaging of live animal models at sub-micron resolution. The system’s unique features and user-friendly software enables researchers to probe fast dynamic biological processes such as immune cell tracking, cell-cell interaction as well as vascularization and tumor metastasis with exceptional detail. This webinar will also give an overview of IVM being utilized in drug development, offering a view into the intricate interaction between drugs/nanoparticles and tissues in vivo and allows for the evaluation of therapeutic intervention in a variety of tissues and organs. This interdisciplinary collaboration continues to drive the advancements of novel therapeutic strategies.
This presentation explores a brief idea about the structural and functional attributes of nucleotides, the structure and function of genetic materials along with the impact of UV rays and pH upon them.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Towards a quantum lambda-calculus with quantum control
1. Towards a quantum λ-calculus
with quantum control
arXiv:1601.04294
Alejandro Díaz-Caro
UNIVERSIDAD NACIONAL DE QUILMES
Joint work with
Gilles Dowek
Inria & ENS-Cachan
V Congreso Latinoamericano de Matemáticos
Logic and Computability Session
Barranquilla, Colombia, July 14, 2016
2. Goal
We want a pure functional
extension of lambda calculusi.e. we do not want clasical control / quantum data
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 2 / 26
3. Overview
Some quantum properties (with dead and alive cats)
Projective measurement
Destructive interference
No-cloning
Entanglement and separability
Expressing those properties in the lambda-calculus
Superpositions, no-cloning and measurement
Examples
Deutsch algorithm
Teleportation algorithm
5. Projective measurement
α + β
|α|2
|β| 2
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 4 / 26
6. Probabilistic vs. Quantum
Destructive interference
Probabilistic
+
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
7. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
8. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α + β
α|2
+ |β
2
= 1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
9. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
10. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
11. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
α + β
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
12. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
3
4
+
1
4
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
13. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
3
4
+
1
4
5
8
+
3
8
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
14. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
3
4
+
1
4
5
8
+
3
8
1
√
2
1
√
2
+
1
√
2
+
1
√
2
1
√
2
−
1
√
2
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
15. Probabilistic vs. Quantum
Destructive interference
Probabilistic
a + b
(a + b = 1)
Quantum
α − β
α|2
+ |−β
2
= 1
1
2
1
2
+
1
2
+
1
2
3
4
+
1
4
5
8
+
3
8
1
√
2
1
√
2
+
1
√
2
+
1
√
2
1
√
2
−
1
√
2
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 5 / 26
16. No-cloning
Superpositions vs. basis states
There is no universal cloning machine
for quantum states
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 6 / 26
18. No-cloning
Superpositions vs. basis states
There is no universal cloning machine
for quantum states
α + β
α + β
α ⊗ + β ⊗
=
α + β ⊗ α + β
α2
⊗ +αβ ⊗ +βα ⊗ +β2
⊗
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 6 / 26
19. Entanglement and separability
Example 1
α ⊗ +β ⊗
=
α + β
Superposed state
⊗
Basis state
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 7 / 26
20. Entanglement and separability
Example 1
α ⊗ +β ⊗
=
α + β
Superposed state
⊗
Basis stateExample 2
α1α2 ⊗ +α1β1 ⊗ +β2α2 ⊗ +β1β2 ⊗
α1 + β1
Superposed state
⊗ α2 + β2
Superposed state
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 7 / 26
21. Entanglement and separability
Example 1
α ⊗ +β ⊗
=
α + β
Superposed state
⊗
Basis stateExample 2
α1α2 ⊗ +α1β1 ⊗ +β2α2 ⊗ +β1β2 ⊗
α1 + β1
Superposed state
⊗ α2 + β2
Superposed state
Example 3
α ⊗ + β ⊗
Entangled (and superposed) state
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 7 / 26
22. Overview
Some quantum properties (with dead and alive cats)
Projective measurement
Destructive interference
No-cloning
Entanglement and separability
Expressing those properties in the lambda-calculus
Superpositions, no-cloning and measurement
Examples
Deutsch algorithm
Teleportation algorithm
23. Logical linearity vs. algebraic linearity
No-cloning =⇒ logical-linear terms
e.g. λx.x ⊗ x forbidden
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 9 / 26
24. Logical linearity vs. algebraic linearity
No-cloning =⇒ logical-linear terms
e.g. λx.x ⊗ x forbidden
Another way
No-cloning =⇒ algebraic-linear operators
e.g. M(α. |0 + β. |1 ) → α.M |0 + β.M |1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 9 / 26
25. Logical linearity vs. algebraic linearity
No-cloning =⇒ logical-linear terms
e.g. λx.x ⊗ x forbidden
Another way
No-cloning =⇒ algebraic-linear operators
e.g. M(α. |0 + β. |1 ) → α.M |0 + β.M |1
What about measurement?
(λx.πx) (α. |0 + β. |1 )
(Measurement operator)
α.(λx.πx) |0 + β.(λx.πx) |1 ← Wrong!
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 9 / 26
26. Logical linearity vs. algebraic linearity
No-cloning =⇒ logical-linear terms
e.g. λx.x ⊗ x forbidden
Another way
No-cloning =⇒ algebraic-linear operators
e.g. M(α. |0 + β. |1 ) → α.M |0 + β.M |1
What about measurement?
(λx.πx) (α. |0 + β. |1 )
(Measurement operator)
α.(λx.πx) |0 + β.(λx.πx) |1 ← Wrong!
We can use a combination of both:
Logical-linear for abstractions taking superpositions
Algebraic-linear for abstractions taking basis states
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 9 / 26
27. Key point
We need to distinguish
superposed states
from
basis states
Basis states can be cloned
Superposed states cannot
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 10 / 26
28. Grammars
First version, without tensor
Types
Ψ := Q | S(Ψ) Qubit types
A := Ψ | Ψ ⇒ A | S(A) Types
Terms
b := x | λxΨ
.t | |0 | |1 Basis terms
v := b | v + v | α.v | 0S(A) Values
t := v | tt | t + t | α.t | πt | ?· Terms
where α ∈ C
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 11 / 26
29. Two types of linearity
(λxQ
.t) b
Q
→ t[b/x] call-by-base
(λxS(Ψ)
.t)
linear abstraction
u
S(Ψ)
→ t[u/x] call-by-name
(λxQ
.t) (b1 + b2)
S(Q)
→ (λxQ
.t) b1
Q
+(λxQ
.t) b2
Q
linear distribution
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 12 / 26
30. Two types of linearity
(λxQ
.t) b
Q
→ t[b/x] call-by-base
(λxS(Ψ)
.t)
linear abstraction
u
S(Ψ)
→ t[u/x] call-by-name
(λxQ
.t) (b1 + b2)
S(Q)
→ (λxQ
.t) b1
Q
+(λxQ
.t) b2
Q
linear distribution
Problem?
λxQ⇒Q
.x(|0 +|1 ) : (Q ⇒ Q) ⇒ Q Non-linear! (not a superposition)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 12 / 26
31. Two types of linearity
(λxQ
.t) b
Q
→ t[b/x] call-by-base
(λxS(Ψ)
.t)
linear abstraction
u
S(Ψ)
→ t[u/x] call-by-name
(λxQ
.t) (b1 + b2)
S(Q)
→ (λxQ
.t) b1
Q
+(λxQ
.t) b2
Q
linear distribution
Problem?
λxQ⇒Q
.x(|0 +|1 ) : (Q ⇒ Q) ⇒ Q Non-linear! (not a superposition)
No problem
It is a function which produces a superposition, is not a superposition
It can be cloned
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 12 / 26
32. Two types of linearity
(λxQ
.t) b
Q
→ t[b/x] call-by-base
(λxS(Ψ)
.t)
linear abstraction
u
S(Ψ)
→ t[u/x] call-by-name
(λxQ
.t) (b1 + b2)
S(Q)
→ (λxQ
.t) b1
Q
+(λxQ
.t) b2
Q
linear distribution
Problem?
λxQ⇒Q
.x(|0 +|1 ) : (Q ⇒ Q) ⇒ Q Non-linear! (not a superposition)
No problem
It is a function which produces a superposition, is not a superposition
It can be cloned
What about λyS(Q)
.λxQ
.xy ?
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 12 / 26
33. Two types of linearity
(λxQ
.t) b
Q
→ t[b/x] call-by-base
(λxS(Ψ)
.t)
linear abstraction
u
S(Ψ)
→ t[u/x] call-by-name
(λxQ
.t) (b1 + b2)
S(Q)
→ (λxQ
.t) b1
Q
+(λxQ
.t) b2
Q
linear distribution
Problem?
λxQ⇒Q
.x(|0 +|1 ) : (Q ⇒ Q) ⇒ Q Non-linear! (not a superposition)
No problem
It is a function which produces a superposition, is not a superposition
It can be cloned
What about λyS(Q)
.λxQ
.xy ?
Ok, let’s stay in first order for now
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 12 / 26
34. Typing applications
Γ t : Ψ ⇒ A ∆ u : Ψ
Γ, ∆ tu : A
⇒E
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 13 / 26
35. Typing applications
Γ t : Ψ ⇒ A ∆ u : Ψ
Γ, ∆ tu : A
⇒E
What about (λxQ
.t) (b1 + b2)
S(Q)
?
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 13 / 26
36. Typing applications
Γ t : Ψ ⇒ A ∆ u : Ψ
Γ, ∆ tu : A
⇒E
What about (λxQ
.t) (b1 + b2)
S(Q)
?
Γ t : Ψ ⇒ A ∆ u : S(Ψ)
Γ, ∆ tu : S(A)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 13 / 26
37. Typing applications
Γ t : Ψ ⇒ A ∆ u : Ψ
Γ, ∆ tu : A
⇒E
What about (λxQ
.t) (b1 + b2)
S(Q)
?
Γ t : Ψ ⇒ A ∆ u : S(Ψ)
Γ, ∆ tu : S(A)
What about ((λxQ
.t) + (λyQ
.u))
S(Q⇒A)
v?
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 13 / 26
38. Typing applications
Γ t : Ψ ⇒ A ∆ u : Ψ
Γ, ∆ tu : A
⇒E
What about (λxQ
.t) (b1 + b2)
S(Q)
?
Γ t : Ψ ⇒ A ∆ u : S(Ψ)
Γ, ∆ tu : S(A)
What about ((λxQ
.t) + (λyQ
.u))
S(Q⇒A)
v?
Γ t : S(Ψ ⇒ A) ∆ u : S(Ψ)
Γ, ∆ tu : S(A)
⇒ES
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 13 / 26
39. Example
f : Q ⇒ A g : Q ⇒ A
f + g : S(Q ⇒ A)
S+
I
|0 : Q
Ax|0
|0 : S(Q)
(f + g) |0 : S(A)
⇒ES
⇓
f : Q ⇒ A |0 : Q
Ax|0
f |0 : A
⇒E
g : Q ⇒ A |0 : Q
Ax|0
g |0 : A
⇒E
f |0 + g |0 : S(A)
S+
I
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 14 / 26
40. Measurement
π(
n
i=1
[αi.]bi) −→ |αk|2
n
i=1 |αi|2
bk
∀i, bi = |0 or bi = |1 .
n
i=1 αi .bi is normal (and hence 1 ≤ n ≤ 2).
k ≤ n
Example
π(i. |0 + 2. |1 )
|0
|1
1
3
2
3
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 15 / 26
41. Adding tensor products
Intepretation of types
S(Q) vs. Q
Q = {|0 , |1 } ⊆ C2
A ⊗ B = A × B
S(A) = G A
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 16 / 26
43. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
44. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
{|0 , |1 } × C2
⊂ C2
⊗ C2
then Q ⊗ S(Q) ≤ S(Q ⊗ Q)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
45. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
{|0 , |1 } × C2
⊂ C2
⊗ C2
then Q ⊗ S(Q) ≤ S(Q ⊗ Q)
|0 ⊗ (|0 + |1 ) : Q ⊗ S(Q)
|0 ⊗ |0 + |0 ⊗ |1 : S(Q ⊗ Q)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
46. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
{|0 , |1 } × C2
⊂ C2
⊗ C2
then Q ⊗ S(Q) ≤ S(Q ⊗ Q)
|0 ⊗ (|0 + |1 ) : Q ⊗ S(Q)
|0 ⊗ |0 + |0 ⊗ |1 : S(Q ⊗ Q)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
47. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
{|0 , |1 } × C2
⊂ C2
⊗ C2
then Q ⊗ S(Q) ≤ S(Q ⊗ Q)
|0 ⊗ (|0 + |1 ) : Q ⊗ S(Q)
|0 ⊗ |0 + |0 ⊗ |1 : S(Q ⊗ Q)
Same happens in math!
(X − 1)(X − 2) −→ X2
− 3X + 2
we lost the information that it was a product
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
48. Some information is lost on reduction
Subtyping
{|0 , |1 } ⊂ C2
then Q ≤ S(Q)
G(GA) = GA then S(S(Q)) ≤ S(Q)
{|0 , |1 } × C2
⊂ C2
⊗ C2
then Q ⊗ S(Q) ≤ S(Q ⊗ Q)
|0 ⊗ (|0 + |1 ) : Q ⊗ S(Q)
|0 ⊗ |0 + |0 ⊗ |1 : S(Q ⊗ Q)
Same happens in math!
(X − 1)(X − 2) −→ X2
− 3X + 2
we lost the information that it was a product
Solution: casting
|0 ⊗ (|0 + |1 ) |0 ⊗ |0 + |0 ⊗ |1
⇑
S(Q⊗Q)
Q⊗S(Q) |0 ⊗ (|0 + |1 ) → |0 ⊗ |0 + |0 ⊗ |1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 17 / 26
49. Full grammars
Types
Q := Q | Q ⊗ Q Basis qubit types
Ψ := Q | S(Ψ) | Ψ ⊗ Ψ Qubit types
A := Ψ | Ψ ⇒ A | S(A) | A ⊗ A Types
Terms
b := x | λxΨ
.t | |0 | |1 | b ⊗ b Basis terms
v := b | v + v | α.v | 0S(A) | v ⊗ v Values
t := v | tt | t + t | α.t | πj t | ?·
| t ⊗ t | head t | tail t | ⇑
S(B⊗C)
S(A) t
Terms
where α ∈ C
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 18 / 26
51. Overview
Some quantum properties (with dead and alive cats)
Projective measurement
Destructive interference
No-cloning
Entanglement and separability
Expressing those properties in the lambda-calculus
Superpositions, no-cloning and measurement
Examples
Deutsch algorithm
Teleportation algorithm
52. Deutsch algorithm
Preliminaries
Hadamard
H |0 =
1
√
2
|0 +
1
√
2
|1 H |1 =
1
√
2
|0 −
1
√
2
|1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 21 / 26
53. Deutsch algorithm
Preliminaries
Hadamard
H |0 =
1
√
2
|0 +
1
√
2
|1 H |1 =
1
√
2
|0 −
1
√
2
|1
H = λxQ
.1/
√
2.(|0 + x?−|1 ·|1 )
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 21 / 26
54. Deutsch algorithm
Preliminaries
Hadamard
H |0 =
1
√
2
|0 +
1
√
2
|1 H |1 =
1
√
2
|0 −
1
√
2
|1
H = λxQ
.1/
√
2.(|0 + x?−|1 ·|1 )
Oracle
A “black box” implementing a function f : {0, 1} → {0, 1}
Uf (|x ⊗ |y ) = |x ⊗ |y ⊕ f (x)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 21 / 26
55. Deutsch algorithm
Preliminaries
Hadamard
H |0 =
1
√
2
|0 +
1
√
2
|1 H |1 =
1
√
2
|0 −
1
√
2
|1
H = λxQ
.1/
√
2.(|0 + x?−|1 ·|1 )
Oracle
A “black box” implementing a function f : {0, 1} → {0, 1}
Uf (|x ⊗ |y ) = |x ⊗ |y ⊕ f (x)
not = λxQ
.x?|0 ·|1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 21 / 26
56. Deutsch algorithm
Preliminaries
Hadamard
H |0 =
1
√
2
|0 +
1
√
2
|1 H |1 =
1
√
2
|0 −
1
√
2
|1
H = λxQ
.1/
√
2.(|0 + x?−|1 ·|1 )
Oracle
A “black box” implementing a function f : {0, 1} → {0, 1}
Uf (|x ⊗ |y ) = |x ⊗ |y ⊕ f (x)
not = λxQ
.x?|0 ·|1
Uf = λxQ⊗Q
.(head x) ⊗ ((tail x)?not(f (head x))·f (head x))
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 21 / 26
57. Deutsch algorithm
Goal:
Given an oracle Uf determine whether f is constant or not
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 22 / 26
58. Deutsch algorithm
Goal:
Given an oracle Uf determine whether f is constant or not
|0 H
Uf
H
|1 H
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 22 / 26
59. Deutsch algorithm
Goal:
Given an oracle Uf determine whether f is constant or not
|0 H
Uf
H ± |f (0) ⊕ f (1)
|1 H
1√
2
|0 − 1√
2
|1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 22 / 26
60. Deutsch algorithm
Goal:
Given an oracle Uf determine whether f is constant or not
|0 H
Uf
H ± |f (0) ⊕ f (1)
|1 H
1√
2
|0 − 1√
2
|1
If f constant, f (0) ⊕ f (1) = 0
± |0 ⊗
1
√
2
|0 −
1
√
2
|1
If f not constant, f (0) ⊕ f (1) = 1
± |1 ⊗
1
√
2
|0 −
1
√
2
|1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 22 / 26
61. Deutsch in λ
|0 H
Uf
H ± |f (0) ⊕ f (1)
|1 H
1√
2
|0 − 1√
2
|1
not = λxQ
.x?|0 ·|1
H = λxQ
.1/
√
2.(|0 + x?−|1 ·|1 )
Hboth = λxQ⊗Q
.(H(head x)) ⊗ (H(tail x))
Uf = λxQ⊗Q
.(head x) ⊗ ((tail x)?not(f (head x))·f (head x))
H1 = λxQ⊗Q
.(H(head x)) ⊗ (tail x)
Deutschf = π1(⇑
S(Q⊗Q)
S(S(Q)⊗Q) H1(Uf ⇑
S(Q⊗Q)
S(Q⊗S(Q))⇑
S(Q⊗S(Q))
S(S(Q)⊗S(Q)) Hboth(|0 ⊗ |1 )
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 23 / 26
63. Teleportation
Goal:
To send a qubit, using an entangled pair, by sending only two bits
of information
Alice
|ψ • H
β00
Zb1
notb2 |ψ
Bob
where β00 = 1√
2
|0 ⊗ |0 + 1√
2
|1 ⊗ |1
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 24 / 26
64. Teleportation in λ
Alice
|ψ • H
β00
Zb1
notb2 |ψ
Bob
Teleportation : S(Q) ⇒ S(Q)
Teleportation q −→(1) q
Alice =
λxS(Q)⊗S(Q⊗Q)
.π2(⇑
S(Q⊗Q⊗Q)
S(S(Q)⊗Q⊗Q) H3
1 (cnot3
12 ⇑
S(Q⊗Q⊗Q)
S(Q⊗S(Q⊗Q))⇑
S(Q⊗S(Q⊗Q))
S(S(Q)⊗S(Q⊗Q)) x))
Ub
= λbQ
.λxQ
.b?Ux·x
Bob = λxQ⊗Q⊗Q
.Zhead x
nothead tail x
.(tail tail x)
β00 = 1/
√
2. |0 ⊗ |0 + 1/
√
2. |1 ⊗ |1
Teleportation = λqS(Q)
.Bob (⇑
S(Q⊗Q⊗Q)
S(Q⊗Q⊗S(Q)) Alice x ⊗ β00)
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 25 / 26
65. Summarising
Extension of (pure) first-order lambda-calculus for
quantum computing
Logical-linearity and algebraic-linearity both used for
no-cloning
Denotational semantics:
Types: sets of vectors or vector spaces
Terms: vectors
If Γ t : A then t φΓ
⊆ A
Alejandro Díaz-Caro (UNQ) Towards a quantum lambda calculus with quantum control 26 / 26